Name
Abstract | ||
|---|---|---|
An efficient turbo decoder must access memory in parallel and with two different access patterns. It is shown that the problem of accessing memory both with sequential and in- terleaved access patterns is analogous to the graph color- ing problem. The derivation proves that the obtained graph is bipartite and, therefore, only two memory banks are re- quired in theory. For practical implementations, a system with four memory modules and a buffer is proposed. It is shown that modest buffer length is sufficient for 3GPP stan- dard interleavers. There is no performance degradation in the proposed system and the address generation and memory interfaces are of modest complexity. |
Year | Venue | Keywords |
|---|---|---|
2007 | EUSIPCO | 3g mobile communication,decoding,graph colouring,turbo codes,3gpp standard interleavers,graph coloring problem,interleaved access patterns,memory access,memory banks,memory modules,parallel memory organization,sequential access patterns,turbo decoders |
Field | DocType | ISBN |
Interleaved memory,Semiconductor memory,Uniform memory access,Physical address,Shared memory,Computer science,Parallel computing,Memory management,Flat memory model,Distributed shared memory | Conference | 978-839-2134-04-6 |
Citations | PageRank | References |
5 | 0.59 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Perttu Salmela | 1 | 50 | 10.13 |
| Ruirui Gu | 2 | 56 | 6.71 |
| Shuvra S. Bhattacharyya | 3 | 1416 | 162.67 |
| Jarmo Takala | 4 | 552 | 76.39 |