scholarly journals Sparsity-Aware Sphere Decoding: Algorithms and Complexity Analysis

2014 ◽  
Vol 62 (9) ◽  
pp. 2212-2225 ◽  
Author(s):  
Somsubhra Barik ◽  
Haris Vikalo
Keyword(s):  
Complexity Analysis ◽  
Sphere Decoding ◽  
Decoding Algorithms ◽  
Algorithms And Complexity

scholarly journals SYMBOL LEVEL DECODING FOR DUO-BINARY TURBO CODES

2017 ◽  
Vol 18 (1) ◽  
pp. 111-131 ◽  
Author(s):  
Yogesh Beeharry ◽  
Tulsi Pawan Fowdur ◽  
Krishnaraj M. S. Soyjaudah
Keyword(s):  
Computational Complexity ◽  
Turbo Codes ◽  
Complexity Analysis ◽  
Error Floor ◽  
Decoding Complexity ◽  
Decoding Algorithms ◽  
Level Information ◽  
Simulation Results

This paper investigates the performance of three different symbol level decoding algorithms for Duo-Binary Turbo codes. Explicit details of the computations involved in the three decoding techniques, and a computational complexity analysis are given. Simulation results with different couple lengths, code-rates, and QPSK modulation reveal that the symbol level decoding with bit-level information outperforms the symbol level decoding by 0.1 dB on average in the error floor region. Moreover, a complexity analysis reveals that symbol level decoding with bit-level information reduces the decoding complexity by 19.6 % in terms of the total number of computations required for each half-iteration as compared to symbol level decoding.

Sphere Decoding Algorithms With Improved Radius Search

2005 ◽  
Vol 53 (7) ◽  
pp. 1104-1109 ◽  
Author(s):  
W. Zhao ◽  
G.B. Giannakis
Keyword(s):  
Sphere Decoding ◽  
Decoding Algorithms
Sign in / Sign up

Export Citation Format

Share Document