• Title/Summary/Keyword: multiuser diversity

Search Result 76, Processing Time 0.026 seconds

Opportunistic Interference Management for Interfering Multiple-Access Channels (간섭 다중 접속 채널에서의 기회적 간섭 관리 기술)

  • Shin, Won-Yong;Park, Dohyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.10
    • /
    • pp.929-937
    • /
    • 2012
  • In this paper, we introduce three types of opportunistic interference management strategies in multi-cell uplink networks with time-invariant channel coefficients. First, we propose two types of opportunistic interference mitigation techniques, where each base station (BS) opportunistically selects a set of users who generate the minimum interference to the other BSs, and then their performance is analyzed in terms of degrees-of-freedom (DoF). Second, we propose a distributed opportunistic scheduling, where each BS opportunistically select a user using a scheduler designed based on two threshold, and then its performance is analyzed in terms of throughput scaling law. Finally, numerical evaluation is performed to verify our result.

A QoS-aware Scheduling Algorithm for Multiuser Diversity MIMO-OFDM System (다중 사용자 MIMO-OFDM 시스템에서의 QoS 제공을 위한 스케줄링 기법)

  • An Se-Hyun;Yoo Myung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7A
    • /
    • pp.717-724
    • /
    • 2006
  • In order to maximize the throughput and provide the fairness between users in MIMO-OFDM system, FATM(fairness-aware throughput maximization) scheduling algorithm was proposed. In this paper, a QoS-aware scheduling algorithms for MINO-OFDM system are proposed, each of which is based on FATM. These scheduling algorithms aim to satisfy the different service requirements of various service classes. Three proposed QoS scheduling algorithms called SPQ (Strict Priority Queueing), DCBQ (Delay Constraint Based Queuing), HDCBQ (Hybrid Delay Constraint Based Queuing) are compared through computer simulations. It is shown that HDCBQ algorithm outperforms other algorithms in satisfying different requirements of various service classes.

Optimal Strategies for Cooperative Spectrum Sensing in Multiple Cross-over Cognitive Radio Networks

  • Hu, Hang;Xu, Youyun;Liu, Zhiwen;Li, Ning;Zhang, Hang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3061-3080
    • /
    • 2012
  • To improve the sensing performance, cooperation among secondary users can be utilized to collect space diversity. In this paper, we focus on the optimization of cooperative spectrum sensing in which multiple cognitive users efficiently cooperate to achieve superior detection accuracy with minimum sensing error probability in multiple cross-over cognitive radio networks. The analysis focuses on two fusion strategies: soft information fusion and hard information fusion. Under soft information fusion, the optimal threshold of the energy detector is derived in both noncooperative single-user and cooperative multiuser sensing scenarios. Under hard information fusion, the optimal randomized rule and the optimal decision threshold are derived according to the rule of minimum sensing error (MSE). MSE rule shows better performance on improving the final false alarm and detection probability simultaneously. By simulations, our proposed strategy optimizes the sensing performance for each cognitive user which is randomly distributed in the multiple cross-over cognitive radio networks.

Efficient Interference Alignment for Uplink MIMO/FDD Systems with Limited Feedback (제한된 궤환 채널 기반 상향링크 MIMO/FDD 시스템에서의 효율적인 간섭 정렬 기법)

  • Cho, Sung-Yoon;Jang, Jin-Young;Kim, Dong-Ku
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.6
    • /
    • pp.988-996
    • /
    • 2012
  • Assuming perfect channel state information (CSI), the conventional interference alignment (IA) algorithm in the uplink cellular system suppresses inter-cell interference (ICI) by aligning ICI to a randomly selected reference vector. However, IA in practice relies on limited feedback between base stations and users, resulting in residual ICI. In this paper, we propose the optimization of the reference vector that minimizes the upper-bound of residual ICI power. Secondly, the iterative IA that designs the direction of transmit and receive filter is proposed to minimize the residual ICI as well as maximize the desired signals. Moreover, we propose the user scheduling method combined with proposed IA schemes which provides the multiuser diversity gain in multi-cell environments. Finally, the performance gain of the proposed IA algorithms compared with the existing IA are analyzed and demonstrated by simulation results.

Opportunistic Beamforming with Link Anaptation Robust to Imperfect Channel Estimation (기회적 빔포밍 시스템에서 채널 추정에 강인한 링크 적응 기법)

  • Kim, Yo-Han;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8C
    • /
    • pp.617-626
    • /
    • 2008
  • Opportunistic Beamforming (OBF) offers a way to provide the multiuser diversity even in slow fading channel by using randomly generated beam weights, leading to the substantially reduced feedback in the form of the instantaneous SNR from users. In spite of the advantage of the reduced feedback, the imperfect channel estimation might influence the quality of the estimated SNR and channel scheduler so bad that the selected AMC level would be higher than the achievable rate of the actual channel, resulting the corruption of transmitted packet. In this paper, we propose a conservative link adaptation, where the estimated SNR is scaled down by a conservative factor which minimizes the variance of the maximum difference between the actual channel SNR and the resultant SNR. To support the proposed scheme, we analyze the statistics of the difference of the channel SNR and the estimated SNR. Simulation results show that the introduction of conservative factor achieves more than two-fold performance improvement in the presence of channel estimation error and the fairness of PF scheduler is maintained when the least squared channel estimator is applied.

Space-Time Concatenated Convolutional and Differential Codes with Interference Suppression for DS-CDMA Systems (간섭 억제된 DS-CDMA 시스템에서의 시공간 직렬 연쇄 컨볼루션 차등 부호 기법)

  • Yang, Ha-Yeong;Sin, Min-Ho;Song, Hong-Yeop;Hong, Dae-Sik;Gang, Chang-Eon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.1
    • /
    • pp.1-10
    • /
    • 2002
  • A space-time concatenated convolutional and differential coding scheme is employed in a multiuser direct-sequence code-division multiple-access(DS-CDMA) system. The system consists of single-user detectors (SUD), which are used to suppress multiple-access interference(MAI) with no requirement of other users' spreading codes, timing, or phase information. The space-time differential code, treated as a convolutional code of code rate 1 and memory 1, does not sacrifice the coding efficiency and has the least number of states. In addition, it brings a diversity gain through the space-time processing with a simple decoding process. The iterative process exchanges information between the differential decoder and the convolutional decoder. Numerical results show that this space-time concatenated coding scheme provides better performance and more flexibility than conventional convolutional codes in DS-CDMA systems, even in the sense of similar complexity Further study shows that the performance of this coding scheme applying to DS-CDMA systems with SUDs improves by increasing the processing gain or the number of taps of the interference suppression filter, and degrades for higher near-far interfering power or additional near-far interfering users.