Implementation and performance of a turbo/MAP decoder
โ Scribed by Pietrobon, Steven S.
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 462 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0737-2884
No coin nor oath required. For personal study only.
โฆ Synopsis
The implementation and performance of a turbo/MAP decoder are described. A serial block MAP decoder operating in the logarithm domain is used to obtain a very-high-performance turbo decoder. Programmable gate arrays and EPROMs allow the decoder to be programmed for almost any code from four to 512 states, rate 1/3 to rate 1/7 (higher rates are achieved with puncturing) and interleaver block sizes to 65,536 bits. Seven decoding stages were implemented in parallel. For rate 1/3 and 1/7 16-state codes with an interleaver size of 65,536 bits and operating at up to 356 kbit/s the codec achieved an E b /N 0 of 0โข32 and -0โข30 dB respectively for a BER of 10 -5 . BERs down to 10 -7 were also achieved for a small increase in E b /N 0 . An efficient implementation of a continuous MAP decoder is also presented, along with a synchronization technique for turbo decoders.
๐ SIMILAR VOLUMES
For estimating the states or outputs of a Markov process, the symbol-by-symbol maximum a posteriori (MAP) algorithm is optimal. However, this algorithm, even in its recursive form, poses technical difficulties because of numerical representation problems, the necessity of non-linear functions and a
The recent development of telecommunication networks has contributed to the success of applications such as information retrieval and electronic commerce, as well as all the services that take advantage of communication in distributed systems. In this area, the emerging technology of mobile agents a