• 제목/요약/키워드: maximum-likelihood (ML) decoder

검색결과 24건 처리시간 0.029초

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
    • /
    • 제4권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
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2005년도 춘계종합학술대회
    • /
    • 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
    • /
    • 제3권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

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
    • /
    • 제16권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.

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

  • 이진걸
    • 한국음향학회지
    • /
    • 제25권2호
    • /
    • pp.56-60
    • /
    • 2006
  • 시간영역에서 오디오 신호는 일반화된 가우시안 분포를 갖는다는 사실에 기초하여 BER (Bit Error Rate)이 최소가 되는 ML (Maximum Likelihood) 시험 기반 오디오 워터마크 디코더의 최적 변수추정방법을 제안하였다. 제안한 방법이 기존의 변수추정방법이나 상관관계에 기초한 디코더 보다 성능이 우수함을 실험적으로 증명하였다.

여러 입력 여러 출력 시스템에 알맞도록 너비를 먼저 탐색하는 가장 비슷함 복호 방식 (A Maximum Likelihood Decoding Scheme Based on Breadth-First Searching for Multi-Input Multi-Output Systems)

  • 강현구;송익호;안태훈;김윤희
    • 한국통신학회논문지
    • /
    • 제32권1C호
    • /
    • pp.34-42
    • /
    • 2007
  • 여러 입력 여러 출력 시스템에서 쓰는 복호 방식인 공 복호기는 깊이를 먼저 탐색하는 가장 비슷함 복호 방식이다. 이 논문에서는 너비를 먼저 탐색하는 방법을 바탕으로, 여러 입력 여러 출력 시스템에 알맞은 새로운 가장 비슷함 복호기를 제안한다. 제안한 복호기는 가장 비슷함 검파기와 비트 오류율이 같으며 공 복호기보다 계산량이 꽤 적다는 것을 모의실험으로 보인다.

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
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2006년도 춘계종합학술대회
    • /
    • 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

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

  • 이은주;;윤기완
    • 한국정보통신학회논문지
    • /
    • 제13권12호
    • /
    • pp.2525-2532
    • /
    • 2009
  • 본 논문에서는 uncoded V-BLAST(Vertical Bell Laboratories Layered Space Time) 시스템에서 PSK 신호들을 joint-detection하기 위한 fast sphere decoder를 제안한다. 이른바 PSD라 불리는 제안된 디코더는 예비처리단계와 검색단계로 구성된다. PSD의 검색단계에서는 depth-first branch and bound 알고리즘을 통해 검출 후보가 되는 신호원들의 최상우선순위(best-first order)를 정하고 이 순위에 따라 신호를 검출하게 된다. 이 때 제안된 디코더는 최상우선순위(best-first order)를 정하는데 있어 계산복잡성을 줄이는 새로운 방법을 제안한다. 시뮬레이션 결과는 PSD에 의해 시스템의 복잡성은 줄이면서 시스템 성능은 ML과 동일하게 유지할 수 있음을 보여준다.

Soft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antennas

  • Yang, Jae-Dong;Song, Kyoung-Young;No, Jong-Seon;Shin, Dong-Joan
    • Journal of Communications and Networks
    • /
    • 제13권3호
    • /
    • pp.257-265
    • /
    • 2011
  • In this paper, a cooperative relaying protocol called soft-decision-and-forward (SDF) with multiple antennas in each node is introduced. SDF protocol exploits the soft decision source symbol values from the received signal at the relay node. For orthogonal transmission (OT), orthogonal codes including Alamouti code are used and for non-orthogonal transmission (NT), distributed space-time codes are designed by using a quasi-orthogonal space-time block code. The optimal maximum likelihood (ML) decoders for the proposed protocol with low decoding complexity are proposed. For OT, the ML decoders are derived as symbolwise decoders while for NT, the ML decoders are derived as pairwise decoders. It can be seen through simulations that SDF protocol outperforms AF protocol for both OT and NT.

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

  • Pham, Van-Su;Yoon, Gi-Wan
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2008년도 추계종합학술대회 B
    • /
    • 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