• Journal of Communications and Networks
• /
• 제13권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.

• 한국정보통신학회논문지
• /
• 제20권1호
• /
• pp.52-57
• /
• 2016

다중 경로 약한 산란 (poor scattering) 전 이중 (full-duplex) 시스템에서 혼성 스케줄링을 소개한다. 제안하는 시스템은 다중 안테나를 갖는 하나의 전 이중 기지국과 수 많은 단일 안테나 반 이중 (half-duplex) 단말로 구성된다. 혼성 스케줄링은 송신기에서의 부분적 채널 정보만을 활용한다. 특별히, 상향링크 및 하향링크에서 모두 기회적 송신 기술을 사용하는 기존 스케줄링 방법과는 달리, 제안하는 기술은 하향링크에서의 랜덤 송신 빔형성 및 상향링크에서의 간섭 제거 빔형성을 결합하여 사용한다. 주요 결과로써, 컴퓨터 모의실험을 통해 제안한 기술이 기존 스케줄링 방법보다 특정 신호 대 잡음비 영역 이상에서 훨씬 더 우수한 합 용량 성능을 가짐을 보인다.

• 한국전자파학회논문지
• /
• 제22권6호
• /
• pp.648-653
• /
• 2011

본 논문은 협력 무선 통신 시스템에서 역방향 링크의 제한된 피드백 채널을 통해 AT(Access Terminal)로부터 전달된 부분적인 채널 정보만을 이용하여, 인접 BTS(Base Transceiver Station)에 의한 타 셀 간섭을 효과적으로 억제하는 협력 공간 분할 다중 접속 기술을 제안하였다. 제안하는 협력 공간 분할 다중 접속 기술에서, AT는 각 링크별로 다중 사용자 다이버시티 이득을 최대화 하는 최적의 전송 모드를 선택하고 이를 피드백하며, 클러스터 스케줄러는 각 전송 모드별로 동일 전송 모드를 선택하는 AT들에 대해 스케줄링을 수행하고, 최대 스케줄링 우선 순위를 제공하는 클러스터의 전송 모드와 해당 AT들을 선택한다. 또한, 다중 사용자 다이버시티 이득을 증가시키기 위해, 각 AT별로 다수의 선호하는 전송 모드를 피드백하는 확장된 전송 모드 피드백 방식을 제안하였다. 시뮬레이션을 통해 제안한 기술이 시스템의 상향 링크 피드백의 허용된 용량에 따라 최적의 피드백 방식을 선택함으로써 시스템 전송 용량을 상당히 향상시킬 수 있음을 확인하였다.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.352-363
• /
• 2012

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권2호
• /
• pp.63-81
• /
• 2008

WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.