.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity Analog Linear Coding Scheme
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2018.2848941.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Low complexity
analog linear coding
finite-length data block
DFT
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W