• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.372-375
• /
• 1999

This paper proposes a bit allocation algorithm using adaptive bandwidth for ADSL that uses the DMT technology. In certain cases for high attenuation loops the conventional algorithms are unable to assign data bits to the higher frequency tones, due to the power spectrum mask limitation recommended by ANSI Standard, even if the total power budget is not expended. In the proposed bit allocation algorithm, adjacent empty tones that would not be used merge into single tone, then additional bits is assigned to the merged empty tones. Because additional bits is allocated, most of the available power is used. The proposed algorithm show that total bit increase in about 2~9% bits more than about conventional "water-filling" and "bit removal" algorithms and that is able to use about 93% of the available budget Power

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.2
• /
• pp.1-8
• /
• 2004

In this paper, we proposed ARAHE(Adaptive Resource Allocation algorithm for HIPERLAN/2 with Error channel). It uses EIB(Error Indication Bits) for efficient resource allocation. We evaluate the performance of ARAHE by simulation and the result shows ARAHE has better performance than current method in the case of delay, utilization and TSR(Transmission Success Rate).

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.4
• /
• pp.195-201
• /
• 2023

The degree of contribution each sensor makes towards the total information gathered by all sensors is not uniform in spatially correlated sensor fields. Considering bit allocation problem in such a spatially correlated sensor field, the number of bits to be allocated to each sensor should be proportional to the degree of contribution the sensor makes. In this paper, we deploy Shapley value, a representative solution concept in cooperative game theory, and utilize it in order to quantify the degree of contribution each sensor makes. Shapley value is a system that determines the contribution of an individual player when two or more players work in collaboration with each other. To this end, we cast the bit allocation problem into a cooperative game called bit allocation game where sensors are regarded as the players, and a payoff function is given in the criteria of mutual information. We show that the Shapley value fairly quantifies an individual sensor's contribution to the total payoff achieved by all sensors following its desirable properties. By numerical experiments, we confirm that sensor that needs more bits to cover its area has larger Shapley value in spatially correlated sensor fields.

• Phonetics and Speech Sciences
• /
• v.1 no.4
• /
• pp.97-103
• /
• 2009

This paper describes a new algorithm for encoding spectral envelope in the time domain alias cancellation (TDAC) part of G.729.1. The spectral envelope and modified discrete cosine transform (MDCT) coefficients of the weighted code-excited linear predictive (CELP) coding error in lower-band and the higher-band input signal are encoded in the TDAC part. In order to reduce allocation bits for spectral envelope coding, a new algorithm using sub-band correlation between adjacent frames is proposed. In addition, to improve the quality of decoded signals, two bit allocation strategies using reduced bits from the proposed algorithm are proposed. The performance of the proposed algorithm is evaluated in terms of objective quality and bit reduction rates. Experimental results show that the proposed algorithm increases the quality of sounds significantly.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.31-36
• /
• 1997

Bit allocation is a critical problem in video encoding such as MPEG. To improve the quality of the reconstructed sequence for a given bit rate, the assigned target bits for a group of pictures (GOP) must be allocated to each picture efficiently. In this paper, we derive a target bit allocation algorithm for more efficient rate control, by assuming that the average rate-distortion curve for an input source is logarithmic. This target bit allocation is based on Shannon's rate-distortion theory, which deals with the minimization of source distortion subject to a channel rate constraint. Simulation results show that the proposed target bit allocation algorithm provides better performance than the one in MPEG-2 Test Model 5 (TM5).

• Journal of Broadcast Engineering
• /
• v.22 no.2
• /
• pp.193-206
• /
• 2017

In this paper, we propose a rate control method based on the $R-{\lambda}$ model that supports a parallel encoding structure in GOP levels or IDR period levels for 4K UHD input video in real-time. For this, a slice-level bit allocation method is proposed for parallel encoding instead of sequential encoding. When a rate control algorithm is applied in the GOP level or IDR period level parallelism, the information of how many bits are consumed cannot be shared among the frames belonging to a same frame level except the lowest frame level of the hierarchical B structure. Therefore, it is impossible to manage the bit budget with the existing bit allocation method. In order to solve this problem, we improve the bit allocation procedure of the conventional ones that allocate target bits sequentially according to the encoding order. That is, the proposed bit allocation strategy is to assign the target bits in GOPs first, then to distribute the assigned target bits from the lowest depth level to the highest depth level of the HEVC hierarchical B structure within each GOP. In addition, we proposed a processing method that is used to improve subjective image qualities by allocating the bits according to the coding complexities of the frames. Experimental results show that the proposed bit allocation method works well for frame-level parallel HEVC software encoders and it is confirmed that the performance of our rate controller can be improved with a more elaborate bit allocation strategy by using the preprocessing results.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.97-105
• /
• 1994

Transform image coding using DCT is proved to be efficient in the absence of channel error but its performance degrades rapidly over noisy channel. In this paper, in the case of appling bit selcetive error correction coding that protects some significant bits in a codeword, an efficient allocation method of imformation bits and additive redundancy bits used for quantization and error correction coding respectively under constant transmission bit rate is proposed, and its performance is analyzed. As a result, without increasing trasmission bit rate, PSNR can be improved up to 7~8 [dB] below bit error rate $10^2$ and the image without blocking effect caused by bit error resulted from channel noise can be recostructed.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.445-451
• /
• 2007

An adaptive modulation scheme is presented for multiuser orthogonal frequency-division multiplexing systems. The aim of the scheme is to minimize the total transmit power with a constraint on the transmission rate for users, assuming knowledge of the instantaneous channel gains for all users using a combined bit-loading and subcarrier allocation algorithm. The subcarrier allocation algorithm identifies the appropriate assignment of subcarriers to the users, while the bit-loading algorithm determines the number of bits given to each subcarrier. The proposed bit-loading algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic-geometric means inequality. This algorithm has a simple procedure and low computational complexity. A heuristic approach is also used for the subcarrier allocation algorithm, providing a trade-off between complexity and performance. Numerical results demonstrate that the proposed algorithms provide comparable performance with existing algorithms with low computational cost.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.221-224
• /
• 2001

A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.746-751
• /
• 2009

We propose a dynamic time allocation method in cooperative multiplexing with partial relaying system. This method uses a linear programming and considers protocol that is based on relaying of partial information bits followed by cooperative multiplexing. In this protocol, regardless of the location of relay, the allocation time for each transmission time slots are constant. Using a dynamic time allocation method with considering the location of relay, we can find optimal transmission time slots, and show that the system capacity is optimized.