Turbo Decoding With Early State Decisions
Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Turbo codes was first presented in 1993 by C. Berrou, A. Glavieux and P. Thitimajshima. Since then this class of error correcting codes has become one of the most popular, because of its good properties. The turbo codes are able to come very close to theoretical limit, the Shannon limit. Turbo codes are for example used in the third generation of mobile phone (3G) and in the standard IEEE 802.16 (WiMAX).
There are some drawbacks with the algorithm for decoding turbo codes. The deocoder uses a Maximum A Posteriori (MAP) algorithm, which is a complex algorith. Because of the use of many variables in the decoder the decoding circuit will consume a lot of power due to memory accesses and internal communication. One way in which this can be reduced is to make early decisions.
In this work I have focused on making early decision of the encoder states. One major part of the work was also to be sure that the expressions were written in a way that as few variables as possible are needed. A termination condition is also introduced. Simulations based on estimations of the number of memory accesses, shows that the number of memory accesses will significantly decrease.
Place, publisher, year, edition, pages
Institutionen för systemteknik , 2008. , 59 p.
turbo codes, turbo decoding, error correcting codes, convolutional codes, MAP-decoder, log-MAP-decoder, early decisions, early state decisions
Other Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:liu:diva-11694ISRN: LiTH-ISY-EX--08/4120--SEOAI: oai:DiVA.org:liu-11694DiVA: diva2:18118
2008-04-18, Nollstället, B-huset, Linköpings Universitet, Linköping, 15:15 (English)