• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.21-28
• /
• 2016

We propose an adaptive scheme of a differential codebook for temporally correlated channels. And the codeword entries of the propose codebook are selected among the set of M-PSK constellations - the values of M proposed in this paper are 8, 16, or 32. Firstly, we analyze mathematically how the optimal spherical cap radius of the proposed codebook is tracked. Then, we explain the practical implementation of the proposed adaptive method. Practically, some candidate differential codebooks we propose in this paper can be switched according to the temporal correlation coefficients of wireless channels in the proposed scheme. Monte-Carlo simulations demonstrate that the achievable throughput performance employing the proposed codebook is always superior to those of the differential codebooks employing M-PSK constellations and non-adaptive differential codebooks with the same amount of feedback information.

• Journal of Broadcast Engineering
• /
• v.24 no.4
• /
• pp.613-622
• /
• 2019

A differential codebook design method using wireless channel's temporal correlation is proposed over closed loop multiple-input single-output (MISO) system. The single layer codewords in a codebook are selected among a set of phase elements. In the conventional codeword selection rule, codewords are assumed to be on a spherical cap and sine formula was used. In this paper, however, a new method using Pythagoras formula is employed to simplify computational complexity. Also, an adaptive differential codebook selection is adopted to enhance performance. Monte-Carlo simulations demonstrate that the proposed codebook is superior to the conventional ones.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.1
• /
• pp.19-30
• /
• 2012

For digital data compression, the quantization is the main part of the lossy source coding. In order to improve the performance of quantization, the vector quantizer(VQ) can be employed. The encoding complexity, however, exponentially increases as the vector dimension or bit rate gets large. Much research has been conducted to alleviate such problems of VQ. Especially for high bit rates, a constrained VQ, which is called the sample-adaptive product quantizer(SAPQ), has been proposed for reducing the hugh encoding complexity of regular VQs. SAPQ has very similar structure as to the product VQ(PQ). However, the quantizer performance can be better than the PQ case. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. Among SAPQs, 1-SAPQ has a simple quantizer structure, where each product codebook is symmetric with respect to the diagonal line in the underlying vector space. It is known that 1-SAPQ shows a good performance for i.i.d. sources. In this paper, a study on designing 1-SAPQ for the first-order Markov process. For an efficient design of 1-SAPQ, an algorithm for the initial codebook is proposed, and through the numerical analysis it is shown that 1-SAPQ shows better quantizer distortion than the VQ case, of which encoding complexity is similar to that of 1-SAPQ, and shows distortions, which are close to that of the DPCM(differential pulse coded modulation) scheme with the Lloyd-Max quantizer.