Efficient quantization for overcomplete expansions in /spl Ropf//sup N/

DOI10.1109/TIT.2002.806117zbMath1063.94009OpenAlexW2075433161MaRDI QIDQ4679886

Antonio Ortegar, Baltasar Beferull-Lozano

Publication date: 31 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2002.806117

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Related Items (6)

Second-order sigma-delta (\(\Sigma \Delta\)) quantization of finite frame expansions ⋮ Frame paths and error bounds for sigma-delta quantization ⋮ Randomly dithered quantization and sigma-delta noise shaping for finite frames ⋮ Frame permutation quantization ⋮ Mean squared error bounds for the Rangan-Goyal soft thresholding algorithm ⋮ Frame expansions with erasures: an approach through the non-commutative operator theory

This page was built for publication: Efficient quantization for overcomplete expansions in /spl Ropf//sup N/