• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.892-904
• /
• 2008

As a video encoding in resource constrained environments such as sensor networks has become an important issue, DVC(Distributed Video Coding) has been intensively investigated as a solution for light weighted video encoding problem. Known as one of the representative schemes of DVC, the Wyner-Ziv coding generates side information of current frame only at decoder, using correlation among frames, and reconstructs video through noise elimination on the side information using channel code. Accordingly, the better quality of side information brings less channel noise, thus attains better coding performance of the Wyner-Ziv coder. However, since it is hard for decoder to generate an accurate side information without any information of original frame, a method to successively improve side information using successively decoded original frame, based on decoding reliability, was previously developed. However, to improve side information from decoding results, not only an error rate of the decoding result as a reliability, but also the amount of reliable information from the decoding result is important. Therefore, we propose TDWZ(Transform-domain Wyner-Ziv coding) with successively improving side information based on decoding reliability considering not only an error rate but also the amount of reliable information of the decoding results. Our experiment shows the proposed method gains average PSNR up to 1.7 dB over the previous TDWZ, that is without successive side information improvement.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.117-125
• /
• 2014

In this paper, a novel hardware architecture of the LT codec is presented where non-BP based decoding algorithm is applied. Novel LT codec architecture is designed with an efficient degree distribution unit using Verilog HDL. To perform permutation operation, different initial valued or time shifted counters have been used to get pretty well permutations and an effect of randomness. The codec will take 128 bits as input and produce 256 encoded output bits. The simulation results show expected performances as the implemented distribution and the original distribution are pretty same. The proposed LT codec takes 257.5 cycle counts and $2.575{\mu}s$ for encoding and decoding instead of 5,204,861 minimum cycle counts and 4.43s of the design mentioned in the previous works where iterative soft BP decoding was used in ASIC and ASIP implementation of the LT codec.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.25 no.4
• /
• pp.32-48
• /
• 2022

This study presented a spatial data serialization technique that can efficiently store and transmit large amounts of spatial data for precision road maps was designed and implemented. For efficient serialization, a binary spatial data structure is defined, and a coordinate value encoding technique without loss of information is designed using the Zigzag-Z-order curve. The spatial data serialization technique designed for precision road maps was tested, and the data size and encoding/decoding speed after encoding were compared with Protocol buffer and Geobuff. As a result, it was confirmed that the designed serialization method was excellent in data weight reduction performance and encoding speed. However, the decoding speed was inferior to other serialization techniques in linestring and polygon type spatial data. Through this study, it was confirmed that spatial data can be efficiently encoded, stored, and transmitted using binary serialization techniques.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.585-592
• /
• 2009

This paper presents a method for decoding high minimal distance ($d_{min}$) short codes, termed Cortex codes. These codes are systematic block codes of rate 1/2 and can have higher$d_{min}$ than turbo codes. Despite this characteristic, these codes have been impossible to decode with good performance because, to reach high $d_{min}$, several encoding stages are connected through interleavers. This generates a large number of hidden variables and increases the complexity of the scheduling and initialization. However, the structure of the encoder is well suited for analog decoding. A proof-of-concept Cortex decoder for the (8, 4, 4) Hamming code is implemented in subthreshold 0.25-${\mu}m$ CMOS. It outperforms an equivalent LDPC-like decoder by 1 dB at BER=$10^{-5}$ and is 44 percent smaller and consumes 28 percent less energy per decoded bit.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.7
• /
• pp.93-100
• /
• 2019

In this paper, we propose an intelligent marketing service system that can provide custom advertisements and events to both businesses and customers by identifying the location and contents using the ultrasonic signals and feature information in voice signals. We also develop the encoding and decoding algorithm of ultrasonic signals for this system and analyze the performance evaluation results. With the development of the hyper-connected society, the on-line marketing has been activated and is growing in size. Existing store marketing applications have disadvantages that customers have to find out events or promotional materials that the headquarters or stores throughusing the corresponding applications whenever they visit them. To solve these problems, there are attempts to create intelligent marketing tools using GPS technology and voice recognition technology. However, this approach has difficulties in technology development due to accuracy of location and speed of comparison and retrieval of voice recognition technology, and marketing services for customer relation are also much simplified.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.687-695
• /
• 2003

