• Title/Summary/Keyword: Bit Allocation

Search Result 275, Processing Time 0.022 seconds

A Block Adaptive Bit Allocation for Progressive Transmission of Mean Difference Pyramid Image (Mean difference pyramid 영상의 점진적 전송을 위한 블록 적응 비트 배정)

  • 김종훈;신재범;심영석
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.4
    • /
    • pp.130-137
    • /
    • 1993
  • In this paper, A progressive coding of mean difference pyramid by Hadamard transform of the difference between two successive pyramid levels has been studied. A block adaptive bit allocation method based on ac energy of each sub-block has been proposed, which efficiently reduces the final distortion in the progressive transmission of image parameters. In our scheme, the dc energy equals the sum of the quantization errors of the Hadamard transform coefficients at previous level. Therefore proposed allocation method includes the estimation of dc energy at each pyramid level. Computer simulation results show some improvements in terms of MSE and picture quality over the conventional fixed allocation scheme.

  • PDF

Optimal Configuration of SVC for Satellite Broadcasting Service with Ku/Ka Bands

  • Luong, Ngoc Thuy Dung;Sohn, Won
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.11a
    • /
    • pp.188-191
    • /
    • 2010
  • The study investigated the optimal configuration of SVC (Scalable Video Coding) to apply to the satellite broadcasting service, and compared the performance of the SVC with that of the AVC (Advanced Video Coding). To get the optimal configuration, we analyzed the optimal bit rate allocation between the layers and the optimal scalability which requires the least bit rate for the required PSNR for various kinds of contents using JSVM. As a result of investigation, we found that the optimal bit rate allocation occurs when the bit rate of the base layer is minimum, and the spatial scalability shows the best performance. The performance of SVC is similar to that of AVC for spatial scalability, but it depends on contents.

  • PDF

Optimum Bit Allocation for Lossless Laplacian Pyramid Coding (비 손실 라플라시안 피라미드 부호화의 최적 비트 배정)

  • 채종길
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.11
    • /
    • pp.1618-1625
    • /
    • 1993
  • In the transmission of image using the lossless Laplacian pyramid coding, the image quality of the last hierachy is almost same regardless of the bit rate of each hierachy. However, at the higher hierachy with low resolution, it is varied according to bit rate of each hierachy. In this paper, optimum bit allocation to achieve better image at the higher hierachy and minimize the distortion at the last hierachy was proposed. More efficient progressive transmission was shown to be possible by experimental results of higher PSNR and better image quality at the hierachy with low resolution.

  • PDF

Scence Change Adaptive Bit Rate Control Using Local Variance (국부 분산을 이용한 장면 전환 적응 비트율 제어)

  • 이호영;김기석;박영식;송근원;남재열;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.675-684
    • /
    • 1997
  • The bit rate control algorithm which is capable of handing scene change is proposed. In MPEG-2 TM5, block variance is used to measure block activity. But block variance is not consistent with human visual system and does not differenciate the distribution of pixel values within the block. In target bit allocation process of TM5, global complexity, obtained by results of previous coded pictures, is used. Since I pictures are spaced relatively far apart, their complexity estimate is not very accurate. In the proposed algorithm local variance is used to measure block activity and detect scene change. Local variance, using deviation from the mean of neighboring pixels, well represents the distribution of pixel values within the block. If scene change is detected, the local variance information is used for target bit allocation process. Allocating target bits for I picture, the average local variance difference between previous and current I picture is considered. The experimental results show that the proposed algorithm can detect scene change very precisely and gives better picture quality and higher PSNR values than MPEG-2 TM5.

  • PDF

RDO-based joint bit allocation for MPEG G-PCC

  • Ye, Xiangyu;Cui, Li;Chang, Eun-Young;Cha, Jihun;Ahn, Jae Young;Jang, Euee S.
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2021.06a
    • /
    • pp.81-84
    • /
    • 2021
  • In this paper, a rate-distortion optimization (RDO) model is proposed to find the joint bit allocation of geometry data and color data based on geometry-based point cloud compression (G-PCC) of Moving Picture Experts Group (MPEG). The mechanism of the method is to construct the RD models for geometry and color data through the training process. Afterward, two rate-distortion (RD) models are integrated as well as the decision of the parameter λ to obtain the final RDO model. The experimental results show that the proposed method can decrease 20% of the geometry Bjøntegaard delta bit rate and increase 37% of the color Bjøntegaard delta bit rate compared to the MPEG G-PCC TMC13v12.0 software.

  • PDF

