• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.293-298
• /
• 2003

In this paper. we propose a fast search algorithm for nearest neighbor vector quantization (NNVQ). The proposed algorithm rejects those codewords which can not be the nearest codeword and reduces the search range of codebook. Hence it reduces computational time and complexity in encoding process, while it provides the same SD performance as the conventional full search algorithm. We apply the proposed algorithm to the adaptive multi-rate (AMR) speech coder and a general vector quantizer designed by LBG. algorithm. Simulation results show effectiveness of the proposed algorithm.

• 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 the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.32-39
• /
• 2002

Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.

• Journal of Advanced Navigation Technology
• /
• v.12 no.6
• /
• pp.634-639
• /
• 2008

In mobile communication networks, the main power consumption is due to the actual transmissions power. Therefore, power efficiency network structures have gained considerable importance in mobile multi-hop systems and networks in recent years. In this paper, the performance of mobile multi-hop wireless system with M-QAM signal and forward error control (FEC) technique are analyzed The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the communication node. The probability of receiving a correct bit and codeword for relaying a data frame over h hop relay station to the final station is evaluated as a function of channel parameter and number of hops, and the distance between the different station.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.31-41
• /
• 2000

It has been known that the optical code division multiple access (OCDMA) is a prominent future technology to support many simultaneous users and to increase transmission capacity of optical fiber. In this paper, we proposed the new construction of 2 dimensional code, which can be used as a codeword in temporal/wavelength OCDMA networks. New code family is obtained by extending the concept of Hamming correlation. All optical encoder and decoder for newly proposed code were also developed. In considering bit error ratio, we verified that new coding scheme outperforms conventional coding scheme by simulation. This system is applicable to asynchronous fast local area network, which needs a high security level and a flexible network configuration.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.683-690
• /
• 2008

By using inherent stopping criteria of LDPC codes, the average number of iterations can be substantially reduced at high signal to noise ratio (SNR). However, we encounter a problem when hybrid automatic repeat request (H-ARQ) systems are applied. Frequent failures of decoding at low SNR region imply that the decoder leaches the maximum number of iterations frequently and thus the decoding complexity increases. In this paper, we propose a combination of stopping criteria using the syndrome weight of tentative codeword. By numerical analysis, it is shown that the decoding complexity of given H-ARQ system is reduced by 70-80% with the proposed algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.3
• /
• pp.289-293
• /
• 2013

In the noncoherent methods for UWB-IR (ultra-wideband impulse radio), block coded modulation (BCM) is better than the transmitted reference (TR) systems in terms of the energy efficiency and data rate. However, even BCM suffers from the performance degradation in the presence of strong inter-frame interference and inter symbol interference. We propose the transmitted reference based on the BCM (TR-BCM) which is the hybrid system of TR and BCM. Performance evaluation shows that the performance of TR-BCM is better than that of BCM in the high SNR range.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1244-1251
• /
• 2004

In this paper, we propose an efficient dynamic coding scheme by using multiple code words in H.264/A VC entropy coding. The exponential Golomb (Exp-Golomb) code words used in H 264/A VC do not reflect enough the symbol distributions of the combined syntax element in [7] due to their static probability distribution characteristics However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax clement according to given image sequences. Simulation results show that our proposed scheme outperforms the existing [7] me in compression efficiency without loss of quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.386-393
• /
• 2010

In this paper, we analyse HARQ scheme that utilizes symbol mapping diversity (SMD) techniques such as MDSM and CORE. The exploitation feasibility of MDSM and CORE is evaluated in the perspective of system complexity and storage capacity as we consider a BICM system based on 3GPP LTE standards and multipath fading channels. Also, a simple method which obtains SMD effects by circularly shifting bit-block in a codeword is proposed. The experimental results performed in BICM-OFDM systems with single antenna as well as multiple antennas show that frame error rate of the proposed method is close to that of CORE while having lower complexity.

• Journal of KIISE:Software and Applications
• /
• v.28 no.4
• /
• pp.369-379
• /
• 2001

본 논문은 부영역 분할과 코드워드 인텍스의 캐시 개념을 이용하여 벡터 양자화를 위한 고속코드북 생성 및 부호화 방법을 제안한다. 제안한 방법은 인접한 입력 벡터는 대개 코드북내 특정 코드워드에 의해 나타내어지는 국부성에 바탕을 두고 있다. 초기에 모든 학습 벡터가 거리에 기반한 근접성을 이용하여 정해진 수의 부영역으로 분할된다. 각 부영역에 하나의 코드워드 인덱스 캐시가 할당되는데 이 캐시는 학습 초기에는 전체 코드북 크기에 대응하는 코드워드 인덱스를 갖는다. 학습이 진행되면서 입력 벡터가 갖는 국부성 때문에 각 부영역내 캐시중 사용되지 않는 코드워드 인덱스가 점차 발생하게 되므로 이들은 LRU(Least Recently Used) 삭제 알고리즘에 의해 제거된다. 학습이 진행됨에 따라 부영역 캐시에는 주어진 입력 벡터에 의해 참조되는 코드워드 인덱스만이 남게 되므로 한 학습 주기 동한 필요한 학습 시간이 점차 짧아지게 되어 전체적으로 코드북 생성 시간을 크게 줄일 수 있게 된다. 제안한 방법은 매 학습주기마다, 코드워드 인덱스 삭제 후보 중 주어진 부영역 중심으로부터 거리에 의해 멀리 떨어진 것부터 반만을 제거함에 따라. 복원된 영상의 화질 열화가 거의 없다. 시뮬레이션 결과 제안한 방법은 기존의 LBG 방법에 비해 화질 열화는 거의 없지만 코드북 생성 (또는 부호화) 속도를 2.6-5.4배 (또는3.7-18.8배) 향상시킨다.