Low-Complexity Analog Linear Coding Scheme

In this letter, we design a low-latency, low-complexity, and low-transmission power analog linear coding scheme to estimate the finite-length data blocks under a mean-square-error (distortion) criterion. The proposed scheme is based on the analog linear coding and the discrete Fourier transform. A r...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 22; no. 9; pp. 1754 - 1757
Main Authors: Insausti, Xabier, Crespo, Pedro M., Gutierrez-Gutierrez, Jesus, Zarraga-Rodriguez, Marta
Format: Journal Article
Language:English
Published: New York IEEE 01.09.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
analog linear coding
AWGN channels
Channel coding
Coding
Complexity
Complexity theory
Correlation
Correlation analysis
DFT
Discrete Fourier transforms
Distortion
finite-length data block
Fourier transforms
Low complexity
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, we design a low-latency, low-complexity, and low-transmission power analog linear coding scheme to estimate the finite-length data blocks under a mean-square-error (distortion) criterion. The proposed scheme is based on the analog linear coding and the discrete Fourier transform. A remarkable feature of our scheme is that it does not require knowing the correlation matrix of the data blocks, and therefore, it can be used even if the correlation matrix changes slowly with time.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2018.2848941