Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Adam R. Williamson"'
Autor:
Adam R. Williamson
In this paper, we analyze the low-SNR behavior of the cross-receiver mutual information (CMI) between two received signals corrupted by uncorrelated, additive Gaussian noise. This framework has use in distributed, passive sensor applications, such as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78ccdf35a0009588676d4fad030ac74b
https://doi.org/10.36227/techrxiv.13710142.v1
https://doi.org/10.36227/techrxiv.13710142.v1
Publikováno v:
IEEE Transactions on Communications. 62:1768-1778
We present extensions to Raghavan and Baum's reliability-output Viterbi algorithm (ROVA) to accommodate tail-biting convolutional codes. These tail-biting reliability-output algorithms compute the exact word-error probability of the decoded codeword
Autor:
Dariush Divsalar, Richard D. Wesel, Adam R. Williamson, Sudarsan V. S. Ranganathan, Kasra Vakilinia
Publikováno v:
ITW
One advantage of incremental transmissions with feedback in point-to-point memoryless channels is a reduction in average blocklength required to approach capacity. This paper optimizes the size of each incremental transmission for non-binary (NB) LDP
Autor:
Richard D. Wesel, Sudarsan V. S. Ranganathan, Kasra Vakilinia, Dariush Divsalar, Tsung-Yi Chen, Adam R. Williamson
Publikováno v:
ISIT
Publikováno v:
ISIT
Publikováno v:
ITA
The read channel in Flash memory systems degrades over time because the Fowler-Nordheim tunneling used to apply charge to the floating gate eventually compromises the integrity of the cell because of tunnel oxide degradation. While degradation is com
This paper presents a variable-length decision-feedback scheme that uses tail-biting convolutional codes and the tail-biting Reliability-Output Viterbi Algoritm (ROVA). Comparing with recent results in finite-blocklength information theory, simulatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e02528b271b14504b1b66a940f37b552
Publikováno v:
ISIT
This paper presents a reliability-based decoding scheme for variable-length coding with feedback and demonstrates via simulation that it can achieve higher rates than Polyanskiy et al.'s random coding lower bound for variable-length feedback (VLF) co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7037bb09380e2eb35c0972ba531985d
http://arxiv.org/abs/1305.4560
http://arxiv.org/abs/1305.4560
Publikováno v:
ITA
In an effort to account for the latency cost of error detection at short blocklengths, we simulate a two-phase feedback-based incremental redundancy scheme. This scheme consists of communication and confirmation phases, as used in the error exponent
Publikováno v:
ISIT
Theoretical analysis has long indicated that feedback improves the error exponent but not the capacity of single-user memoryless channels. Recently Polyanskiy et al. studied the benefit of variable-length feedback with termination (VLFT) codes in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0b2b382d4eb19014112407d02e67e59
http://arxiv.org/abs/1301.7464
http://arxiv.org/abs/1301.7464