• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1028-1036
• /
• 2000

In this paper, an error-resilient image compression technique using wavelet transform is proposed. The zerotree technique that uses properties of statistics, energy and directions of wavelet coefficients in the space-frequency domain shows effective compression results. Since it is highly sensitive to the propagation of channel errors, evena single bit error degrades the whole image quality severely. In the proposed algorithm, the image is encoded by the SPIHT(Set Partitioning in Hierarchical Trees) algorithm using the zerotree coding technique. Encoded bitstreams are partitioned into some blocks using the subband correlations and then fixed-length blocks are made by using the effective bit reorganization algorithm. finally, an effective bit allocation technique is used to limit error propagation in each block. Therefore, in low BER the proposed algorithm shows similar compression performance to the zerotree compression technique and in high BER it shows better performance in terms of PSNR than the conventional methods.

• Journal of the Korean earth science society
• /
• v.40 no.6
• /
• pp.561-571
• /
• 2019

To understand the genesis of tropical cyclones (TC), we computed TC genesis probability (GPr) by partitioning a highly localized genesis frequency (GFq) into nearby grid boxes in proportion to the spatial coherence of genesis potential index (GPI). From the analysis of TCs simulated by the Seoul National University Atmosphere Model Version 0 and the observed TCs, it was shown that GPr reasonably converges to GFq when averaged over a long-term period in a decent grid size, supporting its validity as a proxy representing a true TC GPr. The composite anomalies of the gridded GPr in association with the Asia summer monsoon, El Nino-Southern Oscillation (ENSO), and the Madden-Julian Oscillation (MJO) are much less noisy than those of GFq, and consequently are better interpretable. In summary, GPr converges to GFq, varies more smoothly than GFq, represents the spatiotemporal variations of GFq better than GPI, and depicts GFq with greater spatial details than other spatially smoothed GFqs.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.1-11
• /
• 1999

This paper introduces orthogonally multiplexed modulation and demodulation methods based on Wavelet Packet Bases and particularly describes Wavelet Packet Modulation (WPM) techniques that provide the designer of transmission signal set in time-frequency domain with tree structural information which can be adapted to given channel characterristics. Multi-dimensional signaling methods are also contrasted to common and different characteristics of conventional QAM. multi-tone modulation methods. The paper addresses the mothod how to find a best tree structure that has more adaptivity to impulse and narrowband tone pulse noises using a tunning algorithm which arbitrarily partitions the time-frequency space and makes a suitable orthogonal signaling waveforms. Simulation results exhibits a favorable performance over existing mod/demod methods specially for narrowband tone pulse and impulse interferences.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.365-370
• /
• 2003

In this paper, a new watermarking algorithm that based on wavelet packet transform is proposed for remote sensing images, which include many high frequency components. It applies watermark to the overall subband that includes the lowest frequency band. Watermark is embedded on original image after selecting the significant wavelet packet coefficients. For selection of significant coefficients which watermarks is embedded on, zerotree algorithm is applied to wavelet packet coefficients using CPSO (Coefficient Partitioning Scanning Order). From the experimental result, the proposed algorithm shows better invisibility and robustness performance compare with conventional watermarking methods. Especially, it demonstrates better robustness for high image compression in the remote images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.2003-2012
• /
• 1996

The 16- and 32-state Trellis-coded M-ary 4-dimensional (4-D) orthogonal modulation scheme with a frequency-reuse technique have been investigated. Here, 5 coded bits form a rate 4/5 convolutional encoder provide 32 possible symbols. Then the signals are mapped by a M-ary 4-D orthogonal modulator, where each signal has equal energy and is PSK modulated. In the M-ary 4-D modulator, we have employed the vectors which is derived by the optimization technique of signal waveforms in a 4-D sphere. This technique is usedin maximizing the minimum Euclidean distance between a set of signal poits on a multidimensional sphere. By combinig trellis coding with M-ary 4-D modulation and proper set-partitioning, we have obtained a considerable impeovement in the free minimum distance of the system over an AWGN channel. The 16-state scheme obtains coding gains up to 5.5 dB over the uncoded two-independent QPSK scheme and 2.5 dB over the two-independent 2-D TCM scheme. And, the 32-state scheme obtains coding gains up to 6.4 dB over the uncoded two-independent QPSK schemeand 3.4 dB over the two-independent 2-D TCM scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.1
• /
• pp.112-119
• /
• 2002

