A low complex turbo decoding algorithm with early iteration termination

In this paper a log-MAP turbo decoding algorithm which incorporates reliability threshold based trellis branch elimination together with mean based early iteration termination has been proposed. The proposed algorithm reduces computational complexity by eliminating branches in trellis. Since the min...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI) s. 325 - 331
Hlavní autoři: Seethal, C. R., Yamuna, B.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2017
Témata:
Complexity reduction
Complexity theory
Decoding
GNU Radio
Iteration termination
Iterative decoding
Mathematical model
Measurement
Reliability
Software
Turbo decoder
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í:In this paper a log-MAP turbo decoding algorithm which incorporates reliability threshold based trellis branch elimination together with mean based early iteration termination has been proposed. The proposed algorithm reduces computational complexity by eliminating branches in trellis. Since the minimum Log Likelihood Ratio (LLR) obtained for each iteration varies with channel conditions, an early iteration termination based on the mean of extrinsic information has been combined with branch elimination. Here, complexity mitigation is done both in terms of branch elimination and iteration reduction with negligible performance degradation. By reducing the computational complexity, decoding delay, power consumptions and error accumulation imparted by additional iterations etc can be minimized.
DOI:10.1109/ICACCI.2017.8125861