|
|
|
|
| LEADER |
01544 am a22002413u 4500 |
| 001 |
73595 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Huang, Ying-zong
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Huang, Ying-zong
|e contributor
|
| 100 |
1 |
0 |
|a Kochman, Yuval
|e contributor
|
| 100 |
1 |
0 |
|a Wornell, Gregory W.
|e contributor
|
| 700 |
1 |
0 |
|a Kochman, Yuval
|e author
|
| 700 |
1 |
0 |
|a Wornell, Gregory W.
|e author
|
| 245 |
0 |
0 |
|a Causal transmission of colored source frames over a packet erasure channel
|
| 260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2012-10-04T14:37:26Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/73595
|
| 520 |
|
|
|a We propose a linear predictive quantization system for causally transmitting parallel sources with temporal memory (colored frames) over an erasure channel. By optimizing within this structure, we derive an achievability result in the high-rate limit and compare it to an upper bound on performance. The proposed system subsumes the well-known PCM and DPCM systems as special cases. While typically DPCM performs well without erasures and PCM suffers less with many erasures, we show that the proposed solution improves performance over both under all severities of erasures, with unbounded improvement in some cases.
|
| 520 |
|
|
|a Microsoft Research (Grant)
|
| 520 |
|
|
|a Hewlett-Packard Company
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Proceedings of the Data Compression Conference (DCC), 2010
|
