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

This paper proposes and analyzes the iterative groupwise equal-delay interference cancellation(IGEIC) algorithm for coherent detection of an asynchronous wideband DS-CDMA system in a single cell over multipath fading channels. The IGEIC algorithm divide users in a system into several groups, and subtract out interference signal from the received signal as many as the number of users within a user group, iteratively. The IGEIC algorithm is also classified into the iterative groupwise equal-delay serial interference cancellation(IGESIC) algorithm and the iterative groupwise equal-delay parallel interference cancellation(IGEPIC) algorithm. In the case of perfect correlation for spreading codes, it shows that the performance of IGESIC and IGEPIC algorithm is the same after interference cancellation of as many as the number of users within a user group, but the performance of IGEPIC algorithm is superior to the IGESIC algorithm just before fecal cancellation within a user group. The results show that (he performance of the two proposed algorithms are also superior to the SIC algorithm by 3dB.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1504-1526
• /
• 2018

For uplink multi-user massive MIMO systems, conventional minimum mean square error (MMSE) linear detection method achieves near-optimal performance when the number of antennas at base station is much larger than that of the single-antenna users. However, MMSE detection involves complicated matrix inversion, thus making it cumbersome to be implemented cost-effectively and rapidly. In this paper, we first summarize in detail the state-of-the-art simplified MMSE detection algorithms that circumvent the complicated matrix inversion and hence reduce the computation complexity from ${\mathcal{O}}(K^3)$ to ${\mathcal{O}}(K^2)$ or ${\mathcal{O}}(NK)$ with some certain performance sacrifice. Meanwhile, we divide the simplified algorithms into two categories, namely the matrix inversion approximation and the classical iterative linear equation solving methods, and make comparisons between them in terms of detection performance and computation complexity. In order to further optimize the detection performance of the existing detection algorithms, we propose more proper solutions to set the initial values and relaxation parameters, and present a new way of reconstructing the exact effective noise variance to accelerate the convergence speed. Analysis and simulation results verify that with the help of proper initial values and parameters, the simplified matrix inversion based detection algorithms can achieve detection performance quite close to that of the ideal matrix inversion based MMSE algorithm with only a small number of series expansions or iterations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.304-310
• /
• 2009

This paper proposes a successive MAP (maximum a posteriori probability) detection scheme with SoIC(soft interference cancellation) to reduce the receiver complexity of hierarchical M-ary QAM system. For the successive MAP detection, modulation symbols generated from the other data streams are treated as Gaussian noise or eliminated as the soft interference according to their priorities. The log-likelihood ratio of the a posteriori probability (LAPRP) of each bit is calculated by the MAP detector with an adjusted noise variance in order to take the elimination and Gaussian assumption effect into account. By separating the detection process into the successive steps, the detection complexity is reduced to increase linearly with the number of bits per hierarchical M-ary QAM symbol. Simulation results show that the proposed detection provides a small performance degradation as compared to the optimal MAP detection.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.807-817
• /
• 2008

We present a low-density parity-check (LDPC)-based, threaded layered space-time-frequency system with emphasis on the iterative receiver design. First, the unbiased minimum mean-squared-error iterative-tree-search (U-MMSE-ITS) detector, which is known to be one of the most efficient multi-input multi-output (MIMO) detectors available, is improved by augmentation of the partial-length paths and by the addition of one-bit complement sequences. Compared with the U-MMSE-ITS detector, the improved detector provides better detection performance with lower complexity. Furthermore, the improved detector is robust to arbitrary MIMO channels and to any antenna configurations. Second, based on the structure of the iterative receiver, we present a low-complexity belief-propagation (BP) decoding algorithm for LDPC-codes. This BP decoder not only has low computing complexity but also converges very fast (5 iterations is sufficient). With the efficient receiver employing the improved detector and the low-complexity BP decoder, the proposed system is a promising solution to high-data-rate transmission over selective-fading channels.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.505-508
• /
• 2000

The success of target reconstruction in SAR(Synthetic Aperture Radar) imaging system is greatly dependent on the coherent detection. Primary causes of incoherent detection are uncompensated target or sensor motion, random turbulence in propagation media, wrong path in radar platform, and etc. And these appear as multiplicative phase error to the echoed signal, which consequently, causes fatal degradations such as fading or dislocation of target image. In this paper, we present iterative phase error estimation scheme which uses echoed data in all temporal frequencies. We started with analyzing wave equation for one point target and extend to overall echoed data from the target scene - The two wave equations governing the SAR signal at two temporal frequencies of the radar signal are combined to derive a method to reconstruct the complex phase error function. Eventually, this operation attains phase error correction algorithm from the total received SAR signal. We verify the success of the proposed algorithm by applying it to the simulated spotlight-mode SAR data.

• Information and Communications Magazine
• /
• v.24 no.12
• /
• pp.14-21
• /
• 2007

This paper aims to improve the design of iterative detection and decoding(IDD) based on the soft interference cancellation with minimum mean squared error(SC-MMSE) detector, which shows low performance compared to the maximum a posteriori(MAP) detector. By means of extrinsic information transfer(EXIT) chart analysis, such low performance may be attributed to that the "pure"(original) turbo principle is not always best for IDD. Thus, we propose a new IDD architecture based on the SC-MMSE detector which uses new a priori information. Simulation results show that the performance of the proposed IDD is very close to that of IDD based on the MAP detector.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.2 no.3
• /
• pp.17-23
• /
• 2003

Turbo decoding in combination with detection strategy for Multi Access Interference (MAI) cancellation has been shown to be very effective for MC-CDMA system in Rayleigh multi-path fading environment. This paper reports new simulation results on the efficacy of joint decoding and detection for MC-CDMA in nonlinear and fading channel.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.384-390
• /
• 2004

We propose a new bandwidth-efficient technique that achieves high data rates over a wideband wireless channel. This new scheme is targeted for a multiple-input multiple- output orthogonal frequency-division multiplexing (MIMO-OFDM) system that achieves transmit diversity through a space frequency block code and capacity enhancement through the iterative joint processing of zero-forcing detection and maximum a posteriori (MAP) decoding. Furthermore, the proposed scheme is compared to the coded Bell Labs Layered Space-Time OFDM (BLAST-OFDM) scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.702-721
• /
• 2012

In the DVB-T2 system with a multiple-input single-output (MISO) transmission mode, Alamouti coded orthogonal frequency division multiplexing (OFDM) signals are transmitted simultaneously from two spatially separated transmitters in a single frequency network (SFN). In such systems, each transmit-receive link may have a distinct carrier frequency offset (CFO) due to the Doppler shift and/or frequency mismatch between the local oscillators. Thus, the received signal experiences dual CFOs. This not only causes dual phase errors in desired data but also introduces inter-carrier interference (ICI), which cannot be removed completely by simply performing a CFO compensation. To overcome this problem, this paper proposes an iterative detection with dual phase errors compensation technique. In addition, we propose a successive-iterative ICI cancellation technique. This technique successively eliminates ICI in the initial iteration by exploiting pre-detected data pairs. Then, in subsequent iterations, it performs a fine interference cancellation using a priori information, iteratively fed back from the channel decoder. In contrast to previous works, the proposed techniques do not require estimates of dual CFOs. Their performances are evaluated via a full DVB-T2 simulator. Simulation results show that the DVB-T2 receiver equipped with the proposed dual phase errors compensation and the successive-iterative ICI cancellation techniques achieves almost the same performance as ideal dual CFOs-free systems, even for large dual CFOs.

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.742-748
• /
• 2010

Instead of using sphere decoding, list sphere decoding (LSD) has been introduced to increase the reliability of log-likelihood ratio (LLR) in recent soft decoding schemes employing iterative detection and decoding (IDD). Although LSD provides improved performance, it does not obtain complexity gain due to signal-to-noise ratio (SNR) increment as it detects large number of lattice points. Especially, its inefficient scenario arises when it has to search for lattice points which have small affect for obtaining LLR with high reliability. In this paper, we study an efficient algorithm to remove such lattice points, which results in complexity reduction based on radius optimization.