Causal compensation for erasures in frame representations

被引:6
作者
Boufounos, Petros [1 ,2 ]
Oppenheim, Alan V. [2 ]
Goyal, Vivek K. [2 ]
机构
[1] Rice Univ, Dept Elect & Comp Engn, Houston, TX 77251 USA
[2] MIT, Cambridge, MA 02139 USA
关键词
erasures; frames; overcomplete signal representations;
D O I
10.1109/TSP.2007.908963
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In a variety of signal processing and communications contexts, erasures occur inadvertently or can be intentionally introduced as part of a data reduction strategy. This paper discusses causal compensation for erasures in frame representations of signals. The approach described assumes linear synthesis of the signal using a prespecified frame but no specific generation mechanism for the coefficients. Under this assumption, it is demonstrated that erasures can be compensated for using low-complexity causal systems. If the transmitter is aware of the occurrence of the erasure,. an optimal compensation is to project the erasure error to the remaining coefficients. It is demonstrated that the same compensation can be executed using a transmitter/receiver combination in which the transmitter is not aware of the erasure occurrence. The transmitter precompensates using projections, as if assuming erasures will occur. The receiver undoes the compensation for the coefficients that have not been erased, thus maintaining the compensation only of the erased coefficients. The stability of the resulting systems is explored, and stability conditions are derived.-It is shown that stability for any erasure pattern can be enforced by optimizing a constrained quadratic program at the system design stage. The paper concludes with examples and simulations that verify the theoretical results and illustrate key issues in the algorithms.
引用
收藏
页码:1071 / 1082
页数:12
相关论文
共 25 条
[1]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[2]   Efficient reconstruction from frame-based multiple descriptions [J].
Bernardini, R ;
Rinaldo, R .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (08) :3282-3296
[3]   Frames, graphs and erasures [J].
Bodmann, BG ;
Paulsen, VI .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 404 :118-146
[4]   Quantization noise shaping on arbitrary frame expansions [J].
Boufounos, Petros T. ;
Oppenheim, Alan V. .
EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, 2006, 2006 (1) :1-12
[5]  
CASAZZA PG, 2003, ADV COMPUTAT MATH, P3887
[6]  
CHEN X, 1999, P 14 INT S PLASM CHE, V1, P61
[7]  
CHRISTENSEN O, 2002, INTRO FRAMES RIESZ B
[8]   Resilience properties of redundant expansions under additive noise and quantization [J].
Cvetkovic, Z .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (03) :644-656
[9]  
DAUBECIES I, 1992, 10 LECT WAVELETS SER
[10]   Precompensation for anticipated erasures in LTI interpolation systems [J].
Dey, SR ;
Russell, AI ;
Oppenheim, AV .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (01) :325-335