Performance characteristics of parallel SOVA Algorithm

Turbo coding is a powerful encoding and decoding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratio. According to the computational complexity/delay of the employed decoding algorithms, such as maximum a posteriori algorithm (MAP), log maximum a poste...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:I-Manager's Journal on Future Engineering and Technology Ročník 2; číslo 3; s. 63 - 71
Hlavní autoři: Ruckmani, S.R, Anbalagan, P.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Nagercoil iManager Publications 01.02.2007
Témata:
Algorithms
Complexity
Decoders
Decoding
Delay
Mathematical models
Signal to noise ratio
Tradeoffs
ISSN:0973-2632, 2230-7184
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Turbo coding is a powerful encoding and decoding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratio. According to the computational complexity/delay of the employed decoding algorithms, such as maximum a posteriori algorithm (MAP), log maximum a posteriori algorithm (Log-MAP) and Soft Output Viterbi Algorithm (SOVA), the realization of turbo decoders usually takes a large amount of memory space and potentially long decoding delay. Therefore, an efficient method to reduce decoding complexity/delay becomes one of the key factors toward successfully designing turbo decoders. In this paper, reducing decoding complexity/delay of turbo decoding algorithms is approached by parallel SOVA (T-SOVA) scheme. The best schemes are presented for various variables considering trade-off between decoder performance and complexity. This method will reduce the decoding complexity/delay by at least 50% without big impact on the system performance.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0973-2632
2230-7184
DOI:10.26634/jfet.2.3.826