• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.704-711
• /
• 2013

Applying channel state information feedback scheme based on codebook for FDD downlink MIMO system to massive MIMO system directly causes following two problems. First, codebook generation becomes hard because resources needed for codebook generation increases exponentially in the number of antennas. In addition, long time is needed for channel state information feedback because users's codebook search time increases linearly in the number of antennas. This paper proposes a codebook generation scheme and a codebook search scheme which can reduce resource for codebook generation and codebook search time drastically though they have similar performance as conventional approaches.

• Journal of Advanced Navigation Technology
• /
• v.4 no.1
• /
• pp.67-77
• /
• 2000

This paper proposes a reduction scheme for codebook search time in the adaptive codebook using wavelet transformed coefficients. In a CELP coder, pitch estimation with a combined open loop and closed loop search in adaptive codebook needs a lengthy search. More precisely, the pitch search using autocorrelation function over all possible ranges has been shown inefficient compared to the consuming time. In this paper, we propose a new adaptive codebook search algorithm which ensures the same position for the pitch with maximum wavelet coefficient over various scaling factors in Dyadic wavelet transform. A new adaptive codebook search algorithm reduces 25% conventional search time with almost the same quality of speech.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• pp.943-948
• /
• 1994

The vector sum excited linear prediction(VSELP) coding gives high quality of synthetic speech at bit rates as low as 4.8kbps, but its computational complexity is prohibitive for real time applications. In this paper, we propose a method to reduce the computations of the VSELP codebook search procedure. The proposed method reduces the search space efficiently, before applying every linear combination of the basis vectors to the codebook search procedure. It decides whether is can fix the combination coefficient of each basis vector using heuristics so that the number of combinations decreases. It has been shown that the proposed method retains good quality of synthetic speech and reduces the computations of codebook search procedure by more than 40% of the origin.

• 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.

• 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.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.203-207
• /
• 1996

This paper describes a method for estimating motion vectors in a video sequence. In this method, we find motion vectors using the full search method from the training images and then, train the codebook of the neural networks vector quantizer using these motion vectors. A motion vector can be estimated using the codebook as a motion prediction region. The codewords in the codebook represent the motion vectors for the input image sequences. Since the codebook is used as the search region for estimating the motion vectors, search points and computation can be reduced compared with the full search block matching algorithm. Additionally, the information required to transmit the motion vectors can be reduced.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1131-1134
• /
• 1999

In general CELP type vocoders provide good speech quality around 4.8kbps. Among them, G.723.1 developed for Internet Phone and videoconferencing includes two vocoders, 5.3kbps ACELP and 6.3kbps MO-MLQ. Since 6.3kbps MP-MLQ requires large amount of computation for fixed codebook search, it is difficult to realize real time processing. In order to improve the problem this paper proposes the new method that reduces the processing time up to about 50% of codebook search time. We first decide the grid bit, then search the codebook. Grid bit is selected by comparison between synthetic speech, which is synthesized with only odd or even pulses of target vector. and DC removed original speech. As a result, we reduced the total processing time of G.723.1 MP-MLQ up to about 26.08%. In objective quality test 11.19㏈ of segSNR was obtained, and in subjective quality test there was almost no speech degradation.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.2
• /
• pp.129-134
• /
• 2003

In this paper, we efficiently implement the AMR speech coder by reducing the complexity of algebraic codebook search. To reduce the computational complexity of the algebraic codebook search, we propose a fast algebraic codebook search method that improves conventional depth first tree search method used in AMR speech coder algorithm. The proposed method reduces the search complexity by pruning the trees which are less possible to be selected as an optimum excitation. This method needs no additional computation for selecting the trees to be pruned and reduces the computational complexity considerably compared to the original depth first tree search method with slightly degradation or speech qualify. Applying our method to the implementation or AMR speech coder with 12.2 kbps mode by using the TeakLite DSP, we reduce the search complexity about 40% compared to the conventional method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.11
• /
• pp.1209-1216
• /
• 2009

This paper presents an efficient Quantized Equal Gain Transmission(QEGT) codebook index searching technique for MISO beamforming system in a Rayleigh flat fading channel. The searching time for the optimum weight vector among the codebook vectors increases exponentially when the codebook size increases linearly, although the bit error rate decreases. So, newly defined simple metric is proposed for fast searching, which determines a few candidates. Then the conventional method combined with accurate search algorithm selects the optimal index. This strategy significantly reduces the overall search time, while maintaining almost the same bit error rate performance. Furthermore, as the codebook size increases, the search time is considerably decreased compared to that of the conventional approach.