Bit-Clusters Trellis Search Based Iterative MIMO Detection Algorithm.

Saved in:

Bibliographic Details
Title:	Bit-Clusters Trellis Search Based Iterative MIMO Detection Algorithm.
Authors:	Lou, Xizhong¹ lou999@gmail.com, Peng, Ting¹, Zhou, Qian¹, Chen, Yanmin¹
Source:	Wireless Personal Communications. Mar2015, Vol. 81 Issue 2, p547-562. 16p.
Subjects:	MIMO systems, Trellis-coded modulation, Algorithms, Wireless communications, Ad hoc computer networks
Abstract:	A bit-clusters trellis-search (BCTS) based soft-input soft-output detection algorithm is proposed for iterative Multiple-Input Multiple-Output (MIMO) receivers. Compared to the symbol nodes trellis-search (SNTS) based MIMO detection algorithm, which significantly reduces the search complexity by limiting the number of candidates in each trellis stage compared to sphere decoding algorithm, the BCTS algorithm proposed in this article further reduces the number of candidates in the trellis. In the BCTS algorithm, we replace the symbol node in SNTS algorithm with bit-cluster that represents several relative symbols whose corresponding bit is 0 or 1 while the other bits are not concerned. Because the bit-cluster number is fewer than the symbol node number, the search complexity of proposed BCTS algorithm is much less than that of the SNTS algorithm. The simulation results show, by transforming symbol nodes to bit-clusters in trellis-search detection, the performance is improved nearly 0.5 dB when the bit-error-ratio reaches $$10^{-4}$$ ; the complexity analysis shows the number of partial-Euclidian-distance (PED) comparisons and PED computations are approximately three and one times fewer than that of the SNTS algorithm respectively when constellation size is beyond 16. And this tendency will be more obvious with the transmit antenna number and constellation size increasing. [ABSTRACT FROM AUTHOR]
	Copyright of Wireless Personal Communications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	A bit-clusters trellis-search (BCTS) based soft-input soft-output detection algorithm is proposed for iterative Multiple-Input Multiple-Output (MIMO) receivers. Compared to the symbol nodes trellis-search (SNTS) based MIMO detection algorithm, which significantly reduces the search complexity by limiting the number of candidates in each trellis stage compared to sphere decoding algorithm, the BCTS algorithm proposed in this article further reduces the number of candidates in the trellis. In the BCTS algorithm, we replace the symbol node in SNTS algorithm with bit-cluster that represents several relative symbols whose corresponding bit is 0 or 1 while the other bits are not concerned. Because the bit-cluster number is fewer than the symbol node number, the search complexity of proposed BCTS algorithm is much less than that of the SNTS algorithm. The simulation results show, by transforming symbol nodes to bit-clusters in trellis-search detection, the performance is improved nearly 0.5 dB when the bit-error-ratio reaches $$10^{-4}$$ ; the complexity analysis shows the number of partial-Euclidian-distance (PED) comparisons and PED computations are approximately three and one times fewer than that of the SNTS algorithm respectively when constellation size is beyond 16. And this tendency will be more obvious with the transmit antenna number and constellation size increasing. [ABSTRACT FROM AUTHOR]
ISSN:	09296212
DOI:	10.1007/s11277-014-2144-x