• Title/Summary/Keyword: Maximum likelihood detection

Search Result 250, Processing Time 0.028 seconds

ML Symbol Detection for MIMO Systems in the Presence of Channel Estimation Errors

  • Yoo, Namsik;Back, Jong-Hyen;Choi, Hyeon-Yeong;Lee, Kyungchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5305-5321
    • /
    • 2016
  • In wireless communication, the multiple-input multiple-output (MIMO) system is a well-known approach to improve the reliability as well as the data rate. In MIMO systems, channel state information (CSI) is typically required at the receiver to detect transmitted signals; however, in practical systems, the CSI is imperfect and contains errors, which affect the overall system performance. In this paper, we propose a novel maximum likelihood (ML) scheme for MIMO systems that is robust to the CSI errors. We apply an optimization method to estimate an instantaneous covariance matrix of the CSI errors in order to improve the detection performance. Furthermore, we propose the employment of the list sphere decoding (LSD) scheme to reduce the computational complexity, which is capable of efficiently finding a reduced set of the candidate symbol vectors for the computation of the covariance matrix of the CSI errors. An iterative detection scheme is also proposed to further improve the detection performance.

Low-Power Channel-Adaptive Reconfigurable 4×4 QRM-MLD MIMO Detector

  • Kurniawan, Iput Heri;Yoon, Ji-Hwan;Kim, Jong-Kook;Park, Jongsun
    • ETRI Journal
    • /
    • v.38 no.1
    • /
    • pp.100-111
    • /
    • 2016
  • This paper presents a low-complexity channel-adaptive reconfigurable $4{\times}4$ QR-decomposition and M-algorithm-based maximum likelihood detection (QRM-MLD) multiple-input and multiple-output (MIMO) detector. Two novel design approaches for low-power QRM-MLD hardware are proposed in this work. First, an approximate survivor metric (ASM) generation technique is presented to achieve considerable computational complexity reduction with minor BER degradation. A reconfigurable QRM-MLD MIMO detector (where the M-value represents the number of survival branches in a stage) for dynamically adapting to time-varying channels is also proposed in this work. The proposed reconfigurable QRM-MLD MIMO detector is implemented using a Samsung 65 nm CMOS process. The experimental results show that our ASM-based QRM-MLD MIMO detector shows a maximum throughput of 288 Mbps with a normalized power efficiency of 10.18 Mbps/mW in the case of $4{\times}4$ MIMO with 64-QAM. Under time-varying channel conditions, the proposed reconfigurable MIMO detector also achieves average power savings of up to 35% while maintaining a required BER performance.

Low-Complexity Soft-MIMO Detection Algorithm Based on Ordered Parallel Tree-Search Using Efficient Node Insertion (효율적인 노드 삽입을 이용한 순서화된 병렬 트리-탐색 기반 저복잡도 연판정 다중 안테나 검출 알고리즘)

  • Kim, Kilhwan;Park, Jangyong;Kim, Jaeseok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.841-849
    • /
    • 2012
  • This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.

Design and Implementation of a Low-Complexity and High-Throughput MIMO Symbol Detector Supporting up to 256 QAM (256 QAM까지 지원 가능한 저 복잡도 고 성능의 MIMO 심볼 검파기의 설계 및 구현)

  • Lee, Gwang-Ho;Kim, Tae-Hwan
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.34-42
    • /
    • 2014
  • This paper presents a low-complexity and high-throughput symbol detector for two-spatial-stream multiple-input multiple-output systems based on the modified maximum-likelihood symbol detection algorithm. In the proposed symbol detector, the cost function is calculated incrementally employing a multi-cycle architecture so as to eliminate the complex multiplications for each symbol, and the slicing operations are performed hierarchically according to the range of constellation points by a pipelined architecture. The proposed architecture exhibits low hardware complexity while supporting complicated modulations such as 256 QAM. In addition, various modulations and antenna configurations are supported flexibly by reconfiguring the pipeline for the slicing operation. The proposed symbol detector is implemented with 38.7K logic gates in a $0.11-{\mu}m$ CMOS process and its throughput is 166 Mbps for $2{\times}$3 16-QAM and 80Mbps for $2{\times}3$ 64-QAM where the operating frequency is 478 MHz.

