• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 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.

• 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

• 한국통신학회논문지
• /
• 제32권2C호
• /
• pp.160-165
• /
• 2007

In this paper, we propose a novel signal detection method that achieves the maximum likelihood (ML) performance but requires much less computational complexity than the ML detection. When the well-known linear decoding method is used for space-time block coded (STBC) OFDM systems in fast-fading channels, co-channel interference (CCI) as well as inter-carrier interference (ICI) occurs. A maximum likelihood (ML) method can be employed to deal with the CCI; however, its computational complexity is very high. In this paper, we propose a signal detection method for orthogonal space-time coded OFDM systems that achieves the similar error performance as the ML method, but requires much less computational complexity.

• 한국통신학회논문지
• /
• 제42권4호
• /
• pp.747-749
• /
• 2017

본 논문에서는 maximum-likelihood (ML) 신호검출을 사용하는 공간다중화 multiple-input multiple-output (MIMO) 시스템을 위한 새로운 unequal error protection (UEP) 프리코더 선정기술을 제안한다. 기존 프리코더 선정기술들은 UEP를 고려하지 않고 설계되었으나, 제안된 기술은 다중안테나 UEP를 고려한다. 모의실험을 통해 제안된 기술의 적용에 따른 향상된 다중안테나 UEP 성능을 확인한다.

• 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.

• 산업기술연구
• /
• 제24권B호
• /
• pp.143-148
• /
• 2004

We present a fast algorithm for CDMA (code division multiple access) multiuser detection using the gradient guided search. The fast algorithm calculates the maximum likelihood (ML) metric so efficiently that it needs only O(K) additions in the presence of K users once some initialization is completed. The computational advantages of the fast algorithm over the conventional method are more noticeable as more iterations are required to obtain a suboptimal solution as in the initialization with matched filters.

• 한국통신학회논문지
• /
• 제30권6C호
• /
• pp.523-531
• /
• 2005

덧셈꼴 일차 이동 평균 잡음이 충격성일 때, 가장 비슷함 검파기와 준최적 가장 비슷함 검파기의 결정영역을 얻는다. 가장 비슷함 검파기와 준최적 가장 비슷함 검파기를 쌍극 신호 시스템에 적용하여 비트 오류율 성능을 견준다. 준최적 가장 비슷함 검파기는 가장 비슷함 검파기보다 덜 복잡하고 얼개도 간단하지만 성능은 거의 같다는 것을 보인다. 한편, 잡음 충격성이 심해질수록 일차 이동 평균 잡음에 알맞게 설계한 검파기와 독립이고 분포가 같은 잡음에 알맞게 설계한 검파기의 성능 차이가 커진다는 것도 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권12호
• /
• pp.4099-4113
• /
• 2022

In this paper, we propose improved maximum access delay time, noise variance, and power delay profile (PDP) estimation schemes for orthogonal frequency division multiplexing (OFDM) system in multipath fading channels. To this end, we adopt the approximate maximum likelihood (ML) estimation strategy. For the first step, the log-likelihood function (LLF) of the received OFDM symbols is derived by utilizing only the cyclic redundancy induced by cyclic prefix (CP) without additional information. Then, the set of the initial path powers is sub-optimally obtained to maximize the derived LLF. In the second step, we can select a subset of the initial path power set, i.e. the maximum access delay time, so as to maximize the modified LLF. Through numerical simulations, the benefit of the proposed method is verified by comparison with the existing methods in terms of normalized mean square error, erroneous detection, and good detection probabilities.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.20-25
• /
• 2009

The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a suboptimum multiple-input multiple-output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation.We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly compared to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.

• 한국통신학회논문지
• /
• 제31권9C호
• /
• pp.897-904
• /
• 2006

여러 입력 여러 출력 시스템은 주파수 효율이 높으며, 가장 비슷함 검파기를 쓸 때 성능이 가장 뛰어나다. 가장 비슷함 검파기는 송신 안테나와 별자리의 신호수가 많아지면 지수적으로 복잡해지므로, 성능은 가장 비슷함 검파기보다 떨어지지만 복잡하기는 덜한 영 만들기 검파기가 제안된 바 있다. 이 논문에서는 가장 비슷함 검파기보다 덜 복잡하고 영 만들기 검파기보다 성능이 나은 새로운 검파 기법을 제안한다. 제안한 기법은 신호대잡음비가 높을 때 더욱 효과적임을, 곧, 가장 비슷함 검파기보다 덜 복잡하고 성능은 거의 같음을, 보인다.