• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1219-1222
• /
• 1998

This paper analyzes the dynamic spars algebraic codebook used to model a residual signal and proposes a new algebraic codebook structure as well as a searching process with improved performance. The proposed algorithm improves the disadvantage of algebraic codebook without increased computation. First, this paper makes it possibel to select various pulse amplitudes differently from the conventional method which looks up the sign bit simply. In addition, two pulses are made to be selected on the same track. For speech quality on the telephone line 5.6kbps speech coder using the proposed algorithm was equivalent to the 6.3kbps MP-MLQ in the viewpoint of subjective speech quality. However, speech degradation was caused a little compared to the MP-MLQ where MNRU 1=15dB.

• 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

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

• ETRI Journal
• /
• v.27 no.2
• /
• pp.231-234
• /
• 2005

This letter proposes a new embedded speech coding structure based on the Adaptive Multi-Rate Wideband (AMR-WB) standard codec. The proposed coding scheme consists of three different bitrates where the two lower bitrates are embedded into the highest one. The embedded bitstream was achieved by modifying the algebraic codebook search procedure adopted for the AMR-WB codec. The proposed method provides the advantage of scalability due to the embedded bitstream, while it inevitably requires some additional computational complexity for obtaining two different code vectors of the higher bitrate modes. Compared to the AMR-WB codec, the embedded coder shows improved speech qualities for two higher bitrate modes with a slightly increased bitrate caused by the decreased coding efficiency of the algebraic codebook.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.7
• /
• pp.33-38
• /
• 1999

In this paper, we combine a generalized analysis-by-synthesis (AbS) structure and an algebraic excitation scheme to propose a new 4kb/s speech codec. This codec partly uses the structure of G.729. We design a line spectrum pair (LSP) quantizer, an adaptive codebook, and an excitation codebook to fit the 4 kb/s bit rate. The codec has a 25㎳ algorithmic delay, which corresponds to a 20㎳ frame size and a 5㎳ lookahead. At the bit rates below 4kb/s, most CELP speech codecs using the AbS principle have a drawback that results a rapid degradation of speech quality. To overcome this drawback we use the generalized AbS structure which is efficient for the low bit rate speech codec. LP coefficients are converted to LSP and quantized using a predictive 2-stage VQ. A low complexity algebraic codebook which uses shifting method is used for the fixed codebook excitation, and gains of the adaptive codebook and the fixed codebook are quantized using the VQ. To evaluate the performance of the proposed codec A-B preference tests are done with the fixed rate 8kb/s QCELP. As the result of the test, the performance of the codec is similar to that of the fixed rate 8kb/s QCELP.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.08a
• /
• pp.131-135
• /
• 1998

5.6kbps 의 전송율에서 fixed codebook 으로 ISPP의 dynamic sparse algebraic codebook을 이용한 ACELP 알고리즘을 제안한다. 저전송율에서 음질에 중대한 영향을 미치는 대수적 방식의 고정코드북이 가지는 문제점을 최소화하여 음질의 증진을 꾀하였다. 또한 추가 계산량이 필요없는 U/V 분리기를 도입하여 LSF 보간시 발생하는 천이구간에서의 지연을 최소화하였다. 구현된 5.6 kbps ACELP 는 전화선상의 음질을 시료로 하여 주관적 음질면에서 6.3 kbps MP-MLQ와 동등하였으며 MNRU 15dB에서 약간 낮았다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.7-10
• /
• 2000

본 논문은 이동통신상에서 송신측의 송신 채널 에러정보를 수신측에서 송신측으로 전달하는 음성패킷을 이용하여 송신측에 알려주어 압축과정에 이용하게 할 수 있는 방법을 제안한다. ACELP(Algebraic CELP)구조 방식을 가지고 있는 음성압축기들 중 G.729을 사용하며 음성 패킷정보 중 Pitch Delay와 Fixed Codebook를 이용하여 전송음성 패킷안에 상대방의 송신 채널정보를 싣는다. 수신측에서 받은 패킷이 Erasure로 판단되었을 때 패킷정보들 중 Fixed Codebook Index를 만들게 되는 4개의 Optimal 펄스 중 2개의 펄스만 사용하며 나머지 2개의 펄스는 약속된 임의의 위치에 위치시킨 후 송신측에 전송시킨다. 상대방에서 약속에 맞는 위치의 펄스를 보내왔을 때를 체크함으로써 자신의 송신채널 상태를 알 수 있게 된다 송신채널에$5\%$ Erasure 채널 에러가 발생했을 때 채널정보를 가진 패킷의 음질은 약 0.1dB 정도 떨어지게 된다. 하지만 음성압축 전송 시 송신채널의 정보를 이용하여 무선채널에러에 강하게 할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.4
• /
• pp.292-302
• /
• 2003

We propose a new method to reduce the complexity of excitation codebook search. The preselected excitation pulses by the coarse search method can be updated to pulses with higher quality performance measure. The excitation pulses can arbitrarily be deleted and inserted among the searched pulses until the overall performance achieves. If we use this excitation pulse search method in AMR-WB, the complexity required for excitation codebook search can be reduced to half the original method while the output speech maintains equal speech quality to a conventional method.