• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.557-560
• /
• 2014

In digital communications systems, an interleaver spreads burst errors occurred in channels and makes it random errors. As a result, the signals are rearranged and encrypted to the 3rd party. Deinterleaving this unknown interleaved signal is very important in electronic warfare and various researches on reconstruction of interleaved signal have been studied in the literature. Unlike previous researches which is mainly about helical scan interleaver or bit unit interleaver, in this paper, we estimate the symbol unit convolutional interleavr and shortened Reed-Solomon code parameters such as the number of stages of interleaver, a codeword length and a data symbol length and propose an specific algorithm to obtain the parameters from the unknown interleaved signal and simulate this algorithm as well.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.51-54
• /
• 2004

In this paper, we analyze the performance of LDPC decoder for DVB-S2 system. The performance analysis is performed by computer simulations based on AWGN channel and high order modulation technique including 16APSK and 32APSK. For normal frame codeword length N = 64800, the performance of LDPC decoder is only away 0.7dB to 1dB from Shannon limit with respect to each modulation. The constructions and encoding process of LDPC codes which are used for DVB-S2 system are also presented and described.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.1E
• /
• pp.35-40
• /
• 1997

The LZW algorithm has some redundancies for voice traffic. Thus, the V-LZW(Voice LZW) algorithm that decreases the redundancies of the LZW algorithm is suggested for efficent compression of voice. The V-LZW algorithm uses the differential method that reduces the codeword size as well as the length of repeated string. According to the simulation results, it could be seen teat the performance of V-LZW algorithm is better by 35% to 44% in voice compression ratio than that of the conventional modified LZW algorithm. Compared with conventional 32 kbps ADPCM coding with 26 dB SNR, V-LZW has 21 kbps transmission rate, no additional quantization error and simple hardware complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.56-68
• /
• 2002

The Universal Variable Length Coding(UVLC) scheme in H.26L has nice features such as error resiliency and two-way decodability. However, it has lower coding efficiency than the conventional Huffman coding. To improve the coding efficiency of UVLC, we Propose to use a dynamic codeword mapping that changes association between symbols and codewords in order to utilize the statistical characteristics of symbols as much as possible but without losing any features of the UVLC. Both encoder and decoder use the same re-association table, and hence the encoder need not send additional overhead for the re-mapping relationship to the decoder. Simulation results show that without significant change of the current H.26L coding scheme, the proposed method additionally attains up to about 8% and about 5% bit reductions respectively in intra and inter frames over the current H.26L encoding method.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.413-421
• /
• 2005

As the population of HDTV is growing, among many useful features of modern set top boxes (STBs) or digital video recorders (DVRs), video browsing, visual bookmark, and picture-in-picture capabilities are very frequently required. These features typically employ reduced-size versions of video frames, or thumbnail images. Most thumbnail generation approaches generate DC images directly from a compressed video stream. A discrete cosine transform (DCT) coefficient for which the frequency is zero in both dimensions in a compressed block is called a DC coefficient and is simply used to construct a DC image. If a block has been encoded with field DCT, a few AC coefficients are needed to generate the DC image in addition to a DC coefficient. However, the bit length of a codeword coded with variable length coding (VLC) cannot be determined until the previous VLC codeword has been decoded, thus it is required that all codewords should be fully decoded regardless of their necessary for DC image generation. In this paper, we propose a method especially for fast DC image generation from an I-frame using multiple-symbol lookup table (mLUT). The experimental results show that the method using the mLUT improves the performance greatly by reducing LUT count by 50$\%$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3A
• /
• pp.157-162
• /
• 2012

In this paper, we propose a new intra mode coding method using the candidate mode table. In the conventional HEVC, if the predicted most probable mode (MPM) is not same with the current prediction mode, the current prediction mode is encoded using the fixed length code (FLC). However, since a large number of modes are used in HEVC, the codeword length of FLC gets longer. In this paper, we generate the candidate mode table from neighboring blocks and encode the obtained intra mode index using Golomb-Rice code instead of FLC, when the predicted MPM is not identical to the current mode. From the experiment, we verified that the proposed method reduces the BD-rate by 0.5% on average, compared to the HEVC intra mode coding method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.269-275
• /
• 2005

In this paper, we propose a new efficient motion vector coding algorithm for the video sequence with slow motion. In the proposed algorithm, the amount of motion for a given video sequence is determined by a Skip_rate parameter. The motion difference for slow motion is encoded with a combined codeword which is generated from the conventional codewords. The simulation results show that the proposed algorithm achieves approximately $15\%$ bits gain compared to the conventional methods. Moreover, additional memory and calculations for statistical observation are not required in the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.64-68
• /
• 2005

Reed-Solomon code is one of the most versatile channel codes. The encoder can be implemented with two famous structures: ordinary and bit-serial. The ordinary encoder is generally known to be complex and fast, while the bit-serial encoder is simple and not so fast. However, it may not be true for a longer codeword length at least in VHDL implementation. In this letter, it is shown that, when the encoder is implemented with VHDL, the number of logic gates of the bit-serial encoder might be larger than that of the ordinary encoder if the dual basis conversion table has to be used. It is also shown that the encoding speeds of the two VHDL implemented encoders are exactly same.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.107-113
• /
• 2017

This paper provides a new approach for modeling of vector quantizer(VQ) followed by analysis and design of subband codecs with imbedded VQ's. We compute the mean squared reconstruction error(MSE) which depend on N the number of entries in each codebook, k the length of each codeword, and on the filter bank(FB) coefficients in subband codecs. We show that the optimum M-band filter bank structure in presence of pdf-optimized vector quantizer can be designed by a suitable choice of equivalent scalar quantizer parameters. Specific design examples have been developed for two different classes of filter banks, paraunitary and the biorthogonal FB and the 2 channel case. These theoretical results are confirmed by Monte Carlo simulation.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2004

In this paper, we investigate the properties and performance of space-time bit-interleaved coded modulation (STBICM) systems in fast Rayleigh fading channels. We first show that ST-BICM with QPSK signaling in fast fading channels possesses the uniform distance property, which makes performance analysis tractable. We also derive the probability distribution of the squared Euclidean distance between space-time symbols assuming uniform bit-interleaving. Based on the distribution, we show that the diversity order for each codeword pair becomes maximized as the frame length becomes sufficiently long. This maximum diversity order property implies that the bit-interleaver transforms an ST-BICM system over transmit diversity channels into an equivalent coded BPSK system over independent fading channels. We analyze the performance of ST-BICM in fast fading channels by deriving an FER upper bound. The derived bound turns out very accurate, requiring only the distance spectrum of the binary channel codes of ST-BICM. Numerical results demonstrate that the bound is tight enough to render an accurate estimate of performance of ST-BICM systems.