Performance and complexity analysis of wireless communication systems for approaching channel capacity = 채널 용량에 접근하기 위한 무선 통신 시스템의 성능 및 복잡도 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 196
  • Download : 0
In this dissertation, the performance and complexity of capacity-approaching wireless communication systems are analyzed in many aspects. First, the channel capacity, the maximum allowable throughput over a particular channel, is analyzed. Assuming random selection of codewords, the cut-off rate of MIMO systems is derived as a measure of channel capacity. It is found that the cut-off rate is proportional to the number of transmit antennas at high SNR, while it is proportional to the minimum number of antennas at low SNR. Secondly, the maximum likelihood detection, which is essential to capacity-approaching systems, is analyzed for a variety of situations, specifically, depending on the availability of channel, phase offset and frequency offset at the receiver. Particularly, low-complexity decision-aided detection is proposed for improving the performance of frequency-offset insensitive detection. The performance-complexity analysis shows that the proposed decision-aided detection provides 2 dB gain in performance. Moreover, probabilistic sphere decoding is proposed for improving the performance of conventional sphere decoding with early termination. Specifically, by applying a probabilistic search algorithm to the depth-first sphere decoding, the more promising candidates can be evaluated earlier, resulting in either better performance or lower complexity. The performance-complexity analysis shows that the proposed probabilistic sphere decoding provides up to 9 dB gain in performance or 50% reduction in complexity. Furthermore, since the proposed probabilistic sphere decoding can be implemented by simply adding a few special blocks to conventional sphere decoding, it is broadly applicable to many modifications of sphere decoding. Thirdly, the performance of LDPC-coded MIMO-OFDM systems is evaluated. The union upper-bounds on the error probability are derived analytically, giving useful insights into the system design, for example, the choice of space-t...
Advisors
Lee, Kwy-Roresearcher이귀로researcher
Description
한국과학기술원 : 전기및전자공학전공,
Publisher
한국과학기술원
Issue Date
2006
Identifier
254405/325007  / 020025119
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2006.2, [ vii, 172 p. ]

Keywords

Performance and complexity trade-offs; Channel capacity; LDPC-coded MIMO-OFDM; High-throughput; 고속 전송량; LDPC MIMO-OFDM; 성능과 복잡도 타협; 채널용량; Performance and complexity trade-offs; Channel capacity; LDPC-coded MIMO-OFDM; High-throughput; 고속 전송량; LDPC MIMO-OFDM; 성능과 복잡도 타협; 채널용량

URI
http://hdl.handle.net/10203/35352
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=254405&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
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