• Title/Summary/Keyword: 연판정 반복 검출

Search Result 13, Processing Time 0.025 seconds

Performance Evaluation of Turbo Codes by Soft Detection Metrics of STBC over an IEEE 802.16e Link (IEEE 802.16e 링크에서 시공간 블록 부호의 연판정 검출에 따른 터보 부호의 성능평가)

  • Kim, Young-Min;Kim, Soo-Young;Lim, Kwang-Jae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.2
    • /
    • pp.1-8
    • /
    • 2010
  • Multi antenna techniques using space-time codes can achieve diversity gains in a multi-path environment without additional bandwidth requirement. Most of the 4G candidate standards including the IEEE 802.16e adopt multi-input multi-output (MIMO) schemes to achieve either high throughput performance or diversity gains. In these 4G candidate standards, turbo codes using an iterative decoder with soft input soft output are used to overcome serious channel fading. For this reason, the estimated signal values from MIMO detectors should be soft decision detection values. In this paper, we propose efficient methods to estimate soft decision detection values for various space time coding schemes, and provide the simulation results of turbo coded space time coding scheme over an IEEE 802.16e link.

Energy efficient joint iterative SIC-MMSE MIMO detection (에너지 효율적 반복 SIC-MMSE MIMO 검출)

  • Ngayahala, F.C. Kamaha;Ahmed, Saleem;Kim, Sooyoung
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.1
    • /
    • pp.22-28
    • /
    • 2015
  • In this paper, we propose a new computationally efficient joint iterative multi-input multi-output (MIMO) detection scheme using a soft interference cancellation and minimum mean squared-error (SIC-MMSE) method. The critical computational burden of the SIC-MMSE scheme lies in the multiple inverse operations of the complex matrices. We find a new way which requires only a single matrix inversion by utilizing the Taylor series expansion of the matrix, and thus the computational complexity can be reduced. The computational complexity reduction increases as the number of antennas is increased. The simulation results show that our method produces almost the same performances as the conventional SIC-MMSE with reduced computational complexity.

Radius Optimization for Efficient List Sphere Decoding (효율적인 리스트 구복호기 검출방식을 위한 구반경의 최적화에 관한 연구)

  • Lee, Jae-Seok;Lee, Byung-Ju;Shim, Byong-Hyo
    • Journal of Broadcast Engineering
    • /
    • v.15 no.6
    • /
    • pp.742-748
    • /
    • 2010
  • Instead of using sphere decoding, list sphere decoding (LSD) has been introduced to increase the reliability of log-likelihood ratio (LLR) in recent soft decoding schemes employing iterative detection and decoding (IDD). Although LSD provides improved performance, it does not obtain complexity gain due to signal-to-noise ratio (SNR) increment as it detects large number of lattice points. Especially, its inefficient scenario arises when it has to search for lattice points which have small affect for obtaining LLR with high reliability. In this paper, we study an efficient algorithm to remove such lattice points, which results in complexity reduction based on radius optimization.