• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.9-16
• /
• 2013

Long term evolution (LTE) and LTE-Advanced (LTE-A) systems adopt closed-loop multiple-input multiple-output antenna techniques. Equal gain transmission which has equal gain property is the key factor in their codebook design. In this paper, a novel differential codebook structure which maintains the codebook design requirements of LTE or LTE-A systems. Especially, eight-phase shift keying (8-PSK) constellations are used as elements of codewords, which not only maintain equal gain property but also reduce the computation complexity of precoding and decoding function blocks. The equal gain property is very important to uplink because the performance of uplink is very sensitive to the peak-to-average power ratio (PAPR). Moreover, the operation of the proposed differential codebook is explained as a rotation-lock structure. As the results of computer simulations, the steady-state throughput performance of the proposed codebook shows at least 0.9dB of SNR better than those of the conventional LTE codebook with the same amount of feedback information.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.1
• /
• pp.24-31
• /
• 2015

A differential codebook using M-ary phase shift keying (M-PSK) constellation as its codeword elements, is proposed for Long term evolution (LTE), LTE-Advanced (LTE-A), and/or WiMAX systems. Due to the temporal correlation of the adjacent channel, the consecutive precoding matrices are likely to be similar. This approach 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. Especially, the proposed codebook has the same properties of LTE release-8 codebook that is, constant modulus, complexity reduction, and nested property. The mobile station can be designed by using a less expensive non-linear amplifier utilizing the constant modulus property. Computer simulations show that the capacity of the proposed codebook performs better than LTE release-8 codebook with the same amount of feedback information.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2
• /
• pp.5-11
• /
• 1996

The purpose of this paper is to propose a method improving the performance of a semi-continuous hidden Markov model(SCHMM) speaker adaptation system which uses Bayesian Parameter reestimation approach. The performance of Bayesian speaker adaptation could be degraded in case that the features of a new speaker are severely different from those of a reference codebook. The excessive codewords of the reference codebook still remain after adaptation proess. which cause confusion in recognition process. To solve such problems, the proposed method uses formant information which is extracted from the cepstral coefficients of the reference codebook and adaptation data. The reference codebook is adapted to represent the formant distribution of a new speaker and it is used for Bayesian speaker adaptation as an initial codebook. The proposed method provides accurate correspondence between reference codebook and adaptation data. It was observed that the excessive codewords were not selected during recognition process. The experimental results showed that the proposed method improved the recognition performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.462-469
• /
• 2002

While the conventional K-means algorithms use a fixed weight to design a vector codebook for all learning iterations, the proposed method employs a variable weight for learning iterations. The weight value of two or more beyond a convergent region is applied to obtain new codevectors at the initial learning iteration. The number of learning iteration applying a variable weight must be decreased for higher weight value at the initial learning iteration to design a better codebook. To enhance the splitting method that is used to generate an initial codebook, we propose a new method, which reduces the error between a representative vector and the member of training vectors. The method is that the representative vector with maximum squared error is rejected, but the vector with minimum error is splitting, and then we can obtain the better initial codevectors.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.655-665
• /
• 2012

Based on wideband precoding (WBP) in the multiple-input multiple-output orthogonal frequency division multiplexing system, an adaptive nonuniform codebook is presented in this paper. The relationship between the precoder distribution and spatial correlation is analyzed at first. A closed-form expression based on overlapped isosceles triangles is proposed as an approximation of the precoder distribution. Then, the adaptive codebook design is derived with the approximate distribution to minimize quantization errors. The capacity and bit error rate performance demonstrate that the adaptive codebook with WBP outperforms the conventional fixed uniform codebook.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.155-157
• /
• 2014

In this paper, a novel codebook generation strategy is proposed. With the given codebooks, two codeword selection procedures are proposed and analyzed for generating the quantized multiple-input multiple-output (MIMO) channel state information (CSI). Furthermore, three different quantization and normalization strategies are analyzed. The simulation results suggest that the proposed 'quantized channel generation method 2' is the best strategy to reduce the quantization and normalization errors to generate the final quantized MIMO CSI.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.1E
• /
• pp.34-38
• /
• 1996

In this paper, a new fast voronoi divider for vector quantization (VQ) is introduced, which results from Theorem that the nearest vectors in the sense of minimum mean square error(MMSE) have almost the same mean values of their elements. An improved splitting method for a VQ codebook design using the fast voronoi divider is also presented. Experimental results show that the new method reduces the complexity of training a VQ codebook several times with a high signal to noise ratio(SNR) using an appropriate extensive parameter of codebook.

• 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을 만들 수 있으며 음성의 특징을 충분히 반영하므로 합성된 음성의 음질을 향상시킬 수 있다.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.5
• /
• pp.69-72
• /
• 1998

본 논문에서는 문장독립형 화자인식 시스템에 MQ(Matrix Quantization) 방법 사용 을 제안한다. 또한 인식율을 높이기 위해 MQ를 수정한 방법인 SMQ(Separated Matrix Quantization)을 제안한다. 기존의 VQ-distortion 방법은 대체로 좋은 성능을 가지나 화자의 동적 특성을 이용하지 못한다는 단점이 있다. MQ와 SMQ는 화자의 동적 특성을 이용할 수 있으므로 시간 변화에 대한 화자의 특징 변화까지 모델링 할 수 있는 장점이 있다. MQ는 여러 프레임을 묶어 Matrix Codebook을 가지며 SMQ는 MQ의 기본 codebook을 다시 켑스 트럼의 차수에 따라 나누어 codebook을 만든다. 즉, 켑스트럼 차수를 저, 중, 고차로 나누어 각 부분별로 Matrix codebook을 만들도록 한다. 인식실험은 문장독립 음성 데이터에 대해 실행했으며 MQ모델의 경우 Matrix의 크기를 짧은 음소크기부터 음절단위까지 변화시켜 실 험하였다. 아울러 SMQ 모델에서의 실험은 차수별 유용도를 보기 위하여 부분 차수를 이용 하여 실험하였다. 실험결과 MQ와 SMQ방법이 VQ에 비해 좋은 성능을 가짐을 확인하였다.

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