• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.938-946
• /
• 1996

Hierarchical subband codec has been widely promoted in the field of data compression/decompression because of their simplicity and modular nature. Over the past years, the study has received great attention to the perfect reconstruction (PR)system which perfectly recovers the original input signal at the reconstructed output. However, in the actual subband codec system, the signals that passed through the analysis filter bank are quantized before transmission to the receiver side and reconstructed by the synthesis filter bank. Thus the PR system is impossible and the quantization effects must be carefully considered in the system design such that the system recovers the reconstructed output as possible to the the original input signal with minimum quantization error.In this paper, we propose an optimum hierarchical subband codec structure in the presence of quantizer. The optimality criteria of the code is given to the deign of the hierarchical analysis/synthesis subband filter bank and the quantizer that minimize then output mean square error due to the quantizer in the codec. Specific opti-mum design esamples are shown with level-1, level-2 hierarchical structure. The optimal designs are verified by computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1979-1985
• /
• 1999

In this paper, we offer an analysis method for SL/D/1/K queueing system, where the shifting-level (SL) process proposed in the part I of this study[1]. Since an exact analysis of SL/D/1/K queueing system is very difficult, we propose an approximation method, where the queze sizes at input state transition epochs is quantized and thus the name 'quantization reduction method'. We provide the upper and lower bounds of the approximation for the system size distribution also, In addition, since the continuos version of well-known DAR(1) model is a kind of SL process with exponential correlation term only, the proposed method can be directly applied to the analysis of DAR(1)/D/1/K queueing system as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.965-971
• /
• 2003

This paper suggests a low-complexity frame timing synchronization system for IEEE802.11a wireless LAN systems. The proposed timing synchronization scheme has been implemented by correlating the received OFDM preamble with quantized coefficients composed of ｛0, ${\pm}$2$^{0}$ , ${\pm}$2$^1$‥‥‥ ${\pm}$2$^{i}$ ), where i is an integer number. The 2$^{i}$ -valued coefficients enable the multipliers in the correlation system to be simplified to i-bit shifters. So we can design the correlation system using shifters instead of multipliers. We estimate the performance of the proposed scheme in comparison with conventional systems under the AWGN and Rayleigh fading channels. In this paper we show that the complexity can be reduced by 90% while still maintaining a performance comparable to that of the conventional system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2264-2275
• /
• 1994

In this paper, image compression based on neural networks is presented with block classification and coding. Multilayer neural networks with error back-propagation learning algorithm are used to transform the normalized image date into the compressed hidden values by reducing spatial redundancies. Image compression can basically be achieved with smaller number of hidden neurons than the numbers of input and output neurons. Additionally, the image blocks can be grouped for adaptive compression rates depending on the characteristics of the complexity of the blocks in accordance with the sensitivity of the human visual system(HVS). The quantized output of the hidden neuron can also be entropy coded for an efficient transmission. In computer simulation, this approach lie in the good performances even with images outside the training set and about 25:1 compression rate was achieved using the entropy coding without much degradation of the reconstructed images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2175-2190
• /
• 2011

This paper presents the effects of depth map quantization for multiview intermediate image generation using depth image-based rendering (DIBR). DIBR synthesizes multiple virtual views of a 3D scene from a 2D image and its associated depth map. However, it needs precise depth information in order to generate reliable and accurate intermediate view images for use in multiview 3D display systems. Previous work has extensively studied the pre-processing of the depth map, but little is known about depth map quantization. In this paper, we conduct an experiment to estimate the depth map quantization that affords acceptable image quality to generate DIBR-based multiview intermediate images. The experiment uses computer-generated 3D scenes, in which the multiview images captured directly from the scene are compared to the multiview intermediate images constructed by DIBR with a number of quantized depth maps. The results showed that there was no significant effect on depth map quantization from 16-bit to 7-bit (and more specifically 96-scale) on DIBR. Hence, a depth map above 7-bit is needed to maintain sufficient image quality for a DIBR-based multiview 3D system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.1
• /
• pp.62-69
• /
• 2011

A novel QEGT codebook index searching algorithm for long tenn evolution (LTE) system is proposed. The proposed algorithm divides the Q precoding vectors into M groups, and selects the optimal precoding vector from the selected group at the receiver. This algorithm reduced the calculation for searching the optimal precoding vector index compared to the previous algorithms. The index searching algorithm is implemented for TI's TMS320C6713 DSP board. When the number of transmit antenna is 4, the number of clock cycles is reduced to 25%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

• 전자공학회논문지 IE
• /
• v.45 no.3
• /
• pp.42-49
• /
• 2008

This paper proposes a new beamforming algorithm to select beamforming gain or/and diversity gain in CDMA2000, W-CDMA, W-LAN channel according to signal environment on the multipath. In this paper, we present the criteria to obtain deversity gain at any point that based on quantized experimental value. Proposed method proposes represents a performance better than conventional algorithm adopting the largest two eigenvector when angle spread is exit. From the results of performance analysis through various simulation, it is confirmed that proposed method is far superior about $3{\sim}4$ times compare to conventional method in signal environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.100-109
• /
• 2003

A differential index assignment scheme is proposed for the image encoding system in which a variable-length tree-structured vector quantizer is adopted. Each source vector is quantized into a terminal node of VLTSVQ and each terminal node is represented as a unique binary vector. The proposed index assignment scheme utilizes the correlation between interblocks of the image to increase the compression ratio with the image quality maintained. Simulation results show that the proposed scheme achieves a much higher compression ratio than the conventional one does and that the amount of the bit rate reduction of the proposed scheme becomes large as the correlation of the image becomes large. The proposed encoding scheme can be effectively used to encode R images whose pixel values we, in general, highly correlated with those of the neighbor pixels.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.83-89
• /
• 2008

Simple but effective fast codebook searching algorithms for quantized EGT(equal gain transmission) are presented. Using newly defined metric, rough searching selects a few candidate weight vectors. Using the conventional metric, accurate searching determines the optimal vector among the candidates. This strategy reduces the entire searching time. When the number of transmit antenna is two or three, the searching time reduces more than a half less than the conventional searching time. Moreover, the more the size of codebook increases, the more the searching time reduction also increases.