2007
DOI: 10.1109/tvlsi.2007.899237
|View full text |Cite
|
Sign up to set email alerts
|

SIMD Processor-Based Turbo Decoder Supporting Multiple Third-Generation Wireless Standards

Abstract: Abstract-A programmable turbo decoder is designed to support multiple third-generation wireless communication standards. We propose a hybrid architecture of hardware and software, which has small size, low power, and high performance like hardware implementations, as well as the flexibility and programmability of software. It mainly consists of a configurable hardware soft-inputsoft-output (SISO) decoder and a 16-b single-instruction multipledata processor, which is equipped with five processing elements and s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2008
2008
2014
2014

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(10 citation statements)
references
References 15 publications
0
10
0
Order By: Relevance
“…To make a fair comparison, we show the normalized chip area for each implementation; furthermore, for those supporting parallel interleaving address generation, the chip area is further normalized by the supported parallelism to determine an equivalent chip area for each generated interleaving address. The results in [9], [22], [37], [44] support on-the-fly interleaving address generation for HSPA+, but they do not support parallel decoding due to the lack of a memory conflict solver. The interleavers in [10], [11] are not reconfigurable because they support only one block size.…”
Section: A Implementation Results For the Contention-free Hspa+ Intementioning
confidence: 99%
See 1 more Smart Citation
“…To make a fair comparison, we show the normalized chip area for each implementation; furthermore, for those supporting parallel interleaving address generation, the chip area is further normalized by the supported parallelism to determine an equivalent chip area for each generated interleaving address. The results in [9], [22], [37], [44] support on-the-fly interleaving address generation for HSPA+, but they do not support parallel decoding due to the lack of a memory conflict solver. The interleavers in [10], [11] are not reconfigurable because they support only one block size.…”
Section: A Implementation Results For the Contention-free Hspa+ Intementioning
confidence: 99%
“…It is of great interest for mobile devices to support multiple standards. As an essential building block, multi-standard turbo decoders have been studied in the literature [10], [13], [14], [16], [18], [20], [23], [34], [37]- [39]. However, since the challenging memory conflict problem caused by the HSPA+ interleaving algorithm limits the parallelism degree of turbo decoders, none of them can meet the high throughput requirements of the recent HSPA+ extensions (336 Mbps for 3GPP Release 11 and 672 Mbps proposed for 3GPP Release 12 and up).…”
mentioning
confidence: 99%
“…For example, by applying radix-4 algorithms the decoders in [10,12] can process more than one trellis stage in one clock cycle. A slightly more flexible solution is to use monolithic accelerator, which is accompanied with a fully programmable processor like in [13,14]. However, a monolithic solution can be uneconomical if the memory banks are not shared.…”
Section: Turbo Decoder Implementationsmentioning
confidence: 99%
“…On the contrary to [10,11], the proposed processor is programmable. When compared to [13,14], the applicationspecific computing resources are accessed via datapath in the proposed processor. Thus, the resources can be controlled in detail with software.…”
Section: Turbo Decoder Implementationsmentioning
confidence: 99%
“…2) The design of flexible architectures able to support multiple codes [7], [8], [9]. 3) The design of parallel decoders to sustain very high throughput (tens or hundreds of Mb/s), where the interleaver parallelization is particularly challenging, due to the problem of collisions in memory access [10], [11], [12].…”
Section: Introductionmentioning
confidence: 99%