4 research outputs found
A Low Complexity Block Turbo Decoder Architecture
No full textInternational audienceWe present a low-complexity architecture designed for the decoding of block turbo codes. In particular we simplify the implementation of Pyndiah's algorithm by not memorizing any of the concurrent codewords generated by the Chase search
New architecture for high data rate turbo decoding of product codes
Get PDFInternational audienceThis paper presents a new circuit architecture for turbo decoding, which achieves very high data rates when using product codes as error correcting codes. Although this architecture is independent of the elementary code (convolutional or block) used and of the corresponding decoding algorithms, we focus here on the case of product codes. This innovative circuit architecture stores several data at the same adress and performs parallel decoding to increase the data rate. It is able to process several date simultaneously with one memory (classical designs require m memories); its latency decreases when the amont of data processed simultaneously is large. We present results on block turbo decoder designs of 2-data, 4-date and 8-data decoders (where 2, 4 and 8 are the number of data symbos processed simultaneously). For each decoder circuit, the latency is decreased, the area of the processing unit is inscreased by a factor m and the critical path and memory size are constant (the data rate is increased by m2 if we have m paralel decoders)
