• Title/Summary/Keyword: MIMO decoding

Search Result 124, Processing Time 0.016 seconds

Iterative Decoding for LDPC Coded MIMO-OFDM Systems with SFBC Encoding (주파수공간블록부호화를 적용한 MIMO-OFDM 시스템을 위한 반복복호 기법)

  • Sohn Insoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.402-406
    • /
    • 2005
  • A multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) system using low-density parity-check (LDPC) code and iterative decoding is presented. The iterative decoding is performed by combining the zero-forcing technique and LDPC decoding through the use of the 'turbo principle.' The proposed system is shown to be effective with high order modulation and outperforms the space frequency block code (SFBC) method with iterative decoding.

Improved SE SD Algorithm based on MMSE for MIMO Detection (MIMO 검파를 위한 MMSE 기반의 향상된 SE SD 알고리듬)

  • Cho, Hye-Min;Park, Soon-Chul;Han, Dong-Seog
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3A
    • /
    • pp.231-237
    • /
    • 2010
  • Multi-input multi-output (MIMO) systems are used to improve the transmission rate in proportion to the number of antennas. However, their computational complexity is very high for the detection in the receiver. The sphere decoding (SD) is a detection algorithm with reduced complexity. In this paper, an improved Schnorr-Euchner SD (SE SD) is proposed based on the minimum mean square error (MMSE) and the Euclidean distance criteria without additional complexity.

A hybrid ZF-SD method for MIMO Systems (다중 안테나 시스템에서 Zero-Forcing(ZF)과 Sphere Decoding(SD)을 결합한 향상된 성능의 복호 방법)

  • Lee, Hong-Ju;Bae, Jeong-Min;Kim, Dong-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10A
    • /
    • pp.976-981
    • /
    • 2006
  • In this paper, we describe a hybrid ZF-SD method. The method is based on dimensionality reduction via predecoding and cancellation of those symbols that can be quickly and reliably detected by a linear decoder. The proposed method shows BER performance similar to SD but with much lower computational complexity than SD.

Approaching Near-Capacity on a Multi-Antenna Channel using Successive Decoding and Interference Cancellation Receivers

  • Sellathurai, Mathini;Guinand, Paul;Lodge, John
    • Journal of Communications and Networks
    • /
    • v.5 no.2
    • /
    • pp.116-123
    • /
    • 2003
  • In this paper, we address the problem of designing multirate codes for a multiple-input and multiple-output (MIMO) system by restricting the receiver to be a successive decoding and interference cancellation type, when each of the antennas is encoded independently. Furthermore, it is assumed that the receiver knows the instantaneous fading channel states but the transmitter does not have access to them. It is well known that, in theory, minimummean- square error (MMSE) based successive decoding of multiple access (in multi-user communications) and MIMO channels achieves the total channel capacity. However, for this scheme to perform optimally, the optimal rates of each antenna (per-antenna rates) must be known at the transmitter. We show that the optimal per-antenna rates at the transmitter can be estimated using only the statistical characteristics of the MIMO channel in time-varying Rayleigh MIMO channel environments. Based on the results, multirate codes are designed using punctured turbo codes for a horizontal codedMIMOsystem. Simulation results show performances within about one to two dBs of MIMO channel capacity.

Study on the applicability of MIMO Joint Decoding to Dual-Contact Satellite Systems (이중 교신 위성 시스템의 MIMO 공동 복조의 적용성에 대한 연구)

  • Park, Hong Won;Kim, Whan Woo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.46 no.10
    • /
    • pp.856-867
    • /
    • 2018
  • This paper presents the applicability of MIMO joint decoding to dual-contact satellite systems in which two LEO satellites using X-band frequency band are transmitting each image data to two ground station antennas, simultaneously. When two satellites are closely positioned within the looking angle of the two antennas, each satellite interferes with each other by the relative antenna gain corresponding to an offset angle and this might cause the performance degradation without interference mitigation. To mitigate the performance degradation, SM MIMO techniques for joint decoding are applied. Especially, the relative antenna gain of ground station depending on the angle difference between two satellites in ground station antenna plays an important role in modelling the dual-contact satellite systems. The condition number of MIMO channel including the antenna gain calculated from the mathematical gain pattern model was primarily analyzed. Simulation results showed that the SM MIMO techniques using detection schemes such as ZF-SIC, MMSE-SIC, and ML can be applicable to dual-contact satellite systems.