Derivation of Optimal Design Flood by Gamma and Generalized Gamma Distribution Models(I) - On the Gamma Distribution Models - (Gamma 및 Generalized Gamma 분포 모형에 의한 적정 설계홍수량의 유도 (I) -Gamma 분포 모형을 중심으로-)

  • 이순혁;박명근;정연수;맹승진;류경식
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.39 no.3
    • /
    • pp.83-95
    • /
    • 1997
  • This study was conducted to derive optimal design floods by Gamma distribution models of the annual maximum series at eight watersheds along Geum , Yeong San and Seom Jin river Systems, Design floods obtained by different methods for evaluation of parameters and for plotting positions in the Gamma distribution models were compared by the relative mean errors and graphical fit along with 95% confidence interval plotted on Gamma probability paper. The results were analyzed and summarized as follows. 1.Adequacy for the analysis of flood flow data used in this study was confirmed by the tests of Independence, Homogeneity and detection of Outliers. 2.Basic statistics and parameters were calculated by Gamma distribution models using Methods of Moments and Maximum Likelihood. 3.It was found that design floods derived by the method of maximum likelihood and Hazen plotting position formular of two parameter Gamma distribution are much closer to those of the observed data in comparison with those obtained by other methods for parameters and for plotting positions from the viewpoint of relative mean errors. 4.Reliability of derived design floods by both maximum likelihood and method of moments with two parameter Gamma distribution was acknowledged within 95% confidence interval.

  • PDF

The Performance of Chip Level Detection for DS/CDMA Operating in LEO Satellite Channel (저궤도 위성통신을 위한 칩레벨 DS/CDMA 시스템의 성능 평가에 관한 연구)

  • Jae-Hyung Kim;Seung-Wook Hwang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.2 no.4
    • /
    • pp.553-558
    • /
    • 1998
  • We present in this paper the ture union bound of the performance of chip level detection for coded DS/CDMA system operating in Rician fading channels such as LEO satellite mobile radio where the maximum doppler frequency is very high. The main objective of this paper is to calculate the exact doe union bound of BER performance of different performance of different quadrature detectors and to find a optimum spreading factor as a function of fade rate. The rationale of using multiple chip detection is to reduce the effective fade rate or variation. We considered chip level differential detection, chip level maximum likelihood sequence estimation, noncoherent detection and coherent detection with perfect channel state information as a reference.

  • PDF

Performance Analysis of Maximum-Likelihood Code Acquisition Technique for Preamble Search in CDMA Reverse Link (CDMA 역방향 링크에서의 프리앰블 탐색을 위한 최대우도 동기획득 방식의 성능 분석)

  • 박형래;강법주
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.1
    • /
    • pp.161-174
    • /
    • 1996
  • Addressed in this paper is performance analysis of the maximum-likelihood code acquisition technique for slotted-mode preamble search in the CDMA reverse link. The probabilities of detection, miss, and false alarm are derived analytically for a multiple $H_{1}$ cell case in a frequency-selective Rayleigh fading channel, based on the statics of the CDMA noncoherent demodulator output. the probability density function of the decision variable consisting of successive demodulator outputs is also derived by considering the fading characteristics of the received signal for both single and dual antenna cases. The performance of the code acquisition technique is evaluated numerically with an emphasis on investigating the effects of post-detection integration, fading rate, and antenna diversity on the detection performance.

  • PDF

A Hybrid Detection Technique for Multiple Input Multiple Output Systems in Fading Environment (감쇄 환경에서 여러 입력 여러 출력 시스템에 알맞은 혼합 검파 방식)

  • Oh Jong-Ho;An Tae-Hun;Song Iick-Ho;Park Ju-Ho;Park So-Ryoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9C
    • /
    • pp.897-904
    • /
    • 2006
  • Multiple input multiple output architectures, known to provide high spectral efficiencies, can provide the best performance in terms of the block error rate when a maximum likelihood (ML) detector is employed. The complexity of the ML detector, however, increases exponentially with the numbers of transmit antennas and signals in the constellation. The zero forcing (ZF) detector has been suggested as a reduced-complexity detection method at the cost of performance degradation. In order to improve the performance of the ZF detector while reducing the complexity of the ML detector, we propose a novel multistage decision method. Numerical results show that, despite the proposed detector has a lower complexity than the ML detector, the performance difference between the ML and proposed detectors is negligibly small at high SNR.

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.

Low-Complexity Detection Techniques for High-Density DVD Systems (고밀도 DVD시스템을 위한 저 복잡도 검출 기법)

  • Cho, Han-Gyu;Woo, Choong-Chae;Joo, Man-Sic;Kang, Chang-Eon;Hong, Dae-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.10A
    • /
    • pp.1000-1010
    • /
    • 2002
  • Partial response maximum-likelihood (PRML) and fixed-delay tree search with decision feedback (FDTS/DF) yield a sub-optimum performance in storage systems. However, they suffer from the inevitable complexity problems. this paper focuses on detection schemes to overcome the drawbacks of the sequence detections by exploiting minimum run-length d=2. It is expected that the proposed systems yield substantial reductions of both processing speed and receiver complexity. When combined with a decision feedback equalization (DFE), they prove to keep pace with the FDTS/DF with ${\tau}$=2 and even outperform the PR(1111)ML at normalized density S>5.6.