The Optimal Subchannel and Bit Allocation for Multiuser OFDM System: A Dual-Decomposition Approach (다중 사용자 OFDM 시스템의 최적 부채널 및 비트 할당: Dual-Decomposition 방법)

  • Park, Tae-Hyung;Im, Sung-Bin;Seo, Man-Jung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.90-97
    • /
    • 2009
  • 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 propose an 0-1 integer programming model formulating the optimal subchannel and bit allocation problem of the multiuser OFDM. We employ a dual-decomposition method that provides a tight linear programming (LP) relaxation bound. Simulation results are provided to show the effectiveness of the 0-1 integer programming model. MATLAB simulation on a system employing M-ary quardarature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multi-paths are carried with the optimal subchannel and bit allocation solution generated by 0-1 integer programming model.

A New Resource Allocation Algorithm for Low Power Architecture (저 전력 아키텍처 설계를 위한 새로운 자원할당 알고리즘)

  • 신무경;인치호
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.329-332
    • /
    • 2000
  • This paper proposed resource allocation algorithm for the minimum power consumption of functional unit in high level synthesis process as like DSP which is circuit to give many functional unit. In this paper, the proposed method though high level simulation find switching activity in circuit each functional unit exchange for binary sequence length and value bit are logic one value. To used the switching activity find the allocation with minimal power consumption, the proposed method visits all control steps one by one and determines the allocation with minimal power consumption at each control step.

  • PDF

Performance Evaluation of Cache Coherence Scheme for Data Allocation Methods (데이타 배치 방식에 따른 캐쉬 일관성 유지 기법의 성능 평가)

  • Lee, Dong-Kwang;Kweon, Hyek-Seong;Ahn, Byoung-Chul
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.6
    • /
    • pp.592-598
    • /
    • 2000
  • The locality of data references at the distributed shared memory systems affects the performance significantly. Data allocation methods by considering the locality of data references can improve the performance of DSM systems. This paper evaluates the performance for the dynamic limited directory scheme which data allocation methods can apply very effectively. The information of the data allocation is used by the dynamic limited directory scheme to set the presence bit effectively. And the proper use of the presence bit improves the performance by reducing memory overhead and using directory pool efficiently. Simulations are conducted using three application programs which have various data sharing. The results show that the optimal data allocation method improves the performance up to 3.6 times in the proposed scheme.

  • PDF

Approximate Minimum BER Power Allocation of MIMO Spatial Multiplexing Relay Systems (다중 안테나 공간 다중화 릴레이 시스템을 위한 근사 최소 비트 오율 전력 할당 방법)

  • Hwang, Kyu-Ho;Choi, Soo-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.337-344
    • /
    • 2011
  • In this paper, a multiple-input and multiple-output (MIMO) spatial multiplexing (SM) relay system is studied in a bit error rate (BER) sense, where every node is deployed with multiple antennas. In order to efficiently use the limited power resource, it is essential to optimally allocate the power to nodes and antennas. In this context, the power allocation (PA) algorithm based on minimum BER (MBER) for a MIMO SM relay system is proposed, which is derived by direct minimization of the average BER, and divided into inter-node and inter-antenna PA algorithm. The proposed scheme outperforms the conventional equal power allocation (EPA) algorithm without extra power consumption.

Power-Efficient Rate Allocation of Wireless Access Networks with Sleep-Operation Management for Multihoming Services

  • Lee, Joohyung;Yun, Seonghwa;Oh, Hyeontaek;Newaz, S.H. Shah;Choi, Seong Gon;Choi, Jun Kyun
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.619-628
    • /
    • 2016
  • This paper describes a theoretical framework for rate allocation to maximize the power efficiency of overall heterogeneous wireless networks whose users are assumed to have multihoming capabilities. Therefore, the paper first presents a power consumption model considering the circuit power and radio transmission power of each wireless network. Using this model, two novel power efficient rate allocation schemes (PERAS) for multihoming services are proposed. In this paper, the convex optimization problem for maximizing the power efficiency over wireless networks is formulated and solved while guaranteeing the required quality of service (QoS). Here, both constant bit rate and variable bit rate services are considered. Furthermore, we extend our theoretical framework by considering the sleep-operation management of wireless networks. The performance results obtained from numerical analysis reveal that the two proposed schemes offer superior performance over the existing rate allocation schemes for multihoming services and guarantee the required QoS.