2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | C.10.1 | ||
| Paper Title | Tangential-Sphere Bound Revisited | ||
| Authors | Jia Liu, Chaoyong Wang, Jilin Engineering Normal University, China | ||
| Session | C.10: Topics in Coding Theory | ||
| Presentation | Lecture | ||
| Track | Coding for Communications | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | With the recently proposed parameterized Gallager's first bounding technique (GFBT), the tangential-sphere bound (TSB) of Poltyrev, which was considered as one of the tightest upper bounds, is revisited by defining nested Gallager regions. The nested Gallager regions are chosen to be a family of the boundary surface of the circular cone whose central line passes through the origin and the transmitted signal. The parameterized TSB proposed in this paper can be proved to be equivalent to the TSB proposed by Poltyrev. The equation for the optimal parameter can be obtained in an intuitive manner without resorting to the derivatives. The new derivation reveals that the optimal region of TSB is a cone rather than a double cone with a geometrical explanation, which is considered to be a double cone in the original literature. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