Low Complexity LSD Scheme for Joint Iterative MIMO Detection (반복 MIMO 검출을 위한 저 복잡도 LSD 기법)

  • Ahmed, Saleem;Kim, Sooyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.11
    • /
    • pp.1051-1059
    • /
    • 2013
  • This paper proposes a complexity reduced list sphere decoding (LSD) scheme for joint iterative soft detection scheme for coded MIMO system. The conventional LSD scheme is based on searching the candidates with a fixed radius. However, once the candidate list is full, it is highly probable that the radius can be reduced. By reducing the radius, the complexity can be also reduced. We propose a simple and efficient radius update method for complexity reduction of list version sphere decoding and its application to iterative soft MIMO detection. We evaluate the performance of the proposed scheme with a joint soft-input-soft-ouput iterative MIMO detection in combination with turbo codes. Simulation results show that the proposed methods provide substantial complexity reduction while achieving similar bit error rate (BER) performance as the conventional LSD scheme.

MMSE Based Continuous Turbo Equalizer for MIMO-HARQ Systems (MIMO-HARQ 시스템을 위한 MMSE 기반 연속 터보 등화기)

  • Park, Sangjoon;Choi, Sooyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.10
    • /
    • pp.619-621
    • /
    • 2014
  • In this letter, an MMSE based continuous turbo equalizer is proposed for MIMO-HARQ systems. In the proposed scheme, the soft information from the reception process for the previous transmission is reutilized at the initialization of the reception process for the next transmission to enhance the decoding convergence speed. Simulation results verify that the proposed scheme achieves an improved BLER with a significantly accelerated decoding convergence speed.

Space-Time Block Coding Techniques for MIMO 2×2 System using Walsh-Hadamard Codes

  • Djemamar, Younes;Ibnyaich, Saida;Zeroual, Abdelouhab
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.1
    • /
    • pp.1-7
    • /
    • 2022
  • Herein, a new space-time block coding technique is proposed for a MIMO 2 × 2 multiple-input multiple output (MIMO) system to minimize the bit error rate (BER) in Rayleigh fading channels with reduced decoding complexity using ZF and MMSE linear detection techniques. The main objective is to improve the service quality of wireless communication systems and optimize the number of antennas used in base stations and terminals. The idea is to exploit the correlation product technique between both information symbols to transmit per space-time block code and their own orthogonal Walsh-Hadamard sequences to ensure orthogonality between both symbol vectors and create a full-rate orthogonal STBC code. Using 16 quadrature amplitude modulation and the quasi-static Rayleigh channel model in the MATLAB environment, the simulation results show that the proposed space-time block code performs better than the Alamouti code in terms of BER performance in the 2 × 2 MIMO system for both cases of linear decoding ZF and MMSE.

A Differential SFBC-OFDM for a DMB System with Multiple Antennas

  • Woo, Kyung-Soo;Lee, Kyu-In;Paik, Jong-Ho;Park, Kyung-Won;Yang, Won-Young;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2A
    • /
    • pp.195-202
    • /
    • 2007
  • A differential space-frequency block code - orthogonal frequency division multiplexing (SFBC-OFDM) scheme as a multiple-input multiple-output (MIMO) transmission technique for next-generation digital multimedia broadcasting (DMB) is proposed in this paper. A linear decoding method for differential SFBC, which performs comparably to the ML decoding method, is derived for the cases of two or four transmit antennas. A simple table lookup method is proposed to improve the efficiency of the encoding/decoding process of DSFBC for the case of non-constant modulus constellations. A DMB MIMO channel model, developed by extending the 3GPP MIMO model to fit DMB environments, is used to compare BER performances of differential space block code schemes for various channel environments. Simulation results show that the differential SFBC-16QAM scheme using either four transmit antennas with one receive antenna or two transmit antennas with two receive antennas achieves a performance gain of 12dB than that of the conventional DQPSK scheme, even with a data rate twice faster.

Sphere Decoding Algorithm Using Two-Level Search (2-레벨 탐색을 이용한 스피어 디코딩 알고리즘)

  • Huynh, Tronganh;Cho, Jong-Min;Kim, Jin-Sang;Cho, Won-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12A
    • /
    • pp.1133-1137
    • /
    • 2008
  • Sphere decoding is considered as one of the most promising methods for multiple-input multiple-output (MIMO) detection. This paper proposes a novel 2-level-search sphere decoding algorithm. In the proposed algorithm, symbol detection is concurrently performed on two levels of the tree search, which helps avoid discarding good candidates at early stages. Simulation results demonstrate the good performance of the proposed algorithm in terms of bit-error-rate (BER).