Loading...
Please wait, while we are loading the content...
Similar Documents
Universal Bound on the Performance of Lattice Codes (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Tarokh, Vahid Vardy, Alexander Zeger, Kenneth |
| Abstract | We present a lower bound on the probability of symbol error for maximum-likelihood decoding of lattices and lattice codes on a Gaussian channel. The bound is tight for error probabilities and signal-to-noise ratios of practical interest, as opposed to most existing bounds that become tight asymptotically for high signal-to-noise ratios. The bound is also universal: it provides a limit on the highest possible coding gain that may be achieved, at specific symbol error probabilities, using any lattice or lattice code in n-dimensions. In particular, it is shown that the effective coding gains of the densest known lattices are much lower than their nominal coding gains, at practical symbol error rates of 10 \Gamma5 to 10 \Gamma7 . The asymptotic (as n ! 1) behavior of the new bound is shown to coincide with the Shannon limit for Gaussian channels. Keywords: lattices, lattice codes, coding gain, Gaussian channels, Shannon limit This work was supported in part by the National Science Fo... |
| File Format | |
| Volume Number | 45 |
| Journal | IEEE Trans. Inform. Theory |
| Language | English |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Lattice Code Universal Bound Gaussian Channel Shannon Limit High Signal-to-noise Ratio Existing Bound Symbol Error Signal-to-noise Ratio National Science Fo Known Lattice Practical Symbol Error Rate Practical Interest Nominal Coding Gain Effective Coding Gain Specific Symbol Error Probability Maximum-likelihood Decoding Error Probability New Bound |
| Content Type | Text |
| Resource Type | Article |
