• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.59-62
• /
• 1999

CDMA receiving algorithms, such as single/multi user detector and smart antenna system which have been proposed to suppress ISI and MAI. still suffer from the residual interferences among the output signals. A blind adaptive CMA post-processing technique, which is able to suppress the residual ISI and MAI symbol-by-symbol was proposed. It can be easily applied to any conventional detector at the expense of a small amount of additional computations. In this paper, a solution for the convergence problem of proposed method is proposed and analyzed. Through computer simulations it was shown that the proposed method has stable convergence property and good performance in BER.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.2
• /
• pp.153-160
• /
• 2017

Recently, the demand has continued to increase for higher data rates and improved multimedia services through wireless internet access. In order to increase the data rate and link reliability, 3GPP LTE/A and IEEE 802.16e/m WiMAX systems incorporate MIMO transmission schemes. Since the hardware complexity increases with the number of transmit data streams and mobile devices have limited physical dimensions, an multiple input multiple output (MIMO) ystem with two antennas at both the transmitter and the receiver ($2{\times}2$) is considered to be a possible solution for mobile devices. In this paper, a low-complexity soft output MIMO symbol detector based on Modified-SQRD is proposed for mobile devices with two transmit and two receive antennas.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.1-4
• /
• 2001

In this paper, we develop a blind adaptive multiuser detector for synchronous CDMA with a noise-whitened filter. To Improve the symbol error probability performance, Decision-Feedback Blind Adaptive Multiuser Detector(DFBD) is proposed and compared with Blind Adaptive Multiuser Detector(BD). The proposed DFBD is slightly improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3B
• /
• pp.220-225
• /
• 2002

MUD(Multiuser detection) technology which locates desired signal and removes interference signal from multiple access signals increases system capacity and decreases multiple access effect. In this paper, we develop a blind adaptive multiuser detector for synchronous CDMA with a noise-whitened filter. To improve the symbol error probability performance, DFBD (Decision-Feedback Blind Adaptive Multiuser Detector) is proposed and compared with BD(Blind Adaptive Multiuser Detector). The proposed DFBD is slightly improved.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.27-39
• /
• 2016

This paper derives and analyzes a novel block fast Fourier transform (FFT) based joint detection algorithm. The paper compares the performance and complexity of the novel block-FFT based joint detector to that of the Cholesky based joint detector and single user detection algorithms. The novel algorithm can operate at chip rate sampling, as well as higher sampling rates. For the performance/complexity analysis, the time division duplex (TDD) mode of a wideband code division multiplex access (WCDMA) is considered. The results indicate that the performance of the fast FFT based joint detector is comparable to that of the Cholesky based joint detector, and much superior to that of single user detection algorithms. On the other hand, the complexity of the fast FFT based joint detector is significantly lower than that of the Cholesky based joint detector and less than that of the single user detection algorithms. For the Cholesky based joint detector, the approximate Cholesky decomposition is applied. Moreover, the novel method can also be applied to any generic multiple-input-multiple-output (MIMO) system.

• Journal of Advanced Navigation Technology
• /
• v.7 no.2
• /
• pp.141-148
• /
• 2003

This paper presents and compares several techniques that detect the symbol rate of unknown received signal. Symbol rate is detected from the power spectral density of the circuits such as the delay and multiplier circuit, the square law circuit, and analytic signal, etc. As a result of discrete Fourier transform of the output signals of these circuits, a lot of spectral lines and some peaks appear in frequency domain and the position of first peak is corresponding to the symbol rate. If a spectral line on the frequency that is not located in symbol rate is larger than the first peak, the symbol rate is erroneously detected. Thus, the ratio between the value of first peak and the highest side spectral line is used for the measure of the performance of symbol rate detector. For the MPSK modulation, the analytic signal method shows better performance than the delay and multiplier and square law circuits when the received signal power is lager than -20dB. It is also noted that the delay and multiplier circuit is not able to detect the symbol rate for the QAM modulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.500-505
• /
• 2009

In this paper, We present a low complexity candidate list generation scheme in iterative MIMO receiver. Since QAM modulation can be decomposed into HP symbols and LP symbol and HP symbol is robust in error capability, we generate HP symbol list with simple ZF detector output and its corresponding neighbor HP symbols, Then, based on HP symbol list, the LP symbol list is generated by using the sphere decoder. From the second iteration, since apriori value from channel decoder is available, the candidate list is updated based on demodulated apriori value. Through the simulation, we observe that at the first iteration, the BER performance is worse than LSD. However, as the number of iteration is increased, the proposed scheme has almost same performance as LSD. Moreover, the proposed one has reduced candidate list generation time and lower number of candidate list compared with LSD.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.25-30
• /
• 2005

This paper generalizes the concept of the signal space detection to construct a fixed delay tree search (FDTS) detector which estimates a block of n channel symbols at a time. This technique is applicable to high speed implementation. Two approaches are discussed both of which are based on efficient signal space partitioning. In the first approach, symbol detection is performed based on a multi-class partitioning of the signal space. This approach is a generalization of binary symbol detection based on a two-class pattern classification. In the second approach, binary signal detection is combined with a look-ahead technique, resulting in a highly parallel detector architecture.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.609-621
• /
• 2015

Recently, a variety of reduced complexity soft-in soft-output detection algorithms have been introduced for iterative detection and decoding (IDD) systems. However, it is still challenging to implement soft-in soft-output detectors for MIMO systems due to heavy burden in computational complexity. In this paper, we propose a soft detection algorithm for MIMO systems which performs close to the full dimensional joint detection, yet offers significant complexity reduction over the existing detectors. The proposed algorithm, referred to as soft-input soft-output successive group (SSG) detector, detects a subset of symbols (called a symbol group) successively using a deliberately designed preprocessing to suppress the inter-group interference. In fact, the proposed preprocessor mitigates the effect of the interfering symbol groups successively using a priori information of the undetected groups and a posteriori information of the detected groups. Simulation results on realistic MIMO systems demonstrate that the proposed SSG detector achieves considerable complexity reduction over the conventional approaches with negligible performance loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.4
• /
• pp.561-571
• /
• 1993

In this paper, a new discrete Symbol Timing Recovery (STR) algorithm, is proposed. This algorithm is derived from the optimum estimation theory. The algorithm combines the advantages of Mueller and $M\"{u}ller$ algorithm and Gardner algorithm, and avoids some of their shortcomings. The implementation of the new timing detector is simple and the combined operations of Carrier Recovery (CR) -STR is possible because the operation of the new STR is independent of the carrier phase. On the other hand, the behavior of nonlinear characteristics in the new algorithm is analyzed and explained. The performance evaluation is accomplished in detail by numerical calculations and Monte-Carlo simulations. In these respects, this algorithm is similar to Gardner's algorithm, but in tracking performance due to pattern jitter at small rolloff, the proposed algorithm is superior to Gardner's algorithm.