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

Jacob Benesty; Yiteng Huang; Jingdong Chen

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

Jacob Benesty
, Yiteng Huang
, Jingdong Chen

Nokia

科研成果: 期刊稿件 › 会议文章 › 同行评审

2 引用（Scopus）

摘要

BLAST (Bell Laboratories layered space-time) wireless systems are multiple-antenna communication schemes which 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 simple and very efficient algorithm that reduces the complexity by a factor of M.

源语言	英语
页（从-至）	101-104
页数	4
期刊	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
卷	5
出版状态	已出版 - 2003
已对外发布	是
活动	2003 IEEE International Conference on Accoustics, Speech, and Signal Processing - Hong Kong, 香港期限: 6 4月 2003 → 10 4月 2003

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{ba3643ee5fca4a598652b7cda8d7d15b,

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

abstract = "BLAST (Bell Laboratories layered space-time) wireless systems are multiple-antenna communication schemes which 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 simple and very efficient algorithm that reduces the complexity by a factor of M.",

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

year = "2003",

language = "英语",

volume = "5",

pages = "101--104",

journal = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

issn = "1520-6149",

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

note = "2003 IEEE International Conference on Accoustics, Speech, and Signal Processing ; Conference date: 06-04-2003 Through 10-04-2003",

}

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

Y1 - 2003

N2 - BLAST (Bell Laboratories layered space-time) wireless systems are multiple-antenna communication schemes which 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 simple and very efficient algorithm that reduces the complexity by a factor of M.

AB - BLAST (Bell Laboratories layered space-time) wireless systems are multiple-antenna communication schemes which 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 simple and very efficient algorithm that reduces the complexity by a factor of M.

UR - https://www.scopus.com/pages/publications/0141744535

M3 - 会议文章

AN - SCOPUS:0141744535

SN - 1520-6149

VL - 5

SP - 101

EP - 104

JO - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

JF - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

T2 - 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing

Y2 - 6 April 2003 through 10 April 2003

ER -

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

摘要

其它文件与链接

指纹

引用此