A study on computationally efficient tree searching algorithm design for MIMO systems

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 1195
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKang, Joon-Hyuk-
dc.contributor.advisor강준혁-
dc.contributor.authorPark, Kyung-Ho-
dc.contributor.author박경호-
dc.date.accessioned2011-12-28T03:04:09Z-
dc.date.available2011-12-28T03:04:09Z-
dc.date.issued2009-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=393084&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/55063-
dc.description학위논문(석사) - 한국정보통신대학교 : 공학부, 2009.2, [ v, 51 p. ]-
dc.description.abstractMultiple-input multiple-output (MIMO) systems have been shown to achieve significant increases in efficiency using arrays of transmit and receive antennas with spatial processing. Among various MIMO systems, we focus on low complexity tree searching algorithm in a vertical Bell Labs layered space-time (V-BLAST) architecture for single-user MIMO and vector precoding for multi-user MIMO systems. In both systems, signal processing technique is key role for alleviating interference among users or antennas, respectively. Many efficient algorithms such as sphere decoding, QRD-M, and QRD-Stack are proposed for reducing complexity than that of maximum-likelihood (ML) decoding. In this thesis, we propose a reduced candidate set election algorithm by channel condition which is represented by condition number and the smallest singular value for tree searching algorithms. The proposed algorithm offers substantial computational savings over conventional ones, while maintaining performance arbitrarily close to ML. Firstly, We elaborate the impact of the condition number and the smallest singular value in the case for performance of tree searching algorithms. From this result, we recognize that the channel condition is closely related to the complexity and performance. Also, the determination of the number of candidates is crucial to achieve a balance between bit error rate (BER) performance and computational complexity. Motivated by these results, we propose small candidate set for well-conditioned channels and large candidate set for ill-conditioned channels. In V-BLAST systems, moreover, approximation of the condition number is suggested to reduce additional complexity required for finding the condition number. In vector precoding systems, we suggest sphere constraint to restrict the candidate set to reduce complexity in stack-based iterative precoding(SBIP) and QRD-M based iterative precoding (QRMIP) algorithms. Simulation results demonstrate the proposed approaches prov...eng
dc.languageeng-
dc.publisher한국정보통신대학교-
dc.subject컨디션 넘버-
dc.subject다중 안테나-
dc.subjectCondition number-
dc.subjectQRD-M-
dc.subjectMIMO-
dc.subjectQRD-Stack-
dc.titleA study on computationally efficient tree searching algorithm design for MIMO systems-
dc.typeThesis(Master)-
dc.identifier.CNRN393084/225023-
dc.description.department한국정보통신대학교 : 공학부, -
dc.identifier.uid020074250-
dc.contributor.localauthorKang, Joon-Hyuk-
dc.contributor.localauthor강준혁-
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0