• Title/Summary/Keyword: Codebook

Search Result 346, Processing Time 0.021 seconds

Codebook-Based Precoding for SDMA-OFDMA with Spectrum Sharing

  • Jo, Han-Shin
    • ETRI Journal
    • /
    • v.33 no.6
    • /
    • pp.831-840
    • /
    • 2011
  • This paper focuses on codebook-based precoding for space-division multiple access/orthogonal frequency-division multiple access (SDMA-OFDMA) systems aiming to guarantee high throughput for their users as well as to mitigate interference to fixed satellite service (FSS). A systematic design of SDMA codebook for subband-based OFDMA is proposed, which forms multiple orthogonal beams with common spatial null in the direction of a victim FSS earth station (ES). The design enables both transmitter and receiver to independently construct identical codebook by sharing only on the direction angle of an FSS ES, which takes fewer overhead bits than Gram-Schmidt process, a general method satisfying our design criterion. A system-level throughput evaluation shows that the proposed precoding provides superior performance over existing spectrum sharing method, that is, subband deactivation. The spectrum sharing analysis shows that the proposed precoding, even with an estimation error of the direction angles of an FSS ES, causes lower interference than existing precoding, knockdown precoding.

Vector quantization codebook design using activity and neural network (활동도와 신경망을 이용한 벡터양자화 코드북 설계)

  • 이경환;이법기;최정현;김덕규
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.5
    • /
    • pp.75-82
    • /
    • 1998
  • Conventional vector quantization (VQ) codebook design methods have several drawbacks such as edge degradation and high computational complexity. In this paper, we first made activity coordinates from the horizonatal and the vertical activity of the input block. Then it is mapped on the 2-dimensional interconnected codebook, and the codebook is designed using kohonen self-organizing map (KSFM) learning algorithm after the search of a codevector that has the minumum distance from the input vector in a small window, centered by the mapped point. As the serch area is restricted within the window, the computational amount is reduced compared with usual VQ. From the resutls of computer simulation, proposed method shows a better perfomance, in the view point of edge reconstruction and PSNR, than previous codebook training methods. And we also obtained a higher PSNR than that of classified vector quantization (CVQ).

  • PDF

Reduced Search for a CELP Adaptive Codebook (CELP 부호화기의 코드북 탐색 시간 개선)

  • Lee, Ji-Woong;Na, Hoon;Jeong, Dae-Gwon
    • 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.

  • PDF

An Efficient Vector Quantization Codebook generation using a Triangle Inequality (삼각 부등식을 이용한 빠른 벡터 양자화 코드북 생성)

  • Lee, Hyun-Jin
    • Journal of Digital Contents Society
    • /
    • v.13 no.3
    • /
    • pp.309-315
    • /
    • 2012
  • Active data are the input data which are changed its membership as Vector Quantization codebook generation algorithm is processed. In the process of VQ codebook generation algorithm performed, the actual active data out of the entire input data will be less presented as the process is performed. Therefore, if we can accurately find the active data and only if we are going to do VQ codebook generation on the active data, then we can significantly reduce the overall generation time. In this paper, we presented the triangle inequality based algorithm to select the active data. Experimental results show that our algorithm is superior to other methods in terms of the VQ codebook generation time.

A VQ Codebook Design Based on Phonetic Distribution for Distributed Speech Recognition (분산 음성인식 시스템의 성능향상을 위한 음소 빈도 비율에 기반한 VQ 코드북 설계)

  • Oh Yoo-Rhee;Yoon Jae-Sam;Lee Gil-Ho;Kim Hong-Kook;Ryu Chang-Sun;Koo Myoung-Wa
    • Proceedings of the KSPS conference
    • /
    • 2006.05a
    • /
    • pp.37-40
    • /
    • 2006
  • In this paper, we propose a VQ codebook design of speech recognition feature parameters in order to improve the performance of a distributed speech recognition system. For the context-dependent HMMs, a VQ codebook should be correlated with phonetic distributions in the training data for HMMs. Thus, we focus on a selection method of training data based on phonetic distribution instead of using all the training data for an efficient VQ codebook design. From the speech recognition experiments using the Aurora 4 database, the distributed speech recognition system employing a VQ codebook designed by the proposed method reduced the word error rate (WER) by 10% when compared with that using a VQ codebook trained with the whole training data.

  • PDF

Efficient QEGT Codebook Searching Technique for a MISO Beamforming System (MISO 빔포밍 시스템에서 효율적인 QEGT 코드북 탐색 기법)

  • Park, Noe-Yoon;Kim, Young-Ju
    • 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.

Online VQ Codebook Generation using a Triangle Inequality (삼각 부등식을 이용한 온라인 VQ 코드북 생성 방법)

  • Lee, Hyunjin
    • Journal of Digital Contents Society
    • /
    • v.16 no.3
    • /
    • pp.373-379
    • /
    • 2015
  • In this paper, we propose an online VQ Codebook generation method for updating an existing VQ Codebook in real-time and adding to an existing cluster with newly created text data which are news paper, web pages, blogs, tweets and IoT data like sensor, machine. Without degrading the performance of the batch VQ Codebook to the existing data, it was able to take advantage of the newly added data by using a triangle inequality which modifying the VQ Codebook progressively show a high degree of accuracy and speed. The result of applying to test data showed that the performance is similar to the batch method.

A Codebook Generation Algorithm Using a New Updating Condition (새로운 갱신조건을 적용한 부호책 생성 알고리즘)

  • 김형철;조제황
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.3
    • /
    • pp.205-209
    • /
    • 2004
  • The K-means algorithm is the most widely used method among the codebook generation algorithms in vector quantization. In this paper, we propose a codebook generation algorithm using a new updating condition to enhance the codebook performance. The conventional K-means algorithm uses a fixed weight of the distance for all training iterations, but the proposed method uses different weights according to the updating condition from the new codevectors for training iterations. Then, different weights can be applied to generate codevectors at each iteration according to this condition, and it can have a similar effect to variable weights. Experimental results show that the proposed algorithm has the better codebook performance than that of K-means algorithm.

  • PDF

A Single-layer Differential Codebook Design Over Pedestrian Closed-loop MISO System (보행자 채널의 폐루프 MISO 시스템에서 적응형 단일계층 차분 코드북 설계)

  • Kim, Young-Ju
    • 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.

A Method For Improvement Of Split Vector Quantization Of The ISF Parameters Using Adaptive Extended Codebook (적응적인 확장된 코드북을 이용한 분할 벡터 양자화기 구조의 ISF 양자화기 개선)

  • Lim, Jong-Ha;Jeong, Gyu-Hyeok;Hong, Gi-Bong;Lee, In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.1
    • /
    • pp.1-8
    • /
    • 2011
  • This paper presents a method for improving the performance of ISF coefficients quantizer through compensating the defect of the split structure vector quantization using the ordering property of ISF coefficients. And design the ISF coefficients quantizer for wideband speech codec using proposed method. The wideband speech codec uses split structure vector quantizer which could not use the correlation between ISF coefficients fully to reduce complexity and the size of codebook. The proposed algorithm uses the ordering property of ISF coefficients to overcome the defect. Using the ordering property, the codebook redundancy could be figured out. The codebook redundancy is replaced by the adaptive-extended codebook to improve the performance of the quantizer through using the ordering property, ISF coefficient prediction and interpolation of existing codebook. As a result, the proposed algorithm shows that the adaptive-extended codebook algorithm could get about 2 bit gains in comparison with the existing split structure ISF quantizer of AMR-WB (G.722.2) in the points of spectral distortion.