Jayanth Nayak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jayanth Nayak has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ertem Tuncel
Department of Electrical and Computer Engineering, University of California at Riverside, Riverside, CA, USA
3 shared publications - Deniz Gunduz
Imperial College London, UK
2 shared publications - Christine Guillemot
IRISA / INRIA Rennes, Campus Universitaire de Beaulieu, Avenue du Général Leclerc, 35042 RENNES Cedex - France
1 shared publication - Denis Kubasov
IRISA / INRIA Rennes, Campus Universitaire de Beaulieu, Avenue du Général Leclerc, 35042 RENNES Cedex - France
1 shared publication - Elza Erkip
Department of Electrical and Computer Engineering, New York University, Brooklyn, NY, USA
1 shared publication - Kenneth Rose
University of California Santa Barbara Santa Barbara 93117 CA USA
1 shared publication
Latest Publications
- 22 March 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 56 (4) , 1782-1799
Wyner–Ziv Coding Over Broadcast Channels: Digital Schemes
This paper addresses lossy transmission of a common source over a broadcast channel when there is correlated side information at the receivers, with emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme that combines ideas from the lossless version of the problem, i.e., Slepian-Wolf coding over broadcast channels, and dirty paper coding, is presented and analyzed. This scheme uses layered coding where the common layer information is intended for both receivers and the refinement information is destined only for one receiver. For the quadratic Gaussian case, a quantity characterizing the combined quality of each receiver is identified in terms of channel and side information parameters. It is shown that it is more advantageous to send the refinement information to the receiver with ¿better¿ combined quality. In the case where all receivers have the same overall quality, the presented scheme becomes optimal. Unlike its lossless counterpart, however, the problem eludes a complete characterization.
- 22 March 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 56 (4) , 1782-1799
Wyner–Ziv Coding Over Broadcast Channels: Digital Schemes
This paper addresses lossy transmission of a common source over a broadcast channel when there is correlated side information at the receivers, with emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme that combines ideas from the lossless version of the problem, i.e., Slepian-Wolf coding over broadcast channels, and dirty paper coding, is presented and analyzed. This scheme uses layered coding where the common layer information is intended for both receivers and the refinement information is destined only for one receiver. For the quadratic Gaussian case, a quantity characterizing the combined quality of each receiver is identified in terms of channel and side information parameters. It is shown that it is more advantageous to send the refinement information to the receiver with ¿better¿ combined quality. In the case where all receivers have the same overall quality, the presented scheme becomes optimal. Unlike its lossless counterpart, however, the problem eludes a complete characterization.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 319-324
Successive Refinement of Vector Sources under Individual Distortion Criteria
The well-known successive refinement scenario is extended to vector sources where individual distortion constraints are posed on every vector component. This extension is then utilized for the derivation of a necessary and sufficient condition for vector successive refinability. For 2-D vector Gaussian and binary symmetric sources, it turns out that successive refinability is not granted everywhere, unlike in the 1-D case for the same sources. Moreover, the behavior of these sources with respect to successive refinability exhibit remarkable similarity.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 319-324
Successive Refinement of Vector Sources under Individual Distortion Criteria
The well-known successive refinement scenario is extended to vector sources where individual distortion constraints are posed on every vector component. This extension is then utilized for the derivation of a necessary and sufficient condition for vector successive refinability. For 2-D vector Gaussian and binary symmetric sources, it turns out that successive refinability is not granted everywhere, unlike in the 1-D case for the same sources. Moreover, the behavior of these sources with respect to successive refinability exhibit remarkable similarity.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1471-1475
Successive Coding of Correlated Sources
The rate-distortion problem for two-layer coding of a pair (X,Y) of correlated sources is considered. The first layer information enables reconstruction of X within a certain distortion Dx, while reception of both layers additionally enables reconstruction of Y within distortion Dy. While this problem is a special case of the successive refinement problem, the computation of the rate-distortion region for this scenario is non- trivial. Using a general class of outer bounds to the successive refinement rate-distortion region, the successive coding rate- distortion region for the case where (X, Y) is a jointly Gaussian pair and the distortion measure is squared-error is explicitly characterized.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1471-1475
Successive Coding of Correlated Sources
The rate-distortion problem for two-layer coding of a pair (X,Y) of correlated sources is considered. The first layer information enables reconstruction of X within a certain distortion Dx, while reception of both layers additionally enables reconstruction of Y within distortion Dy. While this problem is a special case of the successive refinement problem, the computation of the rate-distortion region for this scenario is non- trivial. Using a general class of outer bounds to the successive refinement rate-distortion region, the successive coding rate- distortion region for the case where (X, Y) is a jointly Gaussian pair and the distortion measure is squared-error is explicitly characterized.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, II-1005-II-1008
Code Design for Fast Selective Retrieval of Fusion Stored Sensor-Network/Time-Series Data
We consider the problem of storing data from multiple correlated sources in a database, so as to enable efficient future retrieval of data from select subsets of the sources, where only statistical information about queries may be available in advance. This setting poses new challenges in terms of the precise tradeoffs between storage rate, retrieval rate and distortion. We derive a gradient descent algorithm to optimize the joint encoding (storage) procedure, the decoder, and the retrieval procedure via mapping from queries to subsets of the stored data to retrieve and decode, so that the average retrieval rate-distortion cost is minimized, given a pre-specified overall storage capacity (or rate). Experiments conducted on real and synthetic data-sets demonstrate that our selective retrieval procedure is able to achieve significantly better trade-offs than joint compression, with retrieval speed-ups reaching 5X and distortion gains of up to 3.5 dB possible.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, II-1005-II-1008
Code Design for Fast Selective Retrieval of Fusion Stored Sensor-Network/Time-Series Data
We consider the problem of storing data from multiple correlated sources in a database, so as to enable efficient future retrieval of data from select subsets of the sources, where only statistical information about queries may be available in advance. This setting poses new challenges in terms of the precise tradeoffs between storage rate, retrieval rate and distortion. We derive a gradient descent algorithm to optimize the joint encoding (storage) procedure, the decoder, and the retrieval procedure via mapping from queries to subsets of the stored data to retrieve and decode, so that the average retrieval rate-distortion cost is minimized, given a pre-specified overall storage capacity (or rate). Experiments conducted on real and synthetic data-sets demonstrate that our selective retrieval procedure is able to achieve significantly better trade-offs than joint compression, with retrieval speed-ups reaching 5X and distortion gains of up to 3.5 dB possible.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 183-186
Optimal Reconstruction in Wyner-Ziv Video Coding with Multiple Side Information
This paper addresses the problem of optimal minimum mean-squared error reconstruction of quantised samples in Wyner-Ziv video coding systems. Closed-form expressions of the optimal reconstructed values are derived for a Laplacian correlation model. The method is used for both single and multiple side information scenarios (the latter is also referred to as multi-hypothesis Wyner-Ziv decoding). The efficiency of the proposed optimal reconstruction method is confirmed by rate-distortion performance results, showing significant decrease of the distortion of the decoded sequence, compared to simple reconstruction methods that have been employed so far.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 183-186
Optimal Reconstruction in Wyner-Ziv Video Coding with Multiple Side Information
This paper addresses the problem of optimal minimum mean-squared error reconstruction of quantised samples in Wyner-Ziv video coding systems. Closed-form expressions of the optimal reconstructed values are derived for a Laplacian correlation model. The method is used for both single and multiple side information scenarios (the latter is also referred to as multi-hypothesis Wyner-Ziv decoding). The efficiency of the proposed optimal reconstruction method is confirmed by rate-distortion performance results, showing significant decrease of the distortion of the decoded sequence, compared to simple reconstruction methods that have been employed so far.