Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel
Abstract
We investigate variable-length feedback (VLF) codes for the Gaussian point-to-point channel under maximal power, average error probability, and average decoding time constraints. Our proposed strategy chooses K < ∞ decoding times n₁,n₂,…,n_K rather than allowing decoding at any time n = 0,1,2,…. We consider stop-feedback, which is one-bit feedback transmitted from the receiver to the transmitter at times n₁,n₂,… only to inform her whether to stop. We prove an achievability bound for VLF codes with the asymptotic approximation ln M ≈ NC(P)/1−ϵ − √N ln_((K−1))(N)V(P)/1−ϵ, where ln_((K))(⋅) denotes the K-fold nested logarithm function, N is the average decoding time, and C(P) and V(P) are the capacity and dispersion of the Gaussian channel, respectively. Our achievability bound evaluates a non-asymptotic bound and optimizes the decoding times n₁,…,n_K within our code architecture.
Additional Information
© 2021 IEEE. This work was supported in part by the National Science Foundation (NSF) under grant CCF-1817241 and CCF-1956386. Stimulating discussions with Prof. Richard Wesel and Prof. Aaron Wagner are gratefully acknowledged.Attached Files
Submitted - 2103.09373.pdf
Files
Name | Size | Download all |
---|---|---|
md5:04d88a77470afd29ee4def67c917f4be
|
642.2 kB | Preview Download |
Additional details
- Eprint ID
- 108576
- Resolver ID
- CaltechAUTHORS:20210329-152031630
- CCF-1817241
- NSF
- CCF-1956386
- NSF
- Created
-
2021-03-30Created from EPrint's datestamp field
- Updated
-
2021-10-29Created from EPrint's last_modified field