• Title/Summary/Keyword: Random Codebook

Search Result 18, Processing Time 0.02 seconds

A CELP Speech Coder Using Dispersed-Pulse and Random Codebook (분산펄스와 랜덤 코드북을 이용한 CELP 음성 부호화기)

  • 황윤성;문인섭;이행우;김종교
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.115-118
    • /
    • 2001
  • This paper presents dispersed-pulse and random codebook for CELP coder. This coder operates on speech frames of 20ms and generates an excitation vector by convoluting dispersion vectors with signed pulses in an algebraic codevector. The improvement of pulse-based fixed codebook is performed at a low bit rate. A high performance fixed-codebook consists of a partial algebraic codebook and a random codebook in unvoiced and stationary noise regions. The proposed CELP coder is quantized with 4kb/s and is compared with G.729 (Bkb/s CS-ACELP). Subjective testing shows better quality than reference coders under some background noise conditions

  • PDF

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

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

Adaptive Opimization of MIMO Codebook to Channel Conditions for Split Linear Array (분할된 선형배열안테나를 위한 채널 환경에 적응하는 MIMO 코드북 최적화)

  • Mun, Cheol;Jung, Chang-Kyoo;Kwak, Yun-Sik
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.5
    • /
    • pp.736-741
    • /
    • 2009
  • In this paper, adaptive optimizations of precoder codebook to channel conditions is proposed for a multiuser multiple-input multiple-output (MIMO) system with split linear array and limited feedback. We propose adaptive method for constructing a precoder codebook by coloring the random vector quantization codebook at each link by using limited long-term feedback information on transmit correlation matrix of each link. It is shown that the proposed multiuser MIMO codebook design scheme outperforms existing multiuser MIMO codebook design schemes for various channel conditions in terms of the average sum throughput of multiuser MIMO systems using zero-forcing maximum eigenmode transmission and limited feedback.

  • PDF

A Study on the Pulse-Train Code Excited Linear Prediction Coder: PT-CELP (Pulse-Train code 여기 선형 예측 (PT-CELP) 부호화기에 관한 연구)

  • 김흥국
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1995.06a
    • /
    • pp.246-249
    • /
    • 1995
  • 4.16kbps의 전송률을 갖는 음성 부호화기 구조에 관하여 기술한다. 제안된 음성 부호화기는 개방 회로 피치 검출기와 이로부터 생성된 pulse train을 코드북으로 갖는 CELP 부호화기이다. Pulse-Train codebook은 분석 프레임별로 부호화 및 복호화 양단에서 생성되며 음성의 피치 및 포만트 정보를 내포하고 있다. 구현된 PT-CELP는 random codebook 방식의 CELP에 비해 적은 크기로 codebook을 만들 수 있으며 음성의 특징을 충분히 반영하므로 합성된 음성의 음질을 향상시킬 수 있다.

  • PDF

Parameter Design for COBF Based on Kappa-factor Channel Model (Kappa-factor 채널모델에 기반을 둔 최적의 코드북 기반 Opportunistic Beamformer 파라미터 디자인)

  • Kang, Ji-Won;Kwon, Dong-Seung;Lee, Chung-Yong;Hwang, Young-Soo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.20-25
    • /
    • 2008
  • Codebook-based opportunistic beamforming (COBF) technique provides a beam selection diversity to the conventional opportunistic beamforming. In this paper, we design the random matrix and codebook for the COBF technique based on a kappa-factor channel model. Applying the proposed design to the COBF, nearly optimal beams are generated. Therefore, the COBF shows an outstanding performance without regard to the channel correlation related to the kappa-factor.

Random beamforming applying codebook rotation (다중 코드북을 이용한 랜덤 빔 형성 기법)

  • Kang, Ji-Won;Yoo, Byung-Wook;Seo, Jeong-Tae;Lee, Chung-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.7
    • /
    • pp.1-5
    • /
    • 2009
  • Random beanforming exploits multiuser diversity gain in static channels. Since the gain is restricted by the user population, some extended works have been proposed. Among them, a codebook-based opportunistic beamforming technique forms multiple random beams with small pilots. The technique however has difficulty in designing beams flexibly by the channel statistics. In this paper, we propose a technique forming the multiple random beams by rotating codebooks. The proposed technique enables the flexible design of beams so that multiuser diversity and beam selection diversity are exploited simultaneously with small pilots robust to the channel statistics.

The Convergence Characteristics of The Time- Averaged Distortion in Vector Quantization: Part I. Theory Based on The Law of Large Numbers (벡터 양자화에서 시간 평균 왜곡치의 수렴 특성 I. 대수 법칙에 근거한 이론)

  • 김동식
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.7
    • /
    • pp.107-115
    • /
    • 1996
  • The average distortio of the vector quantizer is calcualted using a probability function F of the input source for a given codebook. But, since the input source is unknown in geneal, using the sample vectors that is realized from a random vector having probability function F, a time-average opeation is employed so as to obtain an approximation of the average distortion. In this case the size of the smple set should be large so that the sample vectors represent true F reliably. The theoretical inspection about the approximation, however, is not perfomed rigorously. Thus one might use the time-average distortion without any verification of the approximation. In this paper, the convergence characteristics of the time-average distortions are theoretically investigated when the size of sample vectors or the size of codebook gets large. It has been revealed that if codebook size is large enough, then small sample set is enough to obtain the average distortion by approximatio of the calculated tiem-averaged distortion. Experimental results on synthetic data, which are supporting the analysis, are also provided and discussed.

  • PDF

Improving Clustering-Based Background Modeling Techniques Using Markov Random Fields (클러스터링과 마르코프 랜덤 필드를 이용한 배경 모델링 기법 제안)

  • Hahn, Hee-Il;Park, Soo-Bin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.1
    • /
    • pp.157-165
    • /
    • 2011
  • It is challenging to detect foreground objects when background includes an illumination variation, shadow or structural variation due to its motion. Basically pixel-based background models including codebook-based modeling suffer from statistical randomness of each pixel. This paper proposes an algorithm that incorporates Markov random field model into pixel-based background modeling to achieve more accurate foreground detection. Under the assumptions the distance between the pixel on the input imaging and the corresponding background model and the difference between the scene estimates of the spatio-temporally neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameters is proposed. The proposed method alternates between estimating the parameters with the intermediate foreground detection and estimating the foreground detection with the estimated parameters, after computing it with random initial parameters. Extensive experiment is conducted with several videos recorded both indoors and outdoors to compare the proposed method with the standard codebook-based algorithm.

CQI Quantization Scheme in Random Beamforming System (Random Beamforming 시스템에서의 CQI 양자화 기법)

  • Ko, Kyeong-Jun;Lee, Jung-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2A
    • /
    • pp.170-176
    • /
    • 2009
  • It has been known that multiuser MIMO systems have better performance than single-user MIMO systems. However, multiuser MIMO systems should eliminate inter-user interferences which are generated by allocating data to multiple users simultaneously There is zero-forcing beamforming (ZFBF) as scheme used widely among algorithms to eliminate inter-user interferences. But, it needs many feedback bits since BS knows quite exact channel state information to use this scheme in real systems. Random beamforming (RBF) was proposed to cope with a defect of ZFBF[1]. RBF is a multiuser scheme to send data to users who have optimal performance with predetermined codebook, each receiver feeds back a index of codeword which has optimal performance within the codebook and its CQI information. [1] assumes that the BS knows perfect CQI information of each receiver but CQI information should be quantized in the real systems. Therefore, in this paper, efficient CQI quantization scheme for RBF system is proposed.