A fast recursive algorithm for optimum sequential signal detection in a BLAST system

Benesty, Jacob; Huang, Yiteng; Chen, Jingdong

doi:10.1109/icassp.2003.1199878

Cited by 106 publications

(179 citation statements)

References 5 publications

Supporting

Mentioning

179

Contrasting

Order By: Relevance

“…Assuming N T = N R , the speedups of Hybrid-I and Hybrid-II over the NC-BLAST (BS-BLAST) algorithm are about [8] (BS-BLAST-OQRD), our proposals reduce the computational effort by a factor of about 1.82 and 2.00 (2.09 and 2.30). Furthermore, we emphasize that besides having fewer arithmetic operations, the implementation is further simplified by avoiding the recursive size reduction and/or permutation necessary in NC-BLAST and NC-BLAST-RMI [8].…”

Section: Complexity Comparisonmentioning

confidence: 99%

“…Furthermore, we emphasize that besides having fewer arithmetic operations, the implementation is further simplified by avoiding the recursive size reduction and/or permutation necessary in NC-BLAST and NC-BLAST-RMI [8]. Moreover, MMSE is involved without additional computations and memory assignment.…”

Section: Complexity Comparisonmentioning

confidence: 99%

“…We emphasize that the most computational intensive part in NC-BLAST is the multiple matrix inversion, i.e., the M [k] calculation in the preprocessing. To reduce the complexity of NC-BLAST, the recursive matrix inversion (RMI) algorithms computing matrix inverse under a recursive updating fashion was proposed in [8], [9], which reduce the complexity from O(…”

Section: Nulling and Cancellation (Nc) Interface Blast (Nc-mentioning

confidence: 99%

“…The fast NC-BLAST-RMI algorithms reduce complexity by applying the Sherman-Morrison formula [8] and double recursion [9] to calculate the multiple matrix inversion. The subsequent flops are…”

Section: Complexity Comparisonmentioning

confidence: 99%

“…Unlike the new algorithms in this paper, recursion algorithms in [14] are not interested in calculating the matrix inversion), and imposes on it a complexity burden of O(N 4 T ) or O(N 5 T ). To reduce the complexity of NC-BLAST, algorithms proposed in [8], [9] use the recursive matrix inversion (RMI) technique, which calculates matrix inversion under a recursive updating fashion, and reduces the complexity to O(N 3 T ). The main advantages of the NC-BLAST-RMI are: 1) lower complexity in preprocessing for order and filter optimization, and 2) shorter detection latency due to fast preprocessing.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient Hybrid DFE Algorithms in Spatial Multiplexing Systems

Jiang

Asai

Aikawa

et al. 2009

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

SUMMARYThe wireless systems that establish multiple input multiple output (MIMO) channels through multiple antennas at both ends of the communication link, have been proved to have tremendous potential to linearly lift the capacity of conventional scalar channel. In this paper, we present two efficient decision feedback equalization algorithms that achieve optimal and suboptimal detection order in MIMO spatial multiplexing systems. The new algorithms combine the recursive matrix inversion and ordered QR decomposition approaches, which are developed for nulling cancellation interaface Bell Labs layered space time (BLAST) and back substitution interface BLAST. As a result, new algorithms achieve total reduced complexities in frame based transmission with various payload lengths compared with the earlier methods. In addition, they enable shorter detection delay by carrying out a fast hybrid preprocessing. Moreover, the operation precision insensitivity of order optimization greatly relaxes the word length of matrix inversion, which is the most computational intensive part within the MIMO detection task.

show abstract

Section: Complexity Comparisonmentioning

confidence: 99%

Section: Complexity Comparisonmentioning

confidence: 99%

