DocumentCode
1575431
Title
Spreading matrices from PN sequences
Author
Chen, Dianjun ; Hashimoto, Takeshi ; Zhou, Zheng ; Zhao, Feng ; Shi, Lei ; Qing, Jin
Author_Institution
Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear
2010
Firstpage
372
Lastpage
377
Abstract
We propose a simple method for the generation of signature matrices for a space-time spreading (STS) system with BPSK modulation, where a signature sequence assigned to a user is paritioned into segements and the segments are assigned to the transmit antennas of the user. We show that, if the signature sequences are linearly independent, the STS system does not has an error floor in its BER performance and, of course, achieve the full receive antenna diversity. For the signature matrices generated from the M-sequences or Gold sequences, the BER performance of the system with likelihood ascent search detectors is superior to the V-BLAST system with the maximum-likelihood (ML) detectors. Moreover, for a large processing gain, the BER performance of the proposed system approaches the least upper bound derived previously.
Keywords
m-sequences; maximum likelihood detection; phase shift keying; receiving antennas; transmitting antennas; BER performance; BPSK modulation; Gold sequences; M-sequences; PN sequences; V-BLAST system; full receive antenna diversity; likelihood ascent search detectors; maximum-likelihood detectors; signature matrices; signature sequences; space-time spreading system; spreading matrices; transmit antennas; upper bound; Bit error rate; Detectors; Gold; Receiving antennas; Transmitting antennas; Upper bound; MIMO channel; PN sequences; likelihood ascent search detector; space time spreading;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Information Technologies (ISCIT), 2010 International Symposium on
Conference_Location
Tokyo
Print_ISBN
978-1-4244-7007-5
Electronic_ISBN
978-1-4244-7009-9
Type
conf
DOI
10.1109/ISCIT.2010.5664868
Filename
5664868
Link To Document