A simple derivation of the refined sphere packing bound under certain symmetry hypotheses

Date

2020-01-01

Author

Nakiboğlu, Barış

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

267
views

0
downloads

A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is Omega (n(-0.5(1-E'sp)((R)))) for all codes on certain families of channels (including the Gaussian channels and the nonstationary Renyi symmetric channels) and for the constant composition codes on stationary memoryless channels. The resulting nonasymptotic bounds have definite approximation error terms. As a preliminary result that might be of interest on its own, the trade-off between type I and type II error probabilities in the hypothesis testing problem with (possibly non-stationary) independent samples is determined up to some multiplicative constants, assuming that the probabilities of both types of error are decaying exponentially with the number of samples, using the Berry-Esseen theorem.

Subject Keywords

Hypothesis Testing, Berry-Esseen Theorem, Sphere Packing Bound, Augustin İnformation Measures, Constant Composition Codes, Renyi Symmetry, Gaussian Channels

URI

https://hdl.handle.net/11511/48396

Journal

TURKISH JOURNAL OF MATHEMATICS

DOI

https://doi.org/10.3906/mat-1912-106

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

A Simple Derivation of the Refined SPB for the Constant Composition Codes Nakiboğlu, Barış (2019-07-01) A judicious application of the Berry-Esseen theorem via the concepts of Augustin information and mean is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is Omega(n(-0.5(1-E'sp(R,W,p)))) for the constant composition codes. The resulting non-asymptotic bounds have definite approximation error terms.
A decomposition for the tilted channel of the fast fading channels Yıldız, Mücahit Furkan; Nakiboğlu, Barış; Department of Electrical and Electronics Engineering (2022-9) A decomposition property for the tilted channel of the fast fading channels with the channel state information at the receiver is proposed. A necessary and sufficient condition for the decomposition and the resulting expressions for the sphere packing exponent and the random coding exponent are determined. These expressions are used to calculate the error exponents for the discrete memoryless channels with certain symmetries. The existence of a similar decomposition property for Gaussian channels under Gaus...
A simplified MAP channel estimator for OFDM systems under Rayleigh fading ÇÜRÜK, SELVA; Tanık, Yalçın (2010-06-01) This paper presents a simplified Maximum A Posteriori (SMAP) channel estimator to be used in orthogonal frequency division multiplexing (OFDM) systems under the Rayleigh fading assumption for the subchannels, using a parametric correlation model and assuming that the channel is frequency selective and slowly time varying. Expressions for the mean-square error (MSE) of estimations are derived to evaluate the performance of the estimator. The relation between the correlation of subchannels taps and error vari...
A Novel Input Impedance Computation Method for Coaxial Probe Fed Microstrip Antennas by Utilizing Characteristic Modes Cetin, Metehan; Alatan, Lale (2017-07-14) A method to efficiently compute the input impedance of the coaxial probe fed microstrip antennas by using characteristic modes is proposed in this paper. The efficiency is achieved by defining a discontinuous source current at the feed location that models the current injected by the probe. The input impedance is simply expressed in terms of modal excitation coefficients and eigenvalues of each mode.
The Sphere Packing Bound for DSPCs with Feedback à la Augustin Nakiboğlu, Barış (Institute of Electrical and Electronics Engineers (IEEE), 2019-11-01) Establishing the sphere packing bound for block codes on the discrete stationary product channels with feedback—which are commonly called the discrete memoryless channels with feedback—was considered to be an open problem until recently, notwithstanding the proof sketch provided by Augustin in 1978. A complete proof following Augustin’s proof sketch is presented to demonstrate its adequacy and to draw attention to two novel ideas that it employs. These novel ideas (i.e., the Augustin’s averaging and the use...

Citation Formats

B. Nakiboğlu, “A simple derivation of the refined sphere packing bound under certain symmetry hypotheses,” TURKISH JOURNAL OF MATHEMATICS, pp. 919–948, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48396.