Title :
Turbo decoder implementation
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., CA, USA
fDate :
6/23/1905 12:00:00 AM
Abstract :
Recently, turbo code has gathered much attention for its outstanding performance. However, its complexity and decoding latency are severe drawbacks. Turbo code has been adopted in the 3GPP specification as one of the channel coding schemes. To implement a turbo decoder compliant with the 3GPP specification, the author adopted the sliding window method and devised a way to simplify the E-function of the MAP algorithm. This paper covers the optimum sliding window size and piecewise-linear E-function. In addition, implementing a scheme using the sliding window algorithm is covered. This focuses on implementing an interleaver and deinterleaver. The turbo decoder described is designed according to the 3GPP specification, and every simulation was done under AWGN
Keywords :
AWGN channels; channel coding; concatenated codes; interleaved codes; iterative decoding; maximum likelihood decoding; mobile radio; optimisation; piecewise linear techniques; turbo codes; 3GPP specification; AWGN; MAP algorithm; channel coding; decoding latency; deinterleaver; interleaver; optimum sliding window size; piecewise-linear E-function; sliding window method; turbo code; turbo decoder; Algorithm design and analysis; Arithmetic; Degradation; Delay; Iterative algorithms; Iterative decoding; Table lookup; Time factors; Turbo codes; Viterbi algorithm;
Conference_Titel :
Vehicular Technology Conference, 2001. VTC 2001 Fall. IEEE VTS 54th
Conference_Location :
Atlantic City, NJ
Print_ISBN :
0-7803-7005-8
DOI :
10.1109/VTC.2001.956515