전자공학회논문지B (Journal of the Korean Institute of Telematics and Electronics B)
- 제32B권5호
- /
- Pages.77-86
- /
- 1995
- /
- 1016-135X(pISSN)
최소거리 분류벡터 양자기와 시스토릭 어레이 구조
Minimum-Distance Classified Vector Quantizer and Its Systolic Array Architecture
초록
In this paper in order to reduce the encoding complexity required in the full search vector quantization(VQ), a new classified vector quantization(CVQ) technique is described employing the minimum-distance classifier. The determination of the optimal subcodebook sizes for each class is an important task in CVQ designs and is not an easy work. Therefore letting the subcodebook sizes be equal. A CVQ technique. Which satisties the optimal CVQ condition approximately, is proposed. The proposed CVQ is a kind of the partial search VQ because it requires a search process within each subcodebook only, and the minimum encoding complexity since the subcodebook sizes are the same in each class. But simulation results reveal while the encoding complexity is only O(N
키워드