Section: Nulling and Cancellation (Nc) Interface Blast (Nc-mentioning

confidence: 99%

Section: Complexity Comparisonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient Hybrid DFE Algorithms in Spatial Multiplexing Systems

Jiang

Asai

Aikawa

et al. 2009

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

show abstract

Two efficient and stable MMSE detection algorithms for the V‐BLAST system

Liu

2011

Int J Communication

View full text Add to dashboard Cite

For practical consideration, efficient and stable implementation of the promising vertical Bell Labs Layered Space-Time system is highly desirable. The original square-root algorithm (SRA), proposed by Hassibi, for the minimum mean square error detection, is composed of three stages, that is, initialization, ordering, and nulling. Unlike the original SRA whose initialization stage is not completely based on unitary transformations, the three stages of our proposed algorithm #1 are all based on unitary transformations. The average number of multiplications required by our proposed algorithm #1 is about .29=10/M 3 , where both the numbers of transmit and receive antennas are equal to M . In the meantime, the average number of multiplications required by the original SRA is .17=3/M 3 . In addition to the stable initialization, ordering, and nulling considered by the proposed algorithm #1, our proposed algorithm #2 considers stable detection. Our proposed algorithm #2 is completely based on Givens rotations, which is to be implemented by COordinate Rotation DIgital Computer-based hardwares. TWO EFFICIENT AND STABLE MMSE DETECTION 237 of the algorithms in [2] and [3] do not use unitary transformations. The fast algorithm of [4] does not use unitary transformations at all. These algorithms may suffer from numerical instability when the numbers of transmit and receive antennas are large.On the basis of the steps of the original SRA, we propose in this paper several new results to improve the original algorithm from the perspectives of numerical stability and computational efficiency. Our numerically stable proposed algorithm #1 is based completely on either Householder transformations or Givens rotations. As for the computational efficiency, we use the number of complex multiplications as our efficiency measure. The number of multiplications required by the algorithms of [2] and [3] is fixed, whereas the number of multiplications that our proposed algorithm #1 requires may vary with the channel matrix. Hence, we express the efficiency of our proposed algorithm #1 in terms of the average number of multiplications. With the aid of computer simulations, we show that our proposed algorithm #1 with initial order requires averagely the least number of complex multiplications.Whereas the proposed algorithm #1 uses the same detection as that in the original SRA [5] ‡ , our proposed algorithm #2 considers stable detection that is based on unitary transformations. Our stable detection is motivated by the general decision feedback equalizer [6] and the transformation-based multiuser detection [7]. However, neither of them considers optimal detection order when detecting symbols. We introduce the proposed algorithm #2 completely in terms of Givens rotations, which means that it can be implemented by COordinate Rotation DIgital Computer (CORDIC) algorithms [8] to produce efficient and stable hardwares.The structure of this paper is as follows. The original SRA is introduced in Section 2. Our new computations are given in Section 3. ...

show abstract

On fast preprocessing schemes for the real‐valued spatially multiplexed MIMO detectors

Liu¹,

Chiu²

2012

Int J Communication

View full text Add to dashboard Cite

SUMMARYMultiple‐input and multiple‐output detectors may rely on the complex and real signal models, yielding complex detectors for quadrature amplitude modulated signals and real detectors for pulse amplitude modulated signals, respectively. It is well‐known that the complex and real maximum likelihood detectors are equivalent. But relying on both the conventional real and pairwise real models, we show in this paper that some of the suboptimal real detectors are equivalent to their counterpart complex detectors, whereas some are not. The equivalence between the complex and pairwise real detectors also leads us to develop fast preprocessing algorithms for the real ordered successive interference cancelation and tree search detectors. Finally, we show that the preprocessing computations required by the equivalent suboptimal complex and pairwise real detectors are of the same complexity. When some practical preprocessing criteria are used, the real detectors may not detect the PAM signals in the pairwise manner. Such non‐pairwise real detectors outperform their counterpart complex detectors at the cost of higher preprocessing complexity. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

A fast recursive algorithm for optimum sequential signal detection in a BLAST system

Cited by 106 publications

References 5 publications

Efficient Hybrid DFE Algorithms in Spatial Multiplexing Systems

Efficient Hybrid DFE Algorithms in Spatial Multiplexing Systems

Two efficient and stable MMSE detection algorithms for the V‐BLAST system

On fast preprocessing schemes for the real‐valued spatially multiplexed MIMO detectors

Contact Info

Product

Resources

About