Iteration Optimized Layered Tabu Search for large scale MIMO detection

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

doi:10.1109/iemecon53809.2021.9689202

Cited by 3 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, the effective number of arithmetic operations required is the same as the number of operations required for G ¼ R T R. Computations in the proposed method are performed in the real domain. Therefore, using ( 27) and (28), the total number of real additions and multiplications required for the proposed pre-computations are 1 3 N t ð4N 2 t À 1Þ and…”

Section: Complexity Reduction In Gram Matrix Computationmentioning

confidence: 99%

See 1 more Smart Citation

Low complexity hybrid layered tabu‐likelihood ascent search for large MIMO detection with perfect and estimated channel state information

2022

Self Cite

View full text Add to dashboard Cite

In this work, we proposed a low-complexity hybrid layered tabu-likelihood ascent search (LTLAS) algorithm for large multiple-input multiple-output (MIMO) system. The conventional layered tabu search (LTS) approach involves many partial reactive tabu searches (RTSs), and each RTS requires an initialization and searching phase. In the proposed algorithm, we restricted the upper limit of the number of RTS operations. Once RTS operations exceed the limit, RTS will be replaced by low-complexity likelihood ascent search (LAS) operations. The block-based detection approach is considered to maintain a higher signal-to-noise ratio (SNR) detection performance. An efficient precomputation technique is derived, which can suppress redundant computations. The simulation results show that the bit error rate (BER) performance of the proposed detection method is close to the conventional LTS method. The complexity analysis shows that the proposed method has significantly lower computational complexity than conventional methods. Also, the proposed method can reduce almost 50% of real operations to achieve a BER of 10 À3 .

show abstract

Section: Complexity Reduction In Gram Matrix Computationmentioning

confidence: 99%

“…However, these methods are unsuitable for achieving optimal error performance for higher-order modulations like 64-QAM. A layered tabu search (LTS) scheme [9,12,28] is expected to solve this issue, which performs TS in layers. It can reduce complexity for higher SNR conditions by skipping several RTS operations.…”

Section: Introductionmentioning

confidence: 99%

Low complexity hybrid layered tabu‐likelihood ascent search for large MIMO detection with perfect and estimated channel state information

2022

Self Cite

View full text Add to dashboard Cite

show abstract

Low Complexity, Pairwise Layered Tabu Search for Large Scale MIMO Detection

Chakraborty

Sinha

Mitra

2022

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

This paper presents a low complexity pairwise layered tabu search (PLTS) based detection algorithm for a large-scale multiple-input multipleoutput (MIMO) system. The proposed algorithm can compute two layers simultaneously and reduce the effective number of tabu searches. A metric update strategy is developed to reuse the computations from past visited layers. Also, a precomputation technique is adapted to reduce the redundancy in computation within tabu search iterations. Complexity analysis shows that the upper bound of initialization complexity in the proposed algorithm reduces from O(N 4 t ) to O(N 3 t ). The detection performance of the proposed detector is almost the same as the conventional complex version of LTS for 64QAM and 16QAM modulations. However, the proposed detector outperforms the conventional system for 4QAM modulation, especially in 16 × 16 and 8 × 8 MIMO. Simulation results show that the per cent of complexity reduction in the proposed method is approximately 75% for 64 × 64, 64QAM and 85% for 64 × 64 16QAM systems to achieve a BER of 10 −3 . Moreover, we have proposed a layer-dependent iteration number that can further reduce the upper bound of complexity with minor degradation in detection performance.

show abstract