Complexity-constrained trellis quantizers

被引:2
|
作者
Larsen, MF [1 ]
Frost, RL [1 ]
机构
[1] BRIGHAM YOUNG UNIV, DEPT ELECT & COMP ENGN, PROVO, UT 84602 USA
关键词
alphabet-constrained rate-distortion theory; complexity-constrained quantizers; composite sources; source coding; trellis quantizers;
D O I
10.1109/18.605574
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A reasonable measure of quantizer complexity is the expected number of quanta per input sample for which distortion is computed, Given this measure, a rate-distortion-complexity theory is obtained by extending earlier work in alphabet-constrained rate-distortion theory, Numerical results show that operation on the alphabet-constrained rate-distortion bound can be obtained with a complexity of two. Furthermore, Lloyd-Max conditions are shown to describe the minimum of a slightly constrained version of the rate-distortion-complexity problem, Complexity-constrained design methods are applied first to trellis-coded quantizers, where they are shown to reduce arithmetic operations by at least 25%. They are then used to develop model-based trellis quantizers, the trellises of which are derived from a Markov model of the source, Simulation results confirm that excellent performance can be obtained Kith modest complexity.
引用
收藏
页码:1134 / 1144
页数:11
相关论文
共 50 条
  • [31] CONSTRUCTION AND EVALUATION OF TRELLIS-CODED QUANTIZERS FOR MEMORYLESS SOURCES
    VANDERVLEUTEN, RJ
    WEBER, JH
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (03) : 853 - 859
  • [32] Design of multi-carrier modulation for doubly selective channels based on a complexity-constrained achievable rate metric
    Das, Sibasish
    Schniter, Philip
    2006 FORTIETH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-5, 2006, : 483 - +
  • [33] Trellis complexity and minimal trellis diagrams of lattices
    Banihashemi, AH
    Blake, IF
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (05) : 1829 - 1847
  • [34] Design of trellis coded vector quantizers using Kohonen maps
    Leung, CS
    Chan, LW
    NEURAL NETWORKS, 1999, 12 (06) : 907 - 914
  • [35] Kolmogorov Complexity of Spherical Vector Quantizers
    Ilic, Velimir M.
    Peric, Zoran H.
    NEUREL 2008: NINTH SYMPOSIUM ON NEURAL NETWORK APPLICATIONS IN ELECTRICAL ENGINEERING, PROCEEDINGS, 2008, : 45 - +
  • [36] On codes of bounded trellis complexity
    Kashyap, Navin
    2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, : 168 - 173
  • [37] The trellis complexity of convolutional codes
    McEliece, RJ
    Lin, W
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) : 1855 - 1864
  • [38] Error/Erasure-Resilient and Complexity-Constrained Zero-Delay Distributed Coding for Large-Scale Sensor Networks
    Viswanatha, Kumar
    Ramaswamy, Sharadh
    Saxena, Ankur
    Rose, Kenneth
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2015, 11 (02)
  • [39] Computation of the complexity of vector quantizers by affine modeling
    Seraco, Estevan P.
    Gomes, Jose Gabriel R. C.
    SIGNAL PROCESSING, 2011, 91 (05) : 1134 - 1142
  • [40] Alternative Syndrome-Trellis Codes with Reduced Trellis Complexity
    Liu, Wei-Wei
    Liu, Guang-Jie
    Dai, Yue-Wei
    Journal of Information Hiding and Multimedia Signal Processing, 2014, 5 (04): : 769 - 777