We propose an enhanced wavelet packet image coder algorithm which is based on the coefficients partition. The proposed wavelet packet image coder uses the first-order entropy to reduce the total compression time, and achieves low bit rates and rate-distortion performance by the zero-tree based coding using correlations between coefficients partition. This new algorithm represents new parent-children relationships for reducing image reconstruction error using the correlations between each frequency subbands and then the wavelet packet coefficients are Partitioned by a new order. The computer simulations demonstrate higher PSNR under the same bit rate and improved image compression time and enhanced rate control compare with conventional algorithms. From the simulation results, it is shown that the encoding and decoding process of proposed coder are much simple and accurate than present method against texture images , which include many mid-frequency elements.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.68-77
• /
• 2006

In accommodating the asymmetric traffic for future wireless multimedia services, the dynamic time division duplexing (D-TDD) scheme is considered as one of the key solutions. With the D-TDD mode, however, the inter-BS and inter-MS interference is inevitable during the cross time slot (CTS) period, and this interference seriously degrades the system performance. To mitigate such interference, we propose a region and time partitioning D-TDD architecture for OFDM systems. Each time slot in the CTS period is split into several minislots, and then each cell is divided into as many regions as the number of minislots per time slot. We then assign the minislots only to the users in its predefined corresponding region. On top of such architecture which inherently separates the interfering entities farther from each other, we design a robust time slot allocation scheme so that the inter-cell interference can be minimized. By the computer simulation, it has been verified that the proposed scheme outperforms the conventional time slot allocation methods in both the outage probability and the bandwidth efficiency.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.12
• /
• pp.1792-1799
• /
• 1990

Two cases of block coded phase/frequncy modulations are investigated. minimum Euclidean distances are calculated as the function of modulation index h and rotation angle \ulcorner in the cases of 2-FSK/4-PSK and 2-FSK/8-PSK. Method of signal set partitioning is described, especially for the case of 2-FSK/8-PSK. The results are compared with S.I. Sayegh's work and shown better performance. For example, with simple parity check and repetition codes, we can get coding gain of 3 dB in the case of 2-FSK/4-PSK with block length n=4. We get 5.33 dB in the case of 2-FSK/8-PSK with n=4. And it is believed that we can get higher coding gain with proper combinations of block code and n-FSK/m-PSK type channel signal constellations.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.859-862
• /
• 2003

This paper proposes an emulation environment for SoC designs using small number of large gate-count FPGA's and a PC system. To overcome the pin limitation problem in partitioning the design when the design size overwhelms the FPGA gate count, we use bus splitter modules that replicate on-chip bus signals in one FPGA to arbitrary number of other FPGA's with minimal pin count. The proposed scheme is applied to the emulation of 2 million gate multimedia processing chip using two Xilinx Viretex-2 6000 FPGA devices in 6.6MHz operating frequency. An ARM core, memories, camera and LCD display are modeled in software using dual 2GHz Pentium-III processors. This scheme can be utilized for more than 2 FPGA's in the same ways as two FPGA case without losing emulation speed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1716-1725
• /
• 1996

In this paper, the huffman decoder which is a part of the decoder in JPEG standard format is designed by using a new Ternary CAM. First, the 256 word * 16 bit-size new bit-word all parallel Ternary CAM system is designed and verified using SPICE and CADENCE Verilog-XL, and then the verified novel Ternary CAM is applied to the new huffman decoder architecture of JPEG. So the performnce of the designed CAM cell and it's block is verified. The new Ternary CAM has various applications because it has search data mask and storing data mask function, which enable bit-wise search and don't care state storing. When the CAM is used for huffman look-up table in huffman decoder, the CAM is partitioned according to the decoding symbol frequency. The scheme of partitioning CAM for huffman table overcomes the drawbacks of all-parallel CAM with much power and load. So operation speed and power consumption are improved.