2007 IEEE Intelligent Transportation Systems Conference 2007
DOI: 10.1109/itsc.2007.4357680
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Near-ML Algorithm with SQRD for Wireless MIMO Communications in Metro Transportation Systems

Abstract: A high-speed multiple input multiple output (MIMO) wireless communication system is proposed for metro transportation. In order to better mitigate the inter-antenna interference (IAI) which degrades the quality of the MIMO receiver, we propose an efficient hybrid multiuser detection (MUD) technique. This approach consists of a two-stage procedure to achieve the optimum multiuser detector (OMD) by an acceptable computational complexity. The first stage performs interference cancellation by using sorted QR decom… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2009
2009
2013
2013

Publication Types

Select...
4
1

Relationship

4
1

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 27 publications
0
14
0
Order By: Relevance
“…complex Gaussian random variable with zero mean and unit variance [22,23] as depicted in (1). The LS technique is considered for the CSI estimation and the input SNR is defined as P/蟽 2 v .…”
Section: Simulation Resultsmentioning
confidence: 99%
“…complex Gaussian random variable with zero mean and unit variance [22,23] as depicted in (1). The LS technique is considered for the CSI estimation and the input SNR is defined as P/蟽 2 v .…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Based on this structure, the tree search technique is adopted to avoid the exhaustive QRDs in (9) and (13) in finding the precoder. The precoders of the M th q codebook converted into a binary search tree exploited by the constellation point, using a separation of real and imaginary, are firstly developed in Table 1.…”
Section: Efficient Precoder Selection Via Tree Search Algorithmmentioning
confidence: 99%
“…Particularly, absolute value and subtraction in (14) to cluster few candidate precoders have less computational complexity than the QRD in (13). Thus, the tree search reduces the complexity of…”
Section: Efficient Precoder Selection Via Tree Search Algorithmmentioning
confidence: 99%
“…More specifically, the full MIMO channel matrix multiplication [6] leads to complicated very-large-scale integration (VLSI) [11], field-programmable gate array (FPGA) implementation [12] and real-time design [1][2][3]. To simplify the computational complexity, the QR-decomposition (QRD) scheme [13][14][15] with restraining complexity has been devised to reduce the MIMO channel matrix multiplication due to involving a lot of zeros in a triangular matrix [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…In order to achieve a simply way, the MIMO channel matrix can be uniquely represented a triangular matrix (R) and a unitary matrix after QRD [13][14][15], provided that the number of receiving antennas (M) is larger than or equal to the number of transmitting antennas (N). Thus, computational complexity can be simplified by the following ways.…”
Section: Introductionmentioning
confidence: 99%