DocumentCode
1606575
Title
Parallel low memory size decoder
Author
Niu, Kai ; Wu, Wei Ling
Author_Institution
Sch. of Inf. Eng., Beijing Posts & Telecommun. Univ., China
Volume
2
fYear
2003
Firstpage
874
Abstract
The original turbo-decoding algorithm is a serial mode, which requires large memory and long decoding latency. These drawbacks limit the turbo codes to the real time applications. In this paper, a parallel decoding with sliding window (PDSW) algorithm is proposed in order to reduce the memory requirement. On the one hand, the PDSW algorithm outperforms the serial algorithm by few tenths of a decibel with the same decoding complexity. In addition, it requires memory approximate one magnitude less than the serial algorithm. Hence this algorithm is valuable for the hardware implementation.
Keywords
iterative decoding; parallel algorithms; real-time systems; turbo codes; decoding complexity; decoding latency; hardware implementation; parallel decoding with sliding window algorithm; parallel low memory size decoder; real time application; serial algorithm; serial mode; turbo-decoding algorithm; AWGN channels; Belief propagation; Binary phase shift keying; Convolutional codes; Delay; Electronic mail; Hardware; Iterative algorithms; Iterative decoding; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Technology Proceedings, 2003. ICCT 2003. International Conference on
Print_ISBN
7-5635-0686-1
Type
conf
DOI
10.1109/ICCT.2003.1209671
Filename
1209671
Link To Document