• 한국항행학회논문지
• /
• 제9권2호
• /
• pp.192-199
• /
• 2005

Adaptive Modulation & Coding (AMC)기법은 무선통신 채널 환경의 변화에 적응하기 위하여 변조방식과 코딩속도를 변화시키는 방법이다. 휴대 인터넷 시스템에서는 이동성에 의한 간섭과 OCI(Other Cell Interference)에 의한 간섭량의 변화가 크기 때문에 이에 대한 영향을 줄이고자 AMC기법을 사용한다. 본 논문에서는 적절한 MCS (Modulation & Coding Scheme)레벨을 결정하기 위해 단말기의 전력을 가장 효율적으로 할당하는 방식에 관하여 논의하고 그 성능을 비교한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2012년도 추계학술대회
• /
• pp.607-610
• /
• 2012

본 논문의 목적은 다중 셀 OFDMA 시스템에서 효율적인 부채널 할당에 근거하여 서비스 연속성을 제공하는 것이다. 특히 지연 및 손실에 의해 서비스 지속성에 악영향을 야기할 가능성이 있으므로 다양한 이동 멀티미디어 서비스의 QoS 요구사항을 유지하기 위하여 핸드오버 관리 방안이 필요하다.

• 한국통신학회논문지
• /
• 제37권7A호
• /
• pp.522-527
• /
• 2012

본 논문에서는 하향 링크 직교 주파수 분할 다중 접속 네트워크에서 길쌈부호의 비트오율에 대한 상계를 유도한다. 비터비 복호기를 사용한다는 가정 하에 네트워크 로드가 작은 경우 라플라시안 복호 메트릭을 사용하는 하향 링크 직교 주파수 분할 다중 접속 네트워크의 비트오율 성능이 가우시안 복호 메트릭을 사용하는 동일 시스템의 비트오율 성능보다 우수하다는 것을 확인할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.1876-1889
• /
• 2013

Packet-based mobile multimedia services for the Internet differ with respect to their resource requirements, performance objectives, and resource usage efficiencies. Nonetheless, each mobile terminal should support a variety of multimedia services, sometimes even simultaneously. This paper proposes a sub-channel allocation scheme based on multi-level priority for supporting mobile multimedia services in an Orthogonal Frequency Division Multiple Access (OFDMA) system. We attempt to optimize the system for satisfying the Quality of Service (QoS) requirements of users and maximize the capacity of the system at the same time. In order to achieve this goal, the proposed scheme considers the Signal-to-Interference-plus-Noise Ratio (SINR) of co-sub-channels in adjacent cells, the Signal-to-Noise Ratio (SNR) grade of each sub-channel in the local cell on a per-user basis, and the characteristics of the individual services before allocating sub-channels. We used a simulation to evaluate our scheme with the performance measure of the outage probabilities, delays, and throughput.

• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.30-42
• /
• 2010

In this work we consider the problem of downlink resource allocation for proportional fairness of long term received rates of data users and quality of service for real time sessions in an OFDMA-based wireless system. The base station allocates available power and subchannels to individual users based on long term average received rates, quality of service (QoS) based rate constraints and channel conditions. We formulate and solve a joint bandwidth and power optimization problem, solving which provides a performance improvement with respect to existing resource allocation algorithms. We propose schemes for flat as well as frequency selective fading cases. Numerical evaluation results show that the proposed method provides better QoS to voice and video sessions while providing more and fair rates to data users in comparison with existing schemes.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.159-160
• /
• 2006

We present a multiuser synchronization scheme for OFDMA uplink systems. First a new preamble structure is proposed by which timing and frequency offsets estimation is developed. Based on proposed structure a new joint synchronization scheme is presented and the simulation results show that the performance of this scheme don't suffer from the number of users.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.153-154
• /
• 2006

We propose the dynamic channel allocation (DCA) algorithm for multi-cell OFDMA systems to avoid co-channel interference (CCI). The proposed algorithm is utilized not in a centralized, but in a distributed manner which reduces complexity. The simulation results confirm that the number of overlapping allocated subcarriers is reduced and the average SINR of a sub-carrier is increased by this algorithm.

• ETRI Journal
• /
• 제26권5호
• /
• pp.391-396
• /
• 2004

In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short-term fairness as well as long-term fairness for various real-time traffic.

• ETRI Journal
• /
• 제26권1호
• /
• pp.48-52
• /
• 2004

In this letter, we consider a new packet scheduling algorithm for an orthogonal frequency division multiplexing access/frequency division duplex (OFDMA/FDD)-based system, e.g., mobile broadband wireless access or high-speed portable internet systems, in which the radio resources of both time and frequency slots are dynamically shared by all users under a proper scheduling policy. Our design objective is to increase the number of non-realtime service (e.g., WWW) users that can be supported in the system, especially when the minimum bit rate requirement is imposed on them. The simulation results show that our proposed algorithm can provide a significant improvement in the average outage probability performance for the NRT service, i.e., significantly increasing the number of NRT users without much compromising of the cell throughput.

• Journal of Electrical Engineering and Technology
• /
• 제9권2호
• /
• pp.721-725
• /
• 2014

In this paper, we propose a fast adaptive power allocation method for an orthogonal frequency division multiple access (OFDMA) system that employs an adaptive modulation and coding (AMC) scheme. The proposed scheme aims to reduce the calculation complexity of greedy adaptive power allocation (APA), which is known as the optimal algorithm for maximizing the utility argument of power. Unlike greedy APA, which starts power allocation from "0", the proposed algorithm initially allocates a certain level of power determined by the water-filling scheme. We theoretically demonstrate that the proposed algorithm has almost the same capability of maximizing the utility argument as the greedy APA while reducing the number of operations by 2M, where M is the number of AMC levels.