• Title/Summary/Keyword: CODEBOOK

Search Result 346, Processing Time 0.023 seconds

Improved Excitation Coding for 13 kbps Variable Rate QCELP Coder

  • Kang, Sangwon;Lee, Dong-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.3E
    • /
    • pp.3-6
    • /
    • 1997
  • This paper reports on the optimal design of the excitation codebook in the 13 kbps variable rate QCELP coder of Korean speech. We present two optimal excitation codebooks which consist of 128 and 556 samples, respectively. For the design and test of the improved codebook, a data base of Korean speech is used. A quasi-Newton optimization algorithm was developed to design the codebook. The optimized codebook which remains sparse, can produce an average gain of 0.84 and 0.45 dB in SNR and SEGSNR respectively. Informal listening tests confirm the improvement in speech quality.

  • PDF

On a Reduction of Codebook Searching Time by using RPE Searching Tchnique in the CELP Vocoder (RPE 검색을 이용한 CELP 보코더의 불규칙 코드북 검색)

  • 김대식
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1995.06a
    • /
    • pp.141-145
    • /
    • 1995
  • Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.

  • PDF

Vector Quantization by N-ary Search of a Codebook (코우드북의 절충탐색에 의한 벡터양자화)

  • Lee, Chang-Young
    • Speech Sciences
    • /
    • v.8 no.3
    • /
    • pp.143-148
    • /
    • 2001
  • We propose a new scheme for VQ codebook search. The procedure is in between the binary-tree-search and full-search and thus might be called N-ary search of a codebook. Through the experiment performed on 7200 frames spoken by 25 speakers, we confirmed that the best codewords as good as by the full-search were obtained at moderate time consumption comparable to the binary-tree-search. In application to speech recognition by HMM/VQ with Bakis model, where appearance of a specific codeword is essential in the parameter training phase, the method proposed here is expected to provide an efficient training procedure.

  • PDF

Optimum Beamforming Vector Indexing Scheme for Codebook based MISO System over Feedback Error Channel (피드백 오류 채널에서 코드북 기반 MISO 시스템의 최적에 빔포밍 벡터 인덱싱 기법)

  • Lee, Jin-Hee;Ko, Young-Chai
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12A
    • /
    • pp.991-997
    • /
    • 2009
  • Transmit beamforming is simple method to achieve the full diversity gain that is available in multiple antenna(MIMO) wireless systems. Unfortunately, the prior condition to achieve this gain requires perfect channel knowledge at both transmitter and receiver, which is impractical on account of limited feedback link. Therefore, for the practical system, codebook based feedback scheme is often employed, where the beamforming vector is selected from the codebook to maximize the output signal-to-noise ratio (SNR) at receiver, and the receiver only sends back the index of the best beamforming vector to the transmitter. In this paper we derive analytical expression of average bit error rate (BER) for the codebook based transmit beamforming MISO system over the feedback error channel. Using this analytical result, we present optimum codebook indexing scheme to improve the performance of this system. From some selected numerical examples we show that our proposed codebook indexing scheme can provide nonnegligible performance improvements in terms of average BER over the severe feedback error channel.

A Novel Dual-Layer Differential Equal Gain Transmission Technique Using M-PSK Constellations (M-PSK 성운을 이용한 새로운 이중계층 차분 동 이득 전송 기술)

  • Kim, Young-Ju;Seo, Chang-Won
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.26 no.7
    • /
    • pp.627-635
    • /
    • 2015
  • We propose a dual-layer differential equal-gain codebook design methodology for LTE-Advanced(LTE-A), IEEE802.ac, and radar system having multiple transmit and receive antennas, and make computer simulations to evaluate its link-level performaces. M-ary phase shift keying constellation is used as its codeword elements to utilize low-cost power amplifiers at mobile stations. Especially, the proposed codebook can meet radar systems requirement for the high-powered equal-gain transmission property. Due to the temporal correlation of the adjacent channel, the proposed differential codebook can quantize only the differential information of the channel instead of the whole channel subspace, which virtually increase the codebook size to realize more accurate quantization of the channel. The proposed codebook has the same properties of LTE codebook that is, constant modulus, complexity reduction, and nested property. Computer simulations show that the proposed codebook performs better than the conventional 8-ary codebooks with the same amount of feedback information.

