Decoders employing the generalized likelihood ratio test can achieve rates that can be achieved by maximum likelihood decoders on ISI channels even though they are ignorant of the channel characteristic
A universal decoder for a parametric family of channels is a decoder that for any channel in the fam...
We reconsider the minimum/optimal bit-error probability receiver (OBER) for intersymbol interference...
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity prope...
© 1963-2012 IEEE. This paper considers the problem of channel coding over Gaussian intersymbol inter...
Cover title.Includes bibliographical references (p. 49-51).Supported in part by the Advanced Concept...
We introduce a new algorithm for realizing Maximum Likelihood (ML) decoding in discrete channels wit...
We derive detection metrics for soft-output diversity combining for the case of imperfect channel s...
This paper studies likelihood decoding for channel coding over discrete memoryless channels. It is s...
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to mo...
Shannon’s channel coding theorem characterizes the maximal rate of information that can be reliably ...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.In addition to asymptotic ana...
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer ...
© 2017 IEEE. This paper considers the problem of channel coding over Gaussian intersymbol interferen...
We introduce a new algorithm for realizing maximum likelihood (ML) decoding for arbitrary codebooks ...
Universally achievable error exponents pertaining to certain families of channels (most notably, dis...
A universal decoder for a parametric family of channels is a decoder that for any channel in the fam...
We reconsider the minimum/optimal bit-error probability receiver (OBER) for intersymbol interference...
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity prope...
© 1963-2012 IEEE. This paper considers the problem of channel coding over Gaussian intersymbol inter...
Cover title.Includes bibliographical references (p. 49-51).Supported in part by the Advanced Concept...
We introduce a new algorithm for realizing Maximum Likelihood (ML) decoding in discrete channels wit...
We derive detection metrics for soft-output diversity combining for the case of imperfect channel s...
This paper studies likelihood decoding for channel coding over discrete memoryless channels. It is s...
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to mo...
Shannon’s channel coding theorem characterizes the maximal rate of information that can be reliably ...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.In addition to asymptotic ana...
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer ...
© 2017 IEEE. This paper considers the problem of channel coding over Gaussian intersymbol interferen...
We introduce a new algorithm for realizing maximum likelihood (ML) decoding for arbitrary codebooks ...
Universally achievable error exponents pertaining to certain families of channels (most notably, dis...
A universal decoder for a parametric family of channels is a decoder that for any channel in the fam...
We reconsider the minimum/optimal bit-error probability receiver (OBER) for intersymbol interference...
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity prope...