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

Jacob Benesty; Yiteng Huang; Jingdong Chen

doi:10.1109/TSP.2003.812897

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

Jacob Benesty, Yiteng Huang, Jingdong Chen

Nokia

Research output: Contribution to journal › Article › peer-review

222 Scopus citations

Abstract

Bell Laboratories layered space-time (BLAST) wireless systems are multiple-antenna communication schemes that can achieve very high spectral efficiencies in scattering environments with no increase in bandwidth or transmitted power. The most popular and, by far, the most practical architecture is the so-called vertical BLAST (V-BLAST). The signal detection algorithm of a V-BLAST system is computationally very intensive. If the number of transmitters is M and is equal to the number of receivers, this complexity is proportional to M⁴ at each sample time. In this paper, we propose a very simple and efficient algorithm that reduces the complexity by a factor of M.

Original language	English
Pages (from-to)	1722-1730
Number of pages	9
Journal	IEEE Transactions on Signal Processing
Volume	51
Issue number	7
DOIs	https://doi.org/10.1109/TSP.2003.812897
State	Published - Jul 2003
Externally published	Yes

Keywords

Antenna array processing
Bell Laboratories layered space-time (BLAST) architecture
Multiple-input-multiple-output (MIMO) systems

Access to Document

10.1109/TSP.2003.812897

Cite this

@article{fab50ad5da1d495b8a2b977dbe542146,

title = "A fast recursive algorithm for optimum sequential signal detection in a BLAST system",

abstract = "Bell Laboratories layered space-time (BLAST) wireless systems are multiple-antenna communication schemes that can achieve very high spectral efficiencies in scattering environments with no increase in bandwidth or transmitted power. The most popular and, by far, the most practical architecture is the so-called vertical BLAST (V-BLAST). The signal detection algorithm of a V-BLAST system is computationally very intensive. If the number of transmitters is M and is equal to the number of receivers, this complexity is proportional to M4 at each sample time. In this paper, we propose a very simple and efficient algorithm that reduces the complexity by a factor of M.",

keywords = "Antenna array processing, Bell Laboratories layered space-time (BLAST) architecture, Multiple-input-multiple-output (MIMO) systems",

author = "Jacob Benesty and Yiteng Huang and Jingdong Chen",

year = "2003",

month = jul,

doi = "10.1109/TSP.2003.812897",

language = "英语",

volume = "51",

pages = "1722--1730",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

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

AU - Benesty, Jacob

AU - Huang, Yiteng

AU - Chen, Jingdong

PY - 2003/7

Y1 - 2003/7

N2 - Bell Laboratories layered space-time (BLAST) wireless systems are multiple-antenna communication schemes that can achieve very high spectral efficiencies in scattering environments with no increase in bandwidth or transmitted power. The most popular and, by far, the most practical architecture is the so-called vertical BLAST (V-BLAST). The signal detection algorithm of a V-BLAST system is computationally very intensive. If the number of transmitters is M and is equal to the number of receivers, this complexity is proportional to M4 at each sample time. In this paper, we propose a very simple and efficient algorithm that reduces the complexity by a factor of M.

AB - Bell Laboratories layered space-time (BLAST) wireless systems are multiple-antenna communication schemes that can achieve very high spectral efficiencies in scattering environments with no increase in bandwidth or transmitted power. The most popular and, by far, the most practical architecture is the so-called vertical BLAST (V-BLAST). The signal detection algorithm of a V-BLAST system is computationally very intensive. If the number of transmitters is M and is equal to the number of receivers, this complexity is proportional to M4 at each sample time. In this paper, we propose a very simple and efficient algorithm that reduces the complexity by a factor of M.

KW - Antenna array processing

KW - Bell Laboratories layered space-time (BLAST) architecture

KW - Multiple-input-multiple-output (MIMO) systems

UR - http://www.scopus.com/inward/record.url?scp=0038199781&partnerID=8YFLogxK

U2 - 10.1109/TSP.2003.812897

DO - 10.1109/TSP.2003.812897

M3 - 文章

AN - SCOPUS:0038199781

SN - 1053-587X

VL - 51

SP - 1722

EP - 1730

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 7

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this