Cargando…

A Low-Complexity and Asymptotically Optimal Coding Strategy for Gaussian Vector Sources

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Zárraga-Rodríguez, Marta, Gutiérrez-Gutiérrez, Jesús, Insausti, Xabier
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514296/
http://dx.doi.org/10.3390/e21100965