An Improved Square-Root Algorithm for BLAST

Zhu, Hufei; Lei, Zhongding; Chin, F.

doi:10.1109/lsp.2004.833483

Cited by 69 publications

(103 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thus An Improved Square Root Algorithm [11] for BLAST find"s the optimum nulling vectors with the help of ( −1)/2 , avoiding the computation of . At the same time, the robustness of the improved square-root algorithm is maintained without any inverse or squaring operation.…”

Section: An Improved Square Root Algorithm For V-blastmentioning

confidence: 99%

An Analysis of V-blast Detection Schemes for MIMO Wireless Communications

Shankar¹

2012

IOSRJEN

View full text Add to dashboard Cite

Abstract--Vertical Bell Laboratories Layered Space time (V-BLAST) is a Multiple input to-noise ratio (PSNR), number of number of floating point operations (FLOPS) and Time required for detection. Among the Modulation scheme optimum performance is achieved with M-QAM, whereas among the detection schemes nonlinear detection schemes with interference cancellation (IC) with MMSE performed better than ZF schemes in terms of BER, SER PSNR but at the cost of increase in FLOPS. In an attempt to reduce computational complexity the number of FLOPS required for detection with an improved square root algorithm based on efficient inverse cholesky factorization with MMSE for 12 transmitting and 12 receiving antennas is Index Terms-Multiple-input-multiple-output (MIMO) systems, Bell Laboratories Layered Space time (BLAST), vertical BLAST (V-BLAST), Zero forcing (ZF), Bit error rate (BER), Symbol error rate (SER), peak signal-to-noise ratio (PSNR), Floating point operations (FLOPS).

show abstract

Section: An Improved Square Root Algorithm For V-blastmentioning

confidence: 99%

An Analysis of V-blast Detection Schemes for MIMO Wireless Communications

Shankar¹

2012

IOSRJEN

View full text Add to dashboard Cite

show abstract

“…This technique combines the multiple signals to obtain higher data rate rather than combine the same signal like STBC. The V-BLAST algorithm we implemented was based on work from [8], which reduces the computational complexity of V-BLAST. Because our system uses a 4 transmit and 4 receive V-BLAST, the vector width of V-BLAST is 4 elements.…”

Section: Vertical Bell Laboratories Layered Space-timementioning

confidence: 99%

Analyzing the scalability of SIMD for the next generation software defined radio

Woh

Lin

Mudge

et al. 2008

2008 IEEE International Conference on Acoustics, Speech and Signal Processing

View full text Add to dashboard Cite

Previous studies have shown that wireless DSP algorithms exhibit high levels of data level parallelism (DLP). Commercial and research work in the field of software defined radio (SDR) has produced designs utilizing single-instruction multiple-data (SIMD) execution units to exploit this high level of parallelism. These designs have been able to deliver the efficiency and computational power needed to process 3G wireless technologies.Though efficient 3G processing has been achieved, next generation 4G SDR technology requires 10-1000x more computational performance but limits the power budget increase to 2-5x. In this paper, we present a breakdown of 4G and analyze the scalability of SIMD to see if it can help to meet the 4G requirement. We take a proposed SDR architecture, SODA, and modify it for different widths in order to calculate its efficiency. We consider the trade-offs with respect to computation and energy efficiency.

show abstract

“…The original proposal by Foschini [1], known as BLAST (Bell Labs Layered Space-Time), has generated a family of architectures that uses multiple antenna arrays to transmit and receive information, with the goal of increasing the capacity and reliability of the links. We focus our interest on the suboptimal but practical V-BLAST family where nearly optimal decoders such as MMSE (Minimum Mean Square Error Estimation) and its ordered version OSIC (Ordered Successive Interference Cancellation), [2,3], can be used. There are applications that use these methods to decode information in a digital receiver at a higher rate or with less bit error ratio than in SISO (Single Input Single Output) channels [4,5], where the dimension of the problem may be several thousands, i.e.…”

Section: Introductionmentioning

confidence: 99%

“…The interest of the heterogeneous perspective in these applications is focused on future experimentations with GPUs where the CPU (with less computing power) collaborates in the problem solution. The algorithm is based on the ideas of [2] and can be used with the improvement presented in [3].…”

Section: Introductionmentioning

confidence: 99%

Heterogeneous pipelined square-root Kalman Filter algorithm for the MMSE-OSIC problem

2009

View full text Add to dashboard Cite

This paper describes a pipelined parallel algorithm for the MMSE-OSIC decoding procedure proposed in V-BLAST wireless MIMO systems, for heterogeneous networks of processors. It is based on a block version of the square root Kalman Filter algorithm that was initially devised to solve the RLS problem. It has been parallelized in a pipelined way obtaining a good efficiency and scalability. The optimum load balancing for this parallel algorithm is dynamic, but we derive a static load balancing scheme with good performance.

show abstract

An Improved Square-Root Algorithm for BLAST

Cited by 69 publications

References 4 publications

An Analysis of V-blast Detection Schemes for MIMO Wireless Communications

An Analysis of V-blast Detection Schemes for MIMO Wireless Communications

Analyzing the scalability of SIMD for the next generation software defined radio

Heterogeneous pipelined square-root Kalman Filter algorithm for the MMSE-OSIC problem

Contact Info

Product

Resources

About