Efficient detection algorithms for MMSE-SIC in MIMO systemsSIC와 GDFE에 대한 새로운 고찰을 통한 저복잡도 검출알고리즘

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 470
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorHa, Jeong-Seok-
dc.contributor.advisor하정석-
dc.contributor.authorNam, Jun-Young-
dc.contributor.author남준영-
dc.date.accessioned2011-12-28T03:03:48Z-
dc.date.available2011-12-28T03:03:48Z-
dc.date.issued2008-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=393055&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/55044-
dc.description학위논문(석사) - 한국정보통신대학교 : 공학부, 2008.8, [ vii, 40 p. ]-
dc.description.abstractIn this thesis, computationally efficient detection algorithms for the minimum mean square error (MMSE) estimation with successive interference cancellation (SIC), or with generalized decision feedback equalizer(GDFE) are considered in spatial multiplexing multiple-input multipleoutput (MIMO) systems. The MMSE-SIC and the MMSE-GDFE architectures are known to achieve the ergodic capacity of MIMO fading channels. This thesis presents a new understanding of SIC and GDFE to provide further insights. This perspective shows that 1) SIC and GDFE are a special case of the two-dimensional estimation with side information (or decision feedback), and 2) SIC can be expressed in terms of the Cholesky decomposition, as GDFE is. Inspired by the latter, we propose fast algorithms based on the Cholesky decomposition for SIC and GDFE in multiple antenna systems. Although existing detection algorithms can provide an impressive reduction of computational complexity for a large $\It{M}$, the reduction is relatively small for a moderate $\It{M}$ of practical interest (i.e. $\It{M}$ $\le$ 16). The Cholesky decomposition is computationally more efficient than the QR decomposition. Specifically, the required number of multiplications for the Cholesky decomposition is O($M^3$/6) for an $\It{M}$$\times$$\It{M}$ matrix, whereas that of the QR decomposition amounts to O($4M^3$/3). Efficient and stable Cholesky decomposition based detection algorithms further reduce the computational complexity of existing fast algorithms for SIC in MIMO at fading channels. To this end, we derive special properties of the Cholesky decomposition to render the proposed algorithms more efficient computationally. A complexity comparison shows that the proposed algorithms can reduce the computational complexity of SIC and GDFE more significantly than existing fast algorithms. Finally, proposed detection algorithms for the MMSE-SIC and the MMSE-GDFE receiver can be readily extended to linear space-time co...eng
dc.languageeng-
dc.publisher한국정보통신대학교-
dc.subjectMIMO-
dc.subjectSIC-
dc.subject검출알고리즘-
dc.subject다중안테나 시스템-
dc.subjectGDFE-
dc.titleEfficient detection algorithms for MMSE-SIC in MIMO systems-
dc.title.alternativeSIC와 GDFE에 대한 새로운 고찰을 통한 저복잡도 검출알고리즘-
dc.typeThesis(Master)-
dc.identifier.CNRN393055/225023-
dc.description.department한국정보통신대학교 : 공학부, -
dc.identifier.uid020074248-
dc.contributor.localauthorHa, Jeong-Seok-
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