• Title/Summary/Keyword: 전력 할당 기법

Search Result 173, Processing Time 0.021 seconds

Orthogonal Code Sharing and Radio Resource Allocation in Multibeam Satellite Communication Systems (다중빔 위성 통신 시스템에서 빔간 직교 코드 공유 기법과 동적 무선 자원 할당)

  • Lim, Kwang-Jae;Kim, Soo-Young;Oh, Deok-Gil;Kim, Jae-Moung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3A
    • /
    • pp.140-150
    • /
    • 2003
  • In this paper, we propose a novel code sharing method for downlink transmission of mobile satellite communication systems using a multibeam geosynchronous-orbit satellite. In the proposed system, spreading codes are shared among downlink beams in order to increase the system capacity. We also propose efficient radio resource and transmit power allocation schemes for the proposed system. Simplified analysis and simulation results on the system capacity show the capacity improvement by the proposed scheme. The simulation results show that the capacity of the proposed system is more than 2 times as large as that of a conventional multibeam satellite system. In the frequency-selective fading channel, the capacity improvement increases as the interference between orthogonal spreading codes decrease.

Optimizing 360 Video Parallel Processing for Asymmetric Core in Mobile VR (모바일 VR 을 위한 비대칭 코어에 최적화된 360 비디오 병렬처리)

  • Roh, Hyun-Joon;Ryu, Yeongil;Ryu, Eun-Seok
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.06a
    • /
    • pp.96-99
    • /
    • 2018
  • 최근 초고화질 영상뿐만 아니라 360 비디오 콘텐츠의 보급이 확산되고 있다. 이미 대중적으로 보급된 스마트폰을 통해 누구나 쉽게 이 360 비디오 콘텐츠를 접할 수 있는데, 스마트폰의 성능은 제한적일 수 밖에 없다. 따라서 본 논문은 모바일 VR 에서 360 비디오 병렬처리를 수행할 때 보다 적합한 최적화 방법 2 가지를 소개한다. 이를 위해 전력 소모를 줄이는 장점으로 인해 모바일 디바이스에 많이 사용되는 비대칭 멀티코어의 특징을 활용한다. 두 방법 모두 공통적으로 각 코어의 성능비와 할당되는 작업량을 비례하게 하여 디코딩 작업의 시간을 줄이는 방법들이다. 첫 번째 방법은 영상을 타일로 분할할 때 각 코어의 성능비와 비례하게 분할하는 방법이다. 해당 기법을 적용하기 위해서, 비디오 크기별 연산 복잡도 분석 모델을 활용하여 사용한다. 제안하는 기법을 사용한 실험 결과, 평균적으로 약 25%의 디코딩 시간 개선을 보였다. 두 번째 방법은 타일로 분할된 영상의 각 복잡도 정도를 PU 의 양으로 추정하여, 각 코어의 성능비와 비례하게 코어에 할당하는 방법이다. 해당 기법을 사용하기 위해서, PU 의 양과 연산 복잡도 정도의 상관관계를 회귀분석하여 이를 이용한다. 제안하는 기법을 사용한 실험 결과, 약 9~16%의 디코딩 시간 개선을 보였다.

  • PDF

Rate-Aware Two-Way Relaying for Low-Cost Ship-to-Ship Communications (저비용 선박간 통신을 위한 전송률 인지 양방향 릴레이 기법)

  • Wang, Jinsoo;Kim, Sun Yong;Jeong, Min-A;Lee, Seong Ro;Kim, Yun Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.8
    • /
    • pp.651-659
    • /
    • 2014
  • In this paper, we consider a two way relay network for ship-to-ship communications in a fleet, where two communicating ships exchange the information with the help of a multi-antenna relay ship. For the network, we propose a rate-aware three-phase analog network coding to improve the reliability of the information exchange with asymmetric rates. The proposed scheme allows low-complex implementation of the relay without channel estimation by generating an improved analog network coded signal with the orthogonally received signals from two ships by using only the received signal power at each antenna. In addition, the proposed scheme reduces outages in the data exchange at asymmetric rates by adopting a rate-aware relay power allocation, which is confirmed by evaluating the outage performance via simulation.

An Adaptive Tone Reservation Scheme for PAPR Reduction of OFDM Signals (OFDM 신호의 PAPR 감소를 위한 적응적 톤 예약 기법)

  • Yang, Mo-Chan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.817-824
    • /
    • 2019
  • We propose an ATR (Adaptive Tone Reservation) scheme based on clipping noise for PAPR (Peak-to-Average Power Ratio) reduction of OFDM (Orthogonal Frequency Division Multiplexing) signals. The proposed scheme is composed of three steps: clipping, tone selection, and TR procedures. In the first step, the peak samples in the IFFT (Inverse Fast Fourier Transform) outputs are scaled down by clipping. In the second step, the sub-carrier position where the power of the clipping noise is the maximum, is selected. Finally, the generic TR procedure is performed. Simulation results show that the proposed scheme does not require all the possible combinations for the original TR procedures, while maintaining the PAPR reduction performance.

