본문 바로가기
  • Home

Improved Cholesky Decomposition using Channel Element Relocation for MIMO Systems

  • Journal of Knowledge Information Technology and Systems
  • Abbr : JKITS
  • 2015, 10(1), pp.103-112
  • Publisher : Korea Knowledge Information Technology Society
  • Research Area : Interdisciplinary Studies > Interdisciplinary Research
  • Published : February 28, 2015

Jinhyeuk Shon 1 SangKyu Park 1 Kwangmin Hyun 2

1한양대학교
2강릉원주대학교

Accredited

ABSTRACT

This paper newly proposed a channel element relocation which can reduces multiplication complexity of ML by applying cholesky decomposition. In wireless communication, maximum likelihood(ML) detection scheme that shows the best bit error rate(BER) performance is usually used; however, a huge amount of multiplication complexity has been pointed out as a default. To lower multiplication complexity of ML detection scheme, various methods have been proposed. Among of them, QRM-MLD algorithm which uses QR decomposition was proposed. The QRM-MLD algorithm maintains the optimal BER performance of ML and reduces the huge amount of multiplication complexity of ML detection. But, QR decomposition shows a huge increase according to augmentation of a number of antennas because of amount of complexity of decomposition process of QR decomposition. For this reason, cholesky decomposition which has low complexity on decomposition process was proposed. Cholesky decomposition does not have high complexity on decomposition process but show reduced complexity than QR decomposition when a number of antennas increase. However, despite reduced complexity, there is a need of additional decrease of ML complexity. To satisfy the need, this paper proposes channel element relocation which applies to Cholesky decomposition and shows additional complexity reduction. Comparision with proposed method and QRM-MLD and conventional Cholesky decomposition shows that proposed method has low complexity.

Citation status

* References for papers published after 2023 are currently being built.