A Novel Decoding Scheme for MIMO Signals Using Combined Depth- and Breadth-First Search and Tree Partitioning 


Vol. 36,  No. 1, pp. 37-47, Jan.  2011


PDF Full-Text
  Abstract

In this paper, we propose a novel ML decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, possibly exploiting the advantages of both the depth- and breadth-first search methods in an organized way. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance.

  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]

M. Lee, Y. Lee, I. Song, S. Yoon, "A Novel Decoding Scheme for MIMO Signals Using Combined Depth- and Breadth-First Search and Tree Partitioning," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 1, pp. 37-47, 2011. DOI: .

[ACM Style]

Myungsoo Lee, Youngpo Lee, Iickho Song, and Seokho Yoon. 2011. A Novel Decoding Scheme for MIMO Signals Using Combined Depth- and Breadth-First Search and Tree Partitioning. The Journal of Korean Institute of Communications and Information Sciences, 36, 1, (2011), 37-47. DOI: .

[KICS Style]

Myungsoo Lee, Youngpo Lee, Iickho Song, Seokho Yoon, "A Novel Decoding Scheme for MIMO Signals Using Combined Depth- and Breadth-First Search and Tree Partitioning," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 1, pp. 37-47, 1. 2011.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880