발간년도 : [2015]
| 논문정보 |
|
| 논문명(한글) |
[Vol.10, No.1] Improved Cholesky Decomposition using Channel Element Relocation for MIMO Systems |
|
| 논문투고자 |
Jinhyeuk Shon, Sang Kyu Park, Kwangmin Hyun |
|
| 논문내용 |
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. |
|
| 첨부논문 |
|
|
|
|
|
자료실 > 논문지 
