• Title/Summary/Keyword: ML decoder

Search Result 36, Processing Time 0.025 seconds

Adaptive Step-size Algorithm for the AIC in the Space-time Coded DS-CDMA System (시공간부호화된 DS-CDMA 시스템에서 적응스텝크기 알고리듬을 적용한 간섭제거수신기)

  • Yi, Joo-Hyun;Lee, Jae-Hong
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.265-268
    • /
    • 2004
  • In this paper. we propose an adaptive step-size algorithm for the adaptive interference canceller (AIC) in the space-time trellis coded DS-CDMA system. In the AIC, the performance of the blind LMS algorithms that updates the tap-weight vector of the AIC is heavily dependent on the choice of step-size. To improve the performance of the fixed step-size AIC (FS-AIC), the regular adaptive step-size algorithm is extended in complex domain and applied to the joint AIC and ML decoder scheme. Simulation results show that the joint adaptive step-size AIC (AS-AIC) and ML decoder scheme using the proposed algorithm has boner performance than not only the conventional ML decoder but also the joint FS-AIC and ML decoder scheme without much increase of the decoding delay and complexity.

  • PDF

Optimal Parameter Estimation of the ML Test Based Audio Watermark Decoder (ML 시험 기반 오디오 워터마크 디코더의 최적 변수추정)

  • Lee, Jin-Geol
    • The Journal of the Acoustical Society of Korea
    • /
    • v.25 no.2
    • /
    • pp.56-60
    • /
    • 2006
  • Based on the fact that audio signals in the time domain have the generalized Gaussian distribution. an optimal parameter estimation of the ML (maximum likelihood) test based audio watermark decoder. which leads to the minimal bit error rate, is Proposed. Its superiority of performance over the existing estimation and the conventional correlation based decoder is demonstrated experimentally.

Low-Complexity Maximum-Likelihood Decoder for VBLAST-STBC Scheme Using Non-square OSTBC Code Rate 3/4

  • Pham Van-Su;Le Minh-Tuan;Mai Linh;Yoon Gi-Wan
    • Journal of information and communication convergence engineering
    • /
    • v.4 no.2
    • /
    • pp.75-78
    • /
    • 2006
  • This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. Stacking received symbols from different symbol duration and applying QR decomposition result in the special format of upper triangular matrix R so that the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

Low-Complexity Maximum-Likelihood Decoder for V-BLAST Architecture

  • Le, Minh-Tuan;Pham, Van-Su;Mai, Linh;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.126-130
    • /
    • 2005
  • In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providingthe V-BLAST schemes with ML performance at low detection complexity.

  • PDF

Simplified Maximum-Likelihood Decoder for V-BLAST Architecture

  • Le Minh-Tuan;Pham Van-Su;Mai Linh;Yoon Giwan
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.2
    • /
    • pp.76-79
    • /
    • 2005
  • In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providing the V­BLAST schemes with ML performance at low detection complexity

Low Complexity Maximum-likelihood Decoder for VBLAST-STBC scheme using non-square O-STBC code rate $\frac{3}{4}$

  • Pham Van-Su;Le Minh-Tuan;Mai Linh;Yoon Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.107-110
    • /
    • 2006
  • This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. By stacking received symbols from different received symbolduration and applying QR decomposition resulting the special format of upper triangular matrix R, the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

  • PDF

A Joint ML and ZF/MMSE Detection Algorithm in Uplink for BS Cooperative System (셀간 협력 통신을 위한 상향링크 환경에서의 ML 및 ZF/MMSE를 결합한 검출 기술)

  • Kim, Jurm-Su;Kim, Jeong-Gon;Kim, Seok-Woo
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.3
    • /
    • pp.392-404
    • /
    • 2011
  • In this paper, we address the issue of joint detection schemes for uplink cellular system when base station cooperation is possible for multi-user detection in multi-cell scenario. The ZF, ML, MMSE and SIC detection are analyzed and evaluated as a conventional scheme. ML attains the optimal performance but the complexity increases exponentially, ZF/MMSE have simple structure but have poor detection performance and SIC has better performance but it has large complexity and potential of the error propagation. However, they need the increased decoder complexity as the number of iteration is increased. We propose a new joint ML and ZF/MMSE detection scheme, which combines the partial ML decoding and ZF/MMSE detection, in order to decrease the decoder complexity. Simulation results show that the proposed scheme attains same or a little bit better BER performance and expect reduced decoder complexity, specially in the case of large number of Base Station are cooperated each other.

Maximum Diversity Achieving Decoders in MIMO Decode-and-Forward Relay Systems with Partial CSI

  • Jin, Xianglan;Kum, Eun-Ji;Lim, Dae-Woon
    • Journal of Communications and Networks
    • /
    • v.16 no.1
    • /
    • pp.26-35
    • /
    • 2014
  • We consider multiple-input multiple-output decode-and-forward relay systems in Rayleigh fading channels under the partial channel state information (CSI) that the channel statistics of the source-relay (SR) link and the instantaneous CSI of the source-destination and relay-destination links are known at the destination. In this paper, we propose a new near maximum likelihood (near-ML) decoder with two-level pairwise error probability (near-ML-2PEP) which uses the average PEP instead of the exact PEP. Then, we theoretically prove that the near-ML and near-ML-2PEP decoders achieve the maximum diversity, which is confirmed by Monte Carlo simulations. Moreover, we show that the near-ML-2PEP decoder can also achieve the maximum diversity by substituting the average PEP with the values that represent the error performance of the SR link.

Depth-first branch-and-bound-based decoder with low complexity (검출 복잡도를 감소 시키는 Depth-first branch and bound 알고리즘 기반 디코더)

  • Lee, Eun-Ju;Kabir, S.M.Humayun;Yoon, Gi-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2525-2532
    • /
    • 2009
  • In this paper, a fast sphere decoder is proposed for the joint detection of phase-shift keying (PSK) signals in uncoded Vertical Bell Laboratories Layered Space Time (V-BLAST) systems. The proposed decoder, PSD, consists of preprocessing stage and search stage. The search stage of PSD relies on the depth-first branch-and-bound (BB) algorithm with "best-first" orders stored in lookup tables. Simulation results show that the PSD is able to provide the system with the maximum likelihood (ML) performance at low complexity.

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