• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.938-946
• /
• 2012

Interference alignment (IA) is a data transmission technique that achieves the maximum degrees-of-freedom (DoF) in the multiuser interference channel for high signal-to-noise ratios (SNRs). However, most prior works on IA are based on the unrealistic assumption that perfect and global channel-state information (CSI) is available at all transmitters and receivers. In this paper, we propose the efficient design of feedback framework for IA that substantially suppresses the feedback overhead. While the feedback overhead in the conventional IA quadratically increases with K, the proposed feedback scheme supports the sequential exchange of computed IA precoders between transmitters and receivers and reduces the feedback overhead that linearly scales with K. Moreover, we analyze the residual interference due to the quantization error in limited feedback and propose the ordered IA algorithm that selects IA pair to minimize the sum residual interference in given channel realizations.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.8 no.3
• /
• pp.221-231
• /
• 1997

This paper presents an analysis of a hybrid direct-sequence/slow frequency hopped code division multiple access(DS/SFH-CDMA) system employing noncoherent M-ary frequency shift keying(MFSK) modulation in a multiple m-distribution fading environment. Multipath interfer- ence(MPI) and multiuser interference(MUI) is taken into accout and the spectral efficiency is calculated for uncoded as well as simple channel coding systems. The predetection multipath CCI canceller in conjunction with convolution coding is employed for improving the bit error rate(BER) performance. The BER of noncoherent hybrid system is obtained using a Gaussian interference approximation. From the results, we know that the error performance more deteriorates as the depth of fading becomes deeper. The DS part of the modulation combats the multipath interference, whereas the FH part is a predetection against large multiuser interference. It is shown that, for the con- sidered types of a channel coding, the use of a predetection coding is still essential for obtained a satisfactory bit error performance. The results show that the capacity of the DS/SFG-CDMA MFSK communication system increases in proportion to the length of PN code sequence in the presence of AWGN and MUI. In m-distribution fading environment the capacity increases in proportion to the fading index. The capacity is increased and error performance is improved when the CCI Canceller and Convolution code technique are adopted, respectively. From the results, it is known that the error performance of $4\times10^{-2}$ by adopting Canceller technique. Also convolutional coding technique is the improvement of error performance attains about $10^{-5}$ in code rate 1/2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.7B
• /
• pp.944-950
• /
• 2001

현재 상용화된 CDMA (code division multiple access) 방식은 사용자가 증가함에 따라 다중 사용자 간섭에 의해 통화품질 향상 및 가입자 수용 용량 증대에 한계를 가지고 있다. 이러한 문제를 극복하기 위해 다양한 형태의 다중 사용자 검파 알고리즘이 제안되었다. 본 논문에서는 여러 형태의 알고리즘들 가운데, 역상관 (decorrelating) 검파기와 병렬 간섭 제거 (parallel interference cancellation, PIC) 검파기, 연속 간섭 제거 (successive interference cancellation, SIC) 검파기와 PIC 검파기, zero-forcing decision-feedback (ZF-DF) 검파기와 PIC 검파기를 하이브리드 형태로 구성하는 방법을 제시하였고, Rayleigh 페이딩 환경에서 성능분석 및 컴퓨터 시뮬레이션을 통한 성능 비교를 하였다. 컴퓨터 모의실험 결과, 본 논문에서 제안한 세 가지 하이브리드 검파기 모두 기존 검파기에 비하여 우수한 성능을 보였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.174-176
• /
• 2010

이 논문에서는 직교 주파수 분할 다중 접속방식(orthogonal frequency division multiple access : OFDMA)을 이용한 상향 링크 시스템에서 수신된 신호에 주파수 옵셋이 존재할 때 나타나는 영향을 보상하는 방법을 제안한다. OFDMA에서 각 사용자가 전송한 신호에서 발생하는 주파수 옵셋은 다중 접속 간섭(multi-user interference : MUI)을 발생시킨다. 이러한 다중접속 간섭은 OFDMA 시스템의 성능을 저하시키는 주요한 원인 중에 하나이다. 이 논문에서는 시간영역에서 특정 사용자의 신호에 대한 주파수 옵셋의 보상을 한 뒤, 주파수 영역에서 일반적인 채널간간섭 제거 방법을 적용하여 다중 접속 간섭에 의한 영향을 효과적으로 제거하는 방법을 제안한다. 또한 부반송파에 위치에 따라 달리 나타나는 다중 접속 간섭의 크기에 따라 간섭 제거 방법을 달리하여 보다 적은 계산량으로 간섭을 제거하는 방법을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.1954-1971
• /
• 2017

In this work, first, a multiuser detection (MUD) algorithm based on component-level soft interference cancellation and linear minimum mean square error (CLSIC-LMMSE) is proposed, which can enhance the bit error ratio (BER) performance of the traditional SIC-LMMSE-based MUD by mitigating error propagation. Second, for non-binary low density parity check (NB-LDPC) coded high-order modulation systems, when the proposed algorithm is integrated with partial mapping, the receiver with iterative detection and decoding (IDD) achieves not only better BER performance but also significantly computational complexity reduction over the traditional SIC-LMMSE-based IDD scheme. Extrinsic information transfer chart (EXIT) analysis and numerical simulations are both used to support the conclusions.

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

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.11
• /
• pp.1-7
• /
• 2004

We propose multistage parallel nulling (MPN) partial parallel interference cancellation (PPIC) receiver for downlink multiple-input multiple-output (MIMO) multicarrier (MC)-code division multiple access (CDMA) systems. Though the V-BLAST is a popular MIMO receiver, it shows error floor for multiuser downlink MIMO MC-CDMA systems. The proposed MPN-PPIC receiver does not produce error floor for multiuser case, and achieves substantial performance gains with multistage processing. For single user case, the proposed method also surpasses the V-BLAST receiver with multistage processing for MIMO MC-CDMA systems with chip level interleaving. The system performance of the proposed MPN-PPIC receiver is evaluated through computer simulations.

• 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 Communications and Networks
• /
• v.13 no.3
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.90-97
• /
• 2009

The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, and lower multi-path distortion. To further utilize vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subchannel and bit allocation among users. In this paper, we propose an 0-1 integer programming model formulating the optimal subchannel and bit allocation problem of the multiuser OFDM. We employ a dual-decomposition method that provides a tight linear programming (LP) relaxation bound. Simulation results are provided to show the effectiveness of the 0-1 integer programming model. MATLAB simulation on a system employing M-ary quardarature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multi-paths are carried with the optimal subchannel and bit allocation solution generated by 0-1 integer programming model.