• Title/Summary/Keyword: MIMO decoder

Search Result 59, Processing Time 0.027 seconds

English Performance of MIMO-OFDM Combing Bemaformer with Space-time Decoder in Multiuser Environments (다중 사용자 환경에서 빔 형성기와 결합된 Space-Time decoder을 가진 MIMO-OFDM 시스템의 성능)

  • Kim Chan-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8A
    • /
    • pp.775-783
    • /
    • 2006
  • In this paper, the new technique combining beamforming with space-time coding is proposed for an orthogonal frequency division multiplexing(OFDM) system with multi-input multi-output(MIMO). When MIMO-OFDM system is employing Nt(the number of transmitterantenna) beamfomers and one S-T decoder at Nr receiver antennas, Nt signals removed CCI are outputted at the beamformer and then diversity gain can be got through space-time decoding. As the proposed technique can reduce cochannel interference and get diversity gain in the multi-user environment, the performance of MIMO-OFDM system is very improved. BER performance improvement and convergence behavior of the proposed approach are investigated through computer simulation by applying it to MIMO-OFDM system in the multi-user environment.

An Extendable Fixed-Complexity Sphere Decoder for Downlink Multi-User MIMO Communication System (하향링크 다중 사용자 MIMO 통신 시스템을 위한 확장형 고정복잡도 스피어 복호기)

  • Koo, Jihun;Kim, Yongsuk;Kim, Jaeseok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.4
    • /
    • pp.180-187
    • /
    • 2014
  • In this paper, a extension of a fixed-complexity sphere decoder (FSD) to perform interference signal detection and cancelling is proposed for downlink multiuser multiple input-multiple output (MIMO) communication system. It is based on the application of channel matrix expansion on generalized sphere decoder (GSD), and modification of the channel matrix ordering scheme to a FSD algorithm for interference detection. A Monte Carlo simulation shows that the proposed algorithm improves the receiver performance by 3 dB as compared to maximum likelihood detection without interference cancelling at 10% packet error rate in configuration of 702 Mbit/s datarate for four users respectively on IEEE802.11ac.

Progressive Edge-Growth Algorithm for Low-Density MIMO Codes

  • Jiang, Xueqin;Yang, Yi;Lee, Moon Ho;Zhu, Minda
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.639-644
    • /
    • 2014
  • In low-density parity-check (LDPC) coded multiple-input multiple-output (MIMO) communication systems, probabilistic information are exchanged between an LDPC decoder and a MIMO detector. TheMIMO detector has to calculate probabilistic values for each bit which can be very complex. In [1], the authors presented a class of linear block codes named low-density MIMO codes (LDMC) which can reduce the complexity of MIMO detector. However, this code only supports the outer-iterations between the MIMO detector and decoder, but does not support the inner-iterations inside the LDPC decoder. In this paper, a new approach to construct LDMC codes is introduced. The new LDMC codes can be encoded efficiently at the transmitter side and support both of the inner-iterations and outer-iterations at the receiver side. Furthermore they can achieve the design rates and perform very well over MIMO channels.

A Parallel Collaborative Sphere Decoder for a MIMO Communication System

  • Koo, Jihun;Kim, Soo-Yong;Kim, Jaeseok
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.620-626
    • /
    • 2014
  • In this paper, we propose a parallel collaborative sphere decoder with a scalable architecture promising quasi-maximum likelyhood performance with a relatively small amount of computational resources. This design offers a hardware-friendly algorithm using a modified node operation through fixing the variable complexity of the critical path caused by the sequential nature of the conventional sphere decoder (SD). It also reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by tree pruning using collaboratively operated node operators. A Monte Carlo simulation shows that our proposed design can be implemented using only half the parallel operators compared to the approach using an ideal fully parallel scheme such as FSD, with only about a 7% increase of the normalized decoding time for MIMO dimensions of $16{\times}16$ with 16-QAM modulation.

