• Title/Summary/Keyword: 전력 재할당

Search Result 39, Processing Time 0.022 seconds

Power Re-Allocation for Low-Performance User in Cell-free MIMO Network (셀프리 다중안테나 네트워크에서 하위 성능 사용자를 위한 전력 재할당 기법)

  • Ryu, Jong Yeol;Ban, Tae-Won;Lee, Woongsup
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.9
    • /
    • pp.1367-1373
    • /
    • 2022
  • In this paper, we consider a power re-allocation technique in order to enhance the frequency efficiency of the low performance user in a cell-free multiple input multiple output (MIMO) network. The AP first allocates transmit power to the user to be proportional to the large-scale fading coefficients of the connected users. Then, the AP reduces the power of the users who were allocated power greater than the threshold ratio of total allocated power to be equal to the threshold ratio of the allocated power. Finally, the AP re-allocates the reduced power from the strong channel user to the user who has the worst channel condition, and thus, the frequency efficiency of the low performance user can be enhanced. In the simulation results, we verify the performance of the power re-allocation technique in terms of the spectral efficiency of the low performance user.

Power allocation for sum capacity enhancement of ARQ systems in time-correlated fading channels (시간 상관 채널에서 ARQ 시스템의 합 채널용량 향상을 위한 전력 할당 기법)

  • Park, Jinhyun;Lee, Jae Hong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.243-246
    • /
    • 2011
  • 무선통신 환경에서 채널 용량이 증가하면 정해진 전송률에 대한 불능 확률(outage probability)이 감소하며, 따라서 통신의 신뢰도가 향상된다. 본 논문에서는 채널 페이딩에 대한 시간 상관성(time correlation)이 있는 환경에서 ARQ 시스템의 합 채널 용량을 향상시키는 전력 할당(power allocation) 기법에 대해 다룬다. 송신기에서 전송이 시작되기 전의 채널 정보를 수신기의 피드백을 통해 알고 있다고 가정하고, ARQ 의 재전송 시점의 채널의 확률분포를 다루었다. 이 분포를 통해 재전송 시점의 채널을 추정하고, ARQ 의 모든 재전송에 대한 합 채널 용량 최대화를 위한 전력 할당 문제를 공식화하였다. 이 문제에 대한 해를 분석적으로 도출하였으며, 모의실험 결과를 통해 제안된 전력 할당 기법으로 얻는 합 채널용량이 재전송 시 동일한 전송전력을 사용한 기존의 기법보다 증가함을 확인한다.

  • PDF

Transmit Power Allocation for Soft Frequency Reuse in Coordinated Cellular Systems (인접셀간 협력하는 셀룰라 시스템에서 소프트 주차수 재사용을 위한 송신전력할당 기법)

  • Kim, Dong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4A
    • /
    • pp.316-323
    • /
    • 2009
  • Power allocation of soft frequency reuse(SFR) to increase cell edge user throughput by reducing inter-cell interference is proposed for coordinated cellular systems. SFR is the effective technique to increase cell edge user throughput, however, it costs the degradation of total system throughput. The cost increases when SFR operated in distributed resource controlled systems fails to be fast adaptive in the change of user distribution. The proposed scheme enables coordinated cells to control transmit power adaptively depending on user distribution so that it minimizes the loss of system throughput introduced from SFR while it guarantees enhancement of cell edge user throughput. Through system level simulation considering neighboring two cells, evaluation result for adaptive power allocation is shown compared with static power allocation.

Retransmission Scheme with Equal Combined Power Allocation Using Decoding Method with Improved Convergence Speed in LDPC Coded OFDM Systems (LDPC로 부호화된 OFDM 시스템에서 수렴 속도를 개선시킨 복호 방법을 적용한 균등 결합 전력 할당 재전송 기법)

  • Jang, Min-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.9
    • /
    • pp.750-758
    • /
    • 2013
  • In this paper, we introduce the low-density parity-check (LDPC) coded orthogonal frequency division multiplexing (OFDM) subframe reordering scheme for achieving equal combined power allocation in type I hybrid automatic repeat request (H-ARQ) systems and analyze the performance improvement by using the channel capacity. Also, it is confirmed that the layered decoding for subframe reordering scheme in H-ARQ systems gives faster convergence speed. It is verified from numerical analysis that a subframe reordering pattern having larger channel capacity shows better bit error rate (BER) performance. Therefore the subframe reordering pattern achieving equal combined power allocation for each subframe maximizes the channel capacity and outperforms other subframe reordering patterns. Also, it is shown that the subframe reordering scheme for achieving equal combined power allocation gives better performance than the conventional Chase combining scheme without increasing the decoding complexity.

Efficient Power Allocation Algorithms for Adaptive Spatial Multiplexing MIMO Systems (적응 공간 다중화 MIMO 시스템을 위한 효율적인 전력 할당 알고리즘)

  • Shin, Joon-Ho;Kim, Dong-Geon;Park, Hyung-Rae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4C
    • /
    • pp.232-240
    • /
    • 2011
  • While the water-filling algorithm is an efficient power allocation method that maximizes the ergodic capacity of adaptive MIMO systems, its excessive residual power causes spectrum loss in real systems employing discrete modulation indices. In this paper we propose new power allocation algorithms that improve the spectral efficiency of MIMO systems by efficiently reallocating the residual power of the water-filling algorithm. We apply the proposed algorithms to the adaptive turbo-coded MIMO system to verify their performance through computer simulation in various environments. Simulation results show that the spectral efficiency of the proposed algorithms is better than that of the water-filling algorithm by about 8.9% at SNR of 20dB in Rayleigh fading environments.

A Low Power Resource Allocation and Scheduling Algorithm for High Level Synthesis (상위 레벨 합성을 위한 저 전력 스케줄링 및 자원할당 알고리즘)

  • Sin, Mu-Kyoung;Lin, Chi-Ho
    • The KIPS Transactions:PartA
    • /
    • v.8A no.3
    • /
    • pp.279-286
    • /
    • 2001
  • This paper proposes a low power resource allocation and scheduling algorithm that minimized power consumption such as DSP circuit in high-level synthesis process. In this paper, we have used list-scheduling method for low power design in scheduling step. Also, it increase possibility to reuse input through resource sharing when assign resource. After scheduling, the resources allocation uses the power function in consideration of the result of calculating average hamming distances and switching activity between two input. First, it obtain switching activity about input value after calculate average hamming distances between two operator and find power value make use of bit pattern of the input value. Resource allocation process assign operator to minimize average hamming distance and power dissipation on all occasions which is allocated at each control step according to increase control step. As comparing the existed method, the execution time becomes fast according to number of operator and be most numberous control step. And in case of power that consume, there is decrease effect from 6% to 8% to be small.

  • PDF

Low Complexity Power Allocation Scheme for MIMO Multiple Relay System With Weighted Diagonalization (다중 안테나 다중 중계 시스템을 위한 가중치 대각화 기반의 저 복잡도 전력 할당 기법)

  • Lee, Bumsoo;Lee, Chungyong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.2
    • /
    • pp.27-34
    • /
    • 2013
  • We propose a simple power allocation scheme for an amplify-and-forward multiple relay system with multiple-input multiple-output antennas. Unlike the existing relay precoding matrix with full elements, proposed precoder is a diagonal matrix whose diagonal element is the relay gain for each stream. Furthermore, a weight vector is applied to streams, such that the mutual information of the system approaches that of the exhaustive search scheme, regardless of the number of antennas. Numerical results show that proposed scheme outperforms the conventional schemes with respect to mutual information.

Capacity Optimization of a 802.16e OFDMA/TDD Cellular System using the Joint Allocation Algorithm of Sub-channel and Transmit Power Part I : Sub-channel Allocation Algorithm for Throughput Maximization in the Downlink insuring Fairness and Power Allocation Algorithm for efficient use of Extra Transmit Power efficiently (802.16e OFDMA/TDD 셀룰러 시스템의 성능 최적화를 위한 부채널과 전송전력 결합 할당 알고리즘 Part I : 하향링크에서 공평성이 보장되는 수율 최대화 부채널 할당 알고리즘 및 잉여 전송전력의 효율적인 사용을 위한 전력할당 알고리즘)

  • Ko, Sang-Jun;Chang, Kyung-Hi;Kim, Jae-Hyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3A
    • /
    • pp.247-260
    • /
    • 2007
  • This paper solves the problem of finding a suitable sub-channel and power joint allocation method for multiple users in 802.16e OFDMA/TDD cellular systems. The joint allocation is thatfirstly the sub-channel is allocated to the users and then suitable power is allocated. We propose a FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm which is a dynamic channel allocation algorithm considering all users' channel state information conditionally to maximize fairness and throughput. The improved CHC algorithm, which is dynamic power allocation algorithm, is also proposed in this paper The Improved CHC algorithm collects the extra of the downlink transmit power and then re-allocates it to other users. Simulation results show that the proposed improved CHC algorithm additionally increases the fairness and sector throughput.

A Low Power-Driven Data Path Optimization based on Minimizing Switching Activity (스위칭 동작 최소화를 통한 저전력 데이터 경로 최적화)

  • 임세진;조준동
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.4
    • /
    • pp.17-29
    • /
    • 1999
  • This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

  • PDF

A Study of Reuse Module Generation Algorithm consider the Power Consumption for FPGA Technology Mapping (FPGA 기술 매핑을 위한 소모 전력을 고려한 재사용 모듈 생성 알고리즘에 관한 연구)

  • Youn, Choong-Mo;Kim, Jae-Jin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.12
    • /
    • pp.2306-2310
    • /
    • 2007
  • In this paper, reuse module generation algorithm consider the power consumption for FPGA technology mapping is proposed. To proposed algorithm is RT library generating algorithm, consider power consumption for reuse module using FPGA technology mapping. In the first, selected FPGA for power consumption calculation. Technology mapping process have minimum total power consumption consider LUT's constraint in selected FPGA. A circuit into device by selected proper modules of allocation result for power consumption constraint using data.