In this paper, we present a document image compression system based on segmentation, Quincunx downsampling, (5/3) wavelet lifting and subband-oriented SPIHT coding. We reduced the coding time by the adaptation of subband-oriented SPIHT coding and Quincunx downsampling. And to increase compression rate further, we applied arithmetic coding to the bitstream of SPIHT coding output. Finally, we present the reconstructed images for visual comparison and also present the compression rates and PSNR values under various scalar quantization methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6017-6037
• /
• 2017

In a multi-resolution image encoding system, the image is encoded into a single file as a layer of bit streams, and then it is transmitted layer by layer progressively to reduce the transmission time across a low bandwidth connection. This encoding scheme is also suitable for multiple decoders, each with different capabilities ranging from a handheld device to a PC. In our previous work, we proposed an edge adaptive hierarchical interpolation algorithm for multi-resolution image coding system. In this paper, we enhanced its compression efficiency by adding three major components. First, its prediction accuracy is improved using context adaptive error modeling as a feedback. Second, the conditional probability of prediction errors is sharpened by removing the sign redundancy among local prediction errors by applying sign flipping. Third, the conditional probability is sharpened further by reducing the number of distinct error symbols using error remapping function. Experimental results on benchmark data sets reveal that the enhanced algorithm achieves a better compression bit rate than our previous algorithm and other algorithms. It is shown that compression bit rate is much better for images that are rich in directional edges and textures. The enhanced algorithm also shows better rate-distortion performance and visual quality at the intermediate stages of progressive image transmission.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.7
• /
• pp.468-474
• /
• 2005

Brain-machine interface (BMI) based on neuronal spike trains is regarded as one of the most promising means to restore basic body functions of severely paralyzed patients. The spike train decoding algorithm, which extracts underlying information of neuronal signals, is essential for the BMI. Previous studies report that a linear filter is effective for this purpose and there is no noteworthy gain from the use of nonlinear mapping algorithms, in spite of the fact that neuronal encoding process is obviously nonlinear. We designed several decoding algorithms based on the linear filter, and two nonlinear mapping algorithms using multilayer perceptron (MLP) and support vector machine regression (SVR), and show that the nonlinear algorithms are superior in general. The MLP often showed unsatisfactory performance especially when it is carelessly trained. The nonlinear SVR showed the highest performance. This may be due to the superiority of the SVR in training and generalization. The advantage of using nonlinear algorithms were more profound for the cases when there are false-positive/negative errors in spike trains.

• Proceedings of the KIEE Conference
• /
• 1999.11d
• /
• pp.1128-1130
• /
• 1999

Optical encoding method of images using random-phase encoding in both input and Fourier Planes was proposed by Javidi and his group, and the method was realized experimentally by Singh and his group with use of a photorefractive crystal and a phase conjugate wave.[1-2] Recently various techniques have been proposed theorically and experimentally. These include the method using one random-phase mask in the Fourier plane or two random-phase masks in the input and the Fresnel planes.[3] We demonstrate the difference and the problem of the methods using one or two random-phase masks in the Fourier or Fresnel plane. We perform the encoding and decoding in $LiNbO_3$ crystal using degenerate four-wave mixing.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.3
• /
• pp.237-244
• /
• 2002

In this paper we mention the optimization of MPEG-4 VM (Moving Picture Expert Group-4 Verification Model) GA (General Audio) AAC (Advanced Audio Coding) encoder and the design of the decoder for PDA (Personal Digital Assistant) using MPEG-4 VM source. We profiled the VMC source and several optimization methods have applied to those selected functions from the profiling. Intel Pentium III 600 MHz PC, which uses windows 98 as OS, takes about 20 times of encoding time compared to input sample running time, with additional options, and about 10 times without any option. Decoding time on PDA was over 35 seconds for the 17 seconds input sample. After optimization, the encoding time has reduced to 50% and the real time decoding has achieved on PDA.