Performance Evaluation of Fixed Point FSD Using 1's Complement Based Approximation

Chakraborty, Sourav; Sinha, Nirmalendu Bikas; Mitra, Mandar

doi:10.1109/icimia48430.2020.9074960

Cited by 2 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…is the survival probability of (2i − 1)th and 2ith level nodes of jth branch of the tree. It is worth to mention that (22) is the generic form of the expected node visit and its closed-form solution is difficult to achieve due to the involvement of different parameters. However, the upper and lower limit of the expected complexity can determined from (22) by setting Pr(T (j) 2i ≤ 𝜆 i |R, 𝜆 i , f i , 𝜎 2 ) to one or zero, respectively.…”

Section: Number Of Node Visit Comparisonmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic branch pruning aided low switching fixed complexity sphere decoding for small scale and massive MIMO detection

Chakraborty

Sinha

Mitra

2022

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

In this article, we have proposed a dynamic branch pruning aided low switching fixed complexity sphere decoding (LSFSD) algorithm that can reduce the number of node visits in conventional fixed‐complexity sphere decoder (FSD) or imbalanced fixed‐complexity sphere decoder (IFSD) detector dynamically based on the channel condition. Further, we propose a low complexity QR‐based FSD ordering scheme in the real domain that requires half of the number of real arithmetic operations in the conventional case. As a case study, we have simulated the proposed algorithm for 4prefix×4$$ 4\times 4 $$ and 6prefix×6$$ 6\times 6 $$ MIMO system with 64‐QAM modulation. The simulation results show that the proposed algorithm can reduce approximately 50% of node visits to achieve a BER of 10prefix−3$$ 1{0}^{-3} $$. Additionally, a low complexity solution of the soft bit information generation method is also proposed. The concept is further extended to massive MIMO applications where the number of receiving antenna to transmit antenna ratio is close to one. A smaller node extension parameter is defined for the proposed detector to reduce the complexity in massive MIMO detection. Simulation results demonstrate that the proposed detection algorithm has significantly lower computational complexity than other recent state‐of‐the‐art detection algorithms for massive MIMO and large MIMO systems.

show abstract

Section: Number Of Node Visit Comparisonmentioning

confidence: 99%

“…Moreover, the dynamic power consumption of these algorithms is minimized by reducing the hardware resources, and precomputation. 20 Recently 1's complement-based fixed-point computation technique is proposed 22,23 to minimize hardware resources for FSD and IFSD detectors.…”

Section: Introductionmentioning

confidence: 99%