Codebook-Based Foreground-Background Segmentation with Background Model Updating (배경 모델 갱신을 통한 코드북 기반의 전배경 분할)

  • Jung, Jae-young
    • Journal of Digital Contents Society
    • /
    • v.17 no.5
    • /
    • pp.375-381
    • /
    • 2016
  • Recently, a foreground-background segmentation using codebook model has been researched actively. The codebook is created one for each pixel in the image. The codewords are vector-quantized representative values of same positional training samples from the input image sequences. The training is necessary for a long time in the most of codebook-based algorithms. In this paper, the initial codebook model is generated simply using median operation with several image frames. The initial codebook is updated to adapt the dynamic changes of backgrounds based on the frequencies of codewords that matched to input pixel during the detection process. We implemented the proposed algorithm in the environment of visual c++ with opencv 3.0, and tested to some of the public video sequences from PETS2009. The test sequences contain the various scenarios including quasi-periodic motion images, loitering objects in the local area for a short time, etc. The experimental results show that the proposed algorithm has good performance compared to the GMM algorithm and standard codebook algorithm.

Complexity-Reduction Algorithm of Speech Coder (QCELP) for CDMA Digital Cellular System (CDMA 디지틀 셀룰라용 음성 부호화기 (QCELP) 의 복잡도 감소 알고리즘)

  • 이인성
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.3
    • /
    • pp.126-132
    • /
    • 1996
  • In this paper, the complexity reduction method for QCELP speech coder (IS-96) without any perfomrance degradation is proposed for the vecoder of CDMA digital cellular system. The energy terms in pitch parameter search and codebook search routines that require large computations are calculated recursively by utilizing the overlapped structure of code vectors in adaptive codebook and excitation codebook. The additional complexity reduction in the codebook search routine can be achieved by using a simple form in calculation of the energy term when the initial codebook value is zero. In the case of lower transmission rates such as 4,2,1 kbps, the complexity reduction by recursive calulations of energy term is increased.

  • PDF

Initial Codebook Design by Modified splitting Method (수정된 미소분리 방법에 의한 초기 부호책 설계)

  • 조제황
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.1
    • /
    • pp.69-72
    • /
    • 2002
  • We propose a modified splitting method to obtain an initial codebook, which is used to design a codebook. The principle of the proposed method is that the more representative vectors are assigned to the class, which has the mere member training vectors or a lower squared error. The conventional K-means algorithm and the method provided from reference (5) are used to estimate the performance of the designed codebook. In thin work, the proposed method shows better results than the conventional splitting method in all experiments.

IMAGE COMPRESSION USING VECTOR QUANTIZATION

  • Pantsaena, Nopprat;Sangworasil, M.;Nantajiwakornchai, C.;Phanprasit, T.
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.979-982
    • /
    • 2002
  • Compressing image data by using Vector Quantization (VQ)[1]-[3]will compare Training Vectors with Codebook. The result is an index of position with minimum distortion. The implementing Random Codebook will reduce the image quality. This research presents the Splitting solution [4],[5]to implement the Codebook, which improves the image quality[6]by the average Training Vectors, then splits the average result to Codebook that has minimum distortion. The result from this presentation will give the better quality of the image than using Random Codebook.

  • PDF

A Study on the performance improvement of the CELP coder by the structure of dual codebook (2중 코드북 구조를 통한 CELP 음성부호화기의 성능 향상에 관한 연구)

  • 김종우;김응곤;한승조
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.271-273
    • /
    • 1999
  • 본 논문에서는 CELP 부호화기의 계산량을 줄이면서도 고음질의 음성을 합성할 수 있는 코드북 구조를 제안한다. 제안한 코드북 구조는 불규칙 코드북과 희박 중첩형 코드북 두 개의 코드북의 합으로 여기 신호를 표현한다. codebook I에서 잔류신호와 오차가 적은 여기신호열을 구한 후, 이 여기신호열에 codebook II의 여기신호열을 합하여 최적의 여기신호열을 구한다. 또한 이로 인한 전송비트수의 증가를 막기위해 홀수 프레임에서는 두 개 코드북의 index를, 짝수 프레임에서는 codebook I의 여기신호열은 그대로 사용하고 codebook II에서만 검색하여 전송하는 방법을 사용하였다. 이러한 2중 코드북 구조는 두 개의 여신호열의 합으로 표현되고 각각의 서로 다른 코드북 이득을 사용하기 때문에 정확한 이득을 표현할 수 있어 기존의 개선 알고리듬보다 더 나은 음질을 제공할 수 있다. 검색시간이 빠르고, 본 코드북 구조를 갖는 4.8kbps CELP형 부호화기를 설계하여 컴퓨터 모의 실험한 결과, 같은 전송률을 갖는 DoD CELP 부호화기보다 segSNR가 0.53dB 더 높게 나타났다.

  • PDF