A Parallel Sphere Decoder Algorithm for High-order MIMO System (고차 MIMO 시스템을 위한 저 복잡도 병렬 구형 검출 알고리즘)

  • Koo, Jihun;Kim, Jaehoon;Kim, Yongsuk;Kim, Jaeseok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.11-19
    • /
    • 2014
  • In this paper, a low complexity parallel sphere decoder algorithm is proposed for high-order MIMO system. It reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by static tree-pruning and dynamic tree-pruning using scalable node operators, and offers near-maximum likelihood decoding performance. Moreover, it also offers hardware-friendly node operation algorithm through fixing the variable computational complexity caused by the sequential nature of the conventional SD algorithm. A Monte Carlo simulation shows our proposed algorithm decreases the average number of expanded nodes by 55% with only 6.3% increase of the normalized decoding time compared to a full parallelized FSD algorithm for high-order MIMO communication system with 16 QAM modulation.

A Low Complexity Multi-level Sphere Decoder for MIMO Systems with QAM signals

  • Pham, Van-Su;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.890-893
    • /
    • 2008
  • In this paper, we present a low complexity modified multi-level sphere decoder (SD) for multiple-input multiple-output (MIMO) systems employing quadrature amplitude modulation (QAM) signals. The proposed decoder, exploiting the multi-level structure of the QAM signal scheme, first decomposes the high-level constellation into low-level 4-QAM constellations, so-called sub-constellations. Then, it deploys SD in the sub-constellations in parallel. In addition, in the searching stage, it uses the optimal low-complexity sort method. Computer simulation results show that the proposed decoder can provide near optimal maximum-likelihood (ML) performance while it significantly reduces the computational load.

  • PDF

Precoding Method for Increasing System Capacity in Multiuser MIMO Downlink Channels (다중사용자 MIMO 하향링크 채널 환경에서 시스템 용량 향상을 위한 프리코딩 기법)

  • Kim, Kwang-Yoon;Lee, Jong-Sik;Koo, Sung-Wan;Yang, Jea-Su;Kim, Jin-Young
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.12-16
    • /
    • 2008
  • In this paper, we study precoding techniques for co-channel interference suppression in multiuser MIMO systems. DPC is optimal techniques to achieve the system capacity of multiuser MIMO downlink channels. DPC is not proper in practical wireless systems because complexity is very high. So block diagonal precoding for multiuser MIMO downlink channel is studied. The block diagonal precoding is used to suppress co-channel interference between multiuser. Block diagonal precoding method, whose complexity is reduced by modified null space operation, change multiuser MIMO channel to multiple single-user MIMO channel. We also use V-BLAST decoder in receiver. V-BLAST decoder can achieve increased system capacity in proportion to the number of users. We show improved system performance by using computer simulation.

  • PDF

A Study on Turbo Equalization for MIMO Systems Based on LDPC Codes (MIMO 시스템에서 LDPC 부호 기반의 터보등화 방식 연구)

  • Baek, Chang-Uk;Jung, Ji-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.5
    • /
    • pp.504-511
    • /
    • 2016
  • In this paper, MIMO system based on turbo equalization techniques which LDPC codes were outer code and space time trellis codes (STTC) were employed as an inner code are studied. LDPC decoder and STTC decoder are connected through the interleaving and de-interleaving that updates each other's information repeatedly. In conventional turbo equalization of MIMO system, BCJR decoder which decodes STTC coded bits required two-bit wise decoding processing. Therefore duo-binary turbo codes are optimal for MIMO system combined with STTC codes. However a LDPC decoder requires bit unit processing, because LDPC codes can't be applied to these system. Therefore this paper proposed turbo equalization for MIMO system based on LDPC codes combined with STTC codes. By the simulation results, we confirmed performance of proposed turbo equalization model was improved about 0.6dB than that of conventional LDPC codes.

Efficient Near-Optimal Detection with Generalized Sphere Decoder for Blind MU-MIMO Systems

  • Kim, Minjoon;Park, Jangyong;Kim, Hyunsub;Kim, Jaeseok
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.682-685
    • /
    • 2014
  • In this letter, we propose an efficient near-optimal detection scheme (that makes use of a generalized sphere decoder (GSD)) for blind multi-user multiple-input multiple-output (MU-MIMO) systems. In practical MU-MIMO systems, a receiver suffers from interference because the precoding matrix, the result of the precoding technique used, is quantized with limited feedback and is thus imperfect. The proposed scheme can achieve near-optimal performance with low complexity by using a GSD to detect several additional interference signals. In addition, the proposed scheme is suitable for use in blind systems.