Name
Abstract | ||
|---|---|---|
In this letter, the Engdahl-Zigangirov (E&Z) bound is generalized to block-fading channels. For a quasi-static fading channel, we demonstrate that it is tighter than the Malkamaki-Leib (M&L) bound by about 1 dB. As the number of fading blocks M increases, the improvement of the bound lessens but the potential computation saving becomes more pronounced. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/LCOMM.2005.1496596 | IEEE Communications Letters |
Keywords | Field | DocType |
Fading,Binary phase shift keying,Maximum likelihood decoding,Modulation coding,Signal to noise ratio,Mobile communication,Laboratories,Turbo codes,Maximum likelihood detection | Data transmission,Fading,Computer science,Block code,Binary code,Turbo code,Computer network,Communication channel,Algorithm,Theoretical computer science,Computational complexity theory,Binary number | Journal |
Volume | Issue | ISSN |
9 | 8 | 1089-7798 |
Citations | PageRank | References |
3 | 0.39 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaofu Wu | 1 | 223 | 29.74 |
| Yuxin Cheng | 2 | 8 | 1.96 |
| Haige Xiang | 3 | 154 | 30.35 |