Recursive indexing and its application

Khalid Sayood; Sangsin Na

doi:10.1109/ISIT.1991.695081

Recursive indexing and its application

Khalid Sayood, Sangsin Na

Electrical & Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper a recursive indexing scheme is presented, by which an element of a set is represented by a finite sequence of elements of a different set in a recursive manner. When applied to the reproduction alphabet of a quantizer, it can effectively reduce the size of the set on which an entropy-encoder is designed and operated, thereby reducing the complexity of the binary encoder. Numerical results show that for independent identically distributed gamma and Laplacian sources, the rate-distortion performance of a quantizer with recursive indexing is comparable to that of a vector quantizer.

Original language	English (US)
Title of host publication	Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	28
Number of pages	1
ISBN (Electronic)	0780300564
DOIs	https://doi.org/10.1109/ISIT.1991.695081
State	Published - 1991
Event	1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary Duration: Jun 24 1991 → Jun 28 1991

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/Territory	Hungary
City	Budapest
Period	6/24/91 → 6/28/91

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.1991.695081

Cite this

Recursive indexing and its application. / Sayood, Khalid; Na, Sangsin.
Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., 1991. p. 28 695081 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sayood, K & Na, S 1991, Recursive indexing and its application. in Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991., 695081, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 28, 1991 IEEE International Symposium on Information Theory, ISIT 1991, Budapest, Hungary, 6/24/91. https://doi.org/10.1109/ISIT.1991.695081

@inproceedings{99ea2aa2b40d48769379814d5a5bc035,

title = "Recursive indexing and its application",

abstract = "In this paper a recursive indexing scheme is presented, by which an element of a set is represented by a finite sequence of elements of a different set in a recursive manner. When applied to the reproduction alphabet of a quantizer, it can effectively reduce the size of the set on which an entropy-encoder is designed and operated, thereby reducing the complexity of the binary encoder. Numerical results show that for independent identically distributed gamma and Laplacian sources, the rate-distortion performance of a quantizer with recursive indexing is comparable to that of a vector quantizer.",

author = "Khalid Sayood and Sangsin Na",

note = "Publisher Copyright: {\textcopyright} 1991 Institute of Electrical and Electronics Engineers Inc. All rights reserved.; 1991 IEEE International Symposium on Information Theory, ISIT 1991 ; Conference date: 24-06-1991 Through 28-06-1991",

year = "1991",

doi = "10.1109/ISIT.1991.695081",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "28",

booktitle = "Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991",

}

TY - GEN

T1 - Recursive indexing and its application

AU - Sayood, Khalid

AU - Na, Sangsin

PY - 1991

Y1 - 1991

N2 - In this paper a recursive indexing scheme is presented, by which an element of a set is represented by a finite sequence of elements of a different set in a recursive manner. When applied to the reproduction alphabet of a quantizer, it can effectively reduce the size of the set on which an entropy-encoder is designed and operated, thereby reducing the complexity of the binary encoder. Numerical results show that for independent identically distributed gamma and Laplacian sources, the rate-distortion performance of a quantizer with recursive indexing is comparable to that of a vector quantizer.

AB - In this paper a recursive indexing scheme is presented, by which an element of a set is represented by a finite sequence of elements of a different set in a recursive manner. When applied to the reproduction alphabet of a quantizer, it can effectively reduce the size of the set on which an entropy-encoder is designed and operated, thereby reducing the complexity of the binary encoder. Numerical results show that for independent identically distributed gamma and Laplacian sources, the rate-distortion performance of a quantizer with recursive indexing is comparable to that of a vector quantizer.

UR - http://www.scopus.com/inward/record.url?scp=85067441331&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85067441331&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1991.695081

DO - 10.1109/ISIT.1991.695081

M3 - Conference contribution

AN - SCOPUS:85067441331

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 28

BT - Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1991 IEEE International Symposium on Information Theory, ISIT 1991

Y2 - 24 June 1991 through 28 June 1991

ER -

Recursive indexing and its application

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this