Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (2)

Search Parameters:
Keywords = asymptotically wide sense stationary (AWSS) vector source

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
22 pages, 503 KiB  
Article
A Low-Complexity and Asymptotically Optimal Coding Strategy for Gaussian Vector Sources
by Marta Zárraga-Rodríguez, Jesús Gutiérrez-Gutiérrez and Xabier Insausti
Entropy 2019, 21(10), 965; https://doi.org/10.3390/e21100965 - 2 Oct 2019
Cited by 2 | Viewed by 2097
Abstract
In this paper, we present a low-complexity coding strategy to encode (compress) finite-length data blocks of Gaussian vector sources. We show that for large enough data blocks of a Gaussian asymptotically wide sense stationary (AWSS) vector source, the rate of the coding strategy [...] Read more.
In this paper, we present a low-complexity coding strategy to encode (compress) finite-length data blocks of Gaussian vector sources. We show that for large enough data blocks of a Gaussian asymptotically wide sense stationary (AWSS) vector source, the rate of the coding strategy tends to the lowest possible rate. Besides being a low-complexity strategy it does not require the knowledge of the correlation matrix of such data blocks. We also show that this coding strategy is appropriate to encode the most relevant Gaussian vector sources, namely, wide sense stationary (WSS), moving average (MA), autoregressive (AR), and ARMA vector sources. Full article
(This article belongs to the Section Information Theory, Probability and Statistics)
Show Figures

Figure 1

15 pages, 835 KiB  
Article
Rate-Distortion Function Upper Bounds for Gaussian Vectors and Their Applications in Coding AR Sources
by Jesús Gutiérrez-Gutiérrez, Marta Zárraga-Rodríguez, Fernando M. Villar-Rosety and Xabier Insausti
Entropy 2018, 20(6), 399; https://doi.org/10.3390/e20060399 - 23 May 2018
Cited by 7 | Viewed by 3607
Abstract
In this paper, we give upper bounds for the rate-distortion function (RDF) of any Gaussian vector, and we propose coding strategies to achieve such bounds. We use these strategies to reduce the computational complexity of coding Gaussian asymptotically wide sense stationary (AWSS) autoregressive [...] Read more.
In this paper, we give upper bounds for the rate-distortion function (RDF) of any Gaussian vector, and we propose coding strategies to achieve such bounds. We use these strategies to reduce the computational complexity of coding Gaussian asymptotically wide sense stationary (AWSS) autoregressive (AR) sources. Furthermore, we also give sufficient conditions for AR processes to be AWSS. Full article
(This article belongs to the Special Issue Rate-Distortion Theory and Information Theory)
Show Figures

Figure 1

Back to TopTop