• Title/Summary/Keyword: MIMO decoding

Search Result 124, Processing Time 0.026 seconds

New Core-Layer Soft Decoding Method for ATSC3.0 LDM-MIMO Broadcasting Systems (ATSC3.0 LDM-MIMO 방송 시스템을 위한 새로운 Core-Layer 연판정 기법)

  • Baek, Hyeonguk;Kim, Seunghyeon;Kim, Hojun;Jung, Taejin
    • Journal of Broadcast Engineering
    • /
    • v.24 no.6
    • /
    • pp.1072-1075
    • /
    • 2019
  • In this letter, we propose a new soft decoding method for a Core-Layer(CL) signal in ATSC3.0 Layered-Division-Multiplexing Multiple-Inputs-Multiple-Outputs broadcasting systems. Unlike a conventional Gaussian-Approximation(GA) method, the proposed method decodes the CL signal by reducing a Enhanced-Layer signal simply to a QPSK signal, and thus exhibits greatly improved performance compared to the GA method especially for a lower CL injection-level.

A Computationally Efficient Signal Detection Method for Spatially Multiplexed MIMO Systems (공간다중화 MIMO 시스템을 위한 효율적 계산량의 신호검출 기법)

  • Im, Tae-Ho;Kim, Jae-Kwon;Yi, Joo-Hyun;Yun, Sang-Boh;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.7C
    • /
    • pp.616-626
    • /
    • 2007
  • In spatially multiplexed MIMO systems that enable high data rate transmission over wireless communication channels, the spatial demultiplexing at the receiver is a challenging task, and various demultiplexing methods have been developed recently by many researchers. Among the previous methods, maximum likelihood detection with QR decomposition and M-algorithm (QRM-MM)), and sphere decoding (SD) schemes have been reported to achieve a (near) maximum likelihood (ML) performance. In this paper, we propose a novel signal detection method that achieves a near ML performance in a computationally efficient manner. The proposed method is demonstrated via a set of computer simulations that the proposed method achieves a near ML performance while requiring a complexity that is comparable to that of the conventional MMSE-OSIC. We also show that the log likelihood ratio (LLR) values for all bits are obtained without additional calculation but as byproduct in the proposed detection method, while in the previous QRM-MLD, SD, additional computation is necessary after the hard decision for LLR calculation.

Soft-Decision Algorithm with Low Complexity for MIMO Systems Using High-Order Modulations (고차 변조 방식을 사용하는 MIMO 시스템을 위한 낮은 복잡도를 갖는 연판정 알고리즘)

  • Lee, Jaeyoon;Kim, Kyoungtaek
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.6
    • /
    • pp.981-989
    • /
    • 2015
  • In a log likelihood ratio(LLR) calculation of the detected symbol, multiple-input multiple-output(MIMO) system applying an optimal or suboptimal algorithm such as a maximum likelihood(ML) detection, sphere decoding(SD), and QR decomposition with M-algorithm Maximum Likelihood Detection(QRM-MLD) suffers from exponential complexity growth with number of spatial streams and modulation order. In this paper, we propose a LLR calculation method with very low complexity in the QRM-MLD based symbol detector for a high order modulation based $N_T{\times}N_R$ MIMO system. It is able to approach bit error rate(BER) performance of full maximum likelihood detector to within 1 dB. We also analyze the BER performance through computer simulation to verify the validity of the proposed method.

Linearly Decreasing K-Best List Sphere Decoding Algorithm (선형 감소 K-Best LSD 알고리즘)

  • Hong, Seokchul;Lee, Jungwoo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.373-376
    • /
    • 2012
  • Multiple-Input Multiple-Output (MIMO) 시스템의 복잡도를 감소시키는 방식은 실생활에서 MIMO 시스템을 활용하는 데에 있어 중요한 부분이다. 널리 사용되는 Maximum Likelihood (ML) 복호기의 경우 낮은 에러오율 (BER) 을 보여주지만 복잡도가 높다. 실생활에 활용하기 위하여 ML 복호기의 복잡도를 감소시킬 필요가 있고 이에 Sphere Decoding Algorithm (SDA) 이 제안되었다. 이를 발전시킨 List Sphere Decoding(LSD) 은 여러 종류가 있다. 그 중에 넓이 우선 탐색 방식인 K-Best LSD 알고리즘은 각 레이어에서 리스트의 크기가 복잡도와 밀접한 연관이 있다. 본 논문에서는 기존의 K-Best LSD 알고리즘에 기반하여 초기 반지름 설정 및 선형적으로 리스트 크기를 감소시키는 방식으로 K-Best LSD 알고리즘의 복잡도를 기존 알고리즘에 비해 크게 낮추면서도 비트 오율 성능 열화가 적은 알고리즘을 제안하고 전산 실험을 통해 이를 검증한다.

  • PDF

A Study on Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM systems

  • Pham, Van-Su;Le, Minh-Tuan;Mai, Linh;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.117-121
    • /
    • 2005
  • In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

  • PDF

Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM Systems

  • Pham Van-Su;Le Minh-Tuan;Mai Linh;Yoon Giwan
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.2
    • /
    • pp.72-75
    • /
    • 2005
  • In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.

Estimation of soft decision channel gain for coded MIMO system (부호화된 MIMO 시스템에서 연판정 채널 이득값의 계산)

  • Kim, Young-Min;Shang, Ping Ping;Kim, Soo-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6A
    • /
    • pp.577-586
    • /
    • 2011
  • Modem digital communication systems are required to use forward error correction (FEC) codes to combat inevitable channel impairment. Turbo codes or low density parity check (LDPC) codes, using iterative decoding with soft decision detection (SDD) information, are the most common examples. The excellent performance of these codes should be conditioned on accurate estimation of soft decision detection information. In order to use FEC codes with iterative decoding for Multi-Input Multi-Output (MIMO) system, reliable soft decision channel gain should be provided. In this paper, we investigate efficient SDD methods for turbo-coded MIMO system, and derive the corresponding formulas of SDD for various MIMO detection schemes. We present simulation results of the derived SDD schemes for turbo-coded MIMO systems, and show that the presented results almost approximate to maximum likelihood detection performance with much less computational load.

Reduced Complexity K-BEST Lattice Decoding Algorithm for MIMO Systems (다중 송수신 안테나 시스템 기반에서 복잡도를 감소시킨 K-BEST 복호화 알고리듬)

  • Lee Sung-Ho;Shin Myeong-Cheol;Jung Sung-Hun;Seo Jeong-Tae;Lee Chung-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.95-102
    • /
    • 2006
  • This paper proposes the KB-Fano algorithm which has lower decoding complexity by applying modified Fano-like metric bias to the conventional K-best algorithm. Additionally, an efficient K-best decoding algorithm, named the KR-Fano scheme, is proposed by jointly combining the K-reduction and the KB-Fano schemes. Simulations show that the proposed algerian provides the remarkable improvement from the viewpoints of the BER performance and the decoding complexity as compared to the conventional K-best scheme.

Complexity Reduction of Block-Layered QOSTC with Less Transmission Time (복잡도 감소와 전송시간이 덜 소요되는 블록 층의 준 직교 시공간코드 설계)

  • Abu Hanif, Mohammad;Lee, Moon-Ho;Hai, Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.7
    • /
    • pp.48-55
    • /
    • 2012
  • Because of increasing complexity in maximum-likelihood (ML) decoding of four of higher antenna scenario, Partial Interference Cancellation (PIC) group decoding could be the perfect solution to reduce the decoding complexity occurs in ML decoding. In this paper, we separate the symbols the users in the layered basis and find the equivalent channel matrix. Based on the equivalent channel matrix we provide the grouping scheme. In our paper, we construct a block wise transmission technique which will achieve the desired code rate and reduce the complexity and provide less transmission time. Finally we show the different grouping performance.

A Study of MIMO FTN Scheme based on Layered Space Time Code using Turbo Code (터보부호를 이용한 계층적 시공간 부호기반 MIMO FTN 전송기법 연구)

  • Park, Gun-Woong;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.895-901
    • /
    • 2016
  • The next generation wireless and satellite communications require high transmission efficiency and high reliability to provide various services with subscribers. To satisfied these requirements, incorporated MIMO (Multiple Input Multiple Output) system with FTN (Faster Than Nyquist) techniques based on layered space time coded method are considered in the paper. To improve performance, STTC (Space Time Trellis Code) was employed as an inner code. As the same as SISO (Single Input Single Output) system, the outer codes are turbo codes. In receiver side, BCJR algorithm is used for STTC decoding in order to eliminate interferences induced by FTN transmission. They can yield significantly increased the data rates and improved link reliability without additional bandwidth. Therefore, we proposed a new decoding model for MIMO FTN model and confirmed that performance was improved compared to conventional SISO model according to amount of interference for FTN.