Low Complexity MIMO System Using Minimum Distance Searching Algorithm (MDSA) with Linear Receiver 


Vol. 32,  No. 4, pp. 462-467, Apr.  2007


PDF Full-Text
  Abstract

This paper proposes Minimum Distance Searching Algorithm (MDSA) which reduces the computational complexity (CC) of the ML, the kind of Spatial Multiplexing (SM) MIMO system. The MDSA searchs candidate symbols with a starting symbol, which is called reference bits. We used the linear receiver of MIMO techniques to find a starting symbol. The MDSA searchs the shortest path to a transmitted symbol using reference bits and Minimum Distance(MD) concept. The CC of MDSA is reduced to the 0.21% to the ML as the transmit antennas is 4 in 16QAM. The simulation result shows the BER of MDSA is nearly same to the BER of ML as the transmit antennas is 2 and the receive antennas is 3 in 16QAM and slightly degraded to the BER of ML as the transmit antennas is 4 and the receive antennas is 6 in QPSK.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

O. Kwon, "Low Complexity MIMO System Using Minimum Distance Searching Algorithm (MDSA) with Linear Receiver," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 4, pp. 462-467, 2007. DOI: .

[ACM Style]

Oh-ju Kwon. 2007. Low Complexity MIMO System Using Minimum Distance Searching Algorithm (MDSA) with Linear Receiver. The Journal of Korean Institute of Communications and Information Sciences, 32, 4, (2007), 462-467. DOI: .

[KICS Style]

Oh-ju Kwon, "Low Complexity MIMO System Using Minimum Distance Searching Algorithm (MDSA) with Linear Receiver," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 4, pp. 462-467, 4. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880