On Computing Shannon’s Sphere Packing Bound and Applications
ISCTA (2007)
Available from
Mohammed Zaki Ahmed's profile on Mendeley.
or
Abstract
A new method to numerically evalu- ate Shannons lower bound is presented in this pa- per. This new method is based on the Incomplete Beta function and permits the exact evaluation of the Sphere Packing Bound for a large range of code sizes, rates and probability of error. Comparisons with cur- rent standards (DVBRCS, DVBS2 and 3GPP) are also presented and discussed. It is shown that cur- rent standard coding schemes are about 0.6dB from the Shannon Limit corrected for Binary Signalling.
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
1 Reader on Mendeley
by Discipline
by Academic Status
100% Senior Lecturer
by Country
100% United Kingdom