Throughput Performance of Slotted ALOHA Communication System with Guard Time and Capture Effect (신호점유 현상과 보호시간을 고려한 슬롯형 알로아 통신 시스템의 성능분석)

  • 이현구;곽경섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.7
    • /
    • pp.989-998
    • /
    • 1993
  • In a bursty user traffic mode, ALOHA random multiple access protocol achieves higher performance than any conventional fixed assignment technique. One of central problems in slotted ALOHA is synchronization. Because of the long propagation delay in satellite mobile communication, packet may be spilt over into adjacent slots and thus guard time may be included between packet intervals. In conventional ALOHA channels, simultaneous transmission by two or more users results in a collision : the unsuccessful packets have to be retransmitted according to some retransmission algorithm. However, in a radio environment, users are often at different distances from the receiver : therefore, their received signals have substantially different power levels. The packet arriving with the highest energy now has a good chance of being detected accurately. Similarly, in some spread-spectrum random access systems, the earliest arriving packet dominates later arriving packets and thus captures the channel. In this paper slotted ALOHA channel with non zero guard time and capture probability is studied. Using the Markovian model, the performance of slotted ALOHA with guard time and capture effects is derived and compared with that of the conventional ALOHA via numerical analysis.

  • PDF

KOINONIA High-Rate WPAN Channel Time Allocation and CAC Algorithm for Multimedia Transmission (KOINONIA 고속 WPAN의 멀티미디어 전송을 위한 채널 타임 할당 및 CAC 알고리즘)

  • Park Jong-Ho;Lee Tae-Jin;June Sun-Do;Youn Kyu-Jung;Won Yun-Jae;Cho Jin-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.417-425
    • /
    • 2005
  • KOINONIA is high-rate Wireless Personal Area Network (WPAN) technology, and is developed for multimedia traffic transmission in personal area. A KOINONIA piconet is a collection of one or more associated slaves under a single master. Efficient scheduling of a master for the traffic of slaves is essential to use channel effectively and to guarantee QoS of multimedia traffic. We propose a new scheduling algorithm to allocate channel time at desired intervals regardless of superframe length, and a Connection Admission Control(CAC) algorithm to regulate the number of traffics in a piconet. Our proposed algorithms have been shown to save channel time and to meet QoS requirements compared to the conventional weighted round-robin algorithm.

A Linear Program Based Heuristic for the Bit and Subchannel Allocation in an OFDM System (OFDM 시스템의 비트 및 부채널 할당을 위한 선형계획법 기반 휴리스틱)

  • Moon, Woosik;Kim, Sunho;Park, Taehyung;Im, Sungbin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.67-75
    • /
    • 2013
  • 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 compare the performance of the linear programming dual of the 0-1 integer programming formulation with the existing convex optimization approach for the optimal subchannel and bit allocation problem of the multiuser OFDM. Utilizing tight lower bound provided by the LP dual formulation, we develop a primal heurisitc algorithm based on the LP dual solution. The performance of the primal heuristic is compared with MAO, ESA heuristic solutions, and integer programming solution on MATLAB simulation on a system employing M-ary quadrature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multi-paths.

Unlicensed Band Traffic and Fairness Maximization Approach Based on Rate-Splitting Multiple Access (전송률 분할 다중 접속 기술을 활용한 비면허 대역의 트래픽과 공정성 최대화 기법)

  • Jeon Zang Woo;Kim Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.10
    • /
    • pp.299-308
    • /
    • 2023
  • As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.

Dynamic Voltage Scaling (DVS) Considering the DC-DC Converter in Portable Embedded Systems (휴대용 내장형 시스템에서 DC-DC 변환기를 고려한 동적 전압 조절 (DVS) 기법)

  • Choi, Yong-Seok;Chang, Nae-Hyuck;Kim, Tae-Whan
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.2
    • /
    • pp.95-103
    • /
    • 2007
  • Dynamic voltage scaling (DVS) is a well-known and effective power management technique. While there has been research on slack distribution, voltage allocation and other aspects of DVS, its effects on non-voltage-scalable devices has hardly been considered. A DC-DC converter plays an important role in voltage generation and regulation in most embedded systems, and is an essential component in DVS-enabled systems that scale supply voltage dynamically. We introduce a power consumption model of DC-DC converters and analyze the energy consumption of the system including the DC-DC converter. We propose an energy-optimal off-line DVS scheduling algorithm for systems with DC-DC converters, and show experimentally that our algorithm outperforms existing DVS algorithms in terms of energy consumption.

A Distributed address allocation scheme based on three-dimensional coordinate for efficient routing in WBAN (WBAN 환경에서 효율적인 라우팅을 위한 3차원 좌표 주소할당 기법의 적용)

  • Lee, Jun-Hyuk
    • Journal of Digital Contents Society
    • /
    • v.15 no.6
    • /
    • pp.663-673
    • /
    • 2014
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment