Frames as Codes
This chapter reviews the development of finite frames as codes for erasures and additive noise. These types of errors typically occur when analog signals are transmitted in an unreliable environment. The use of frames allows one to recover the signal with
- PDF / 415,215 Bytes
- 26 Pages / 439.37 x 666.142 pts Page_size
- 52 Downloads / 236 Views
Frames as Codes Bernhard G. Bodmann
Abstract This chapter reviews the development of finite frames as codes for erasures and additive noise. These types of errors typically occur when analog signals are transmitted in an unreliable environment. The use of frames allows one to recover the signal with controllable accuracy from part of the encoded, noisy data. While linear binary codes have a long history in information theory, frames as codes over the real or complex numbers have only been examined since the 1980s. In the encoding process, a vector in a finite-dimensional real or complex Hilbert space is mapped to the sequence of its inner products with frame vectors. An erasure occurs when part of these frame coefficients is no longer accessible after the transmission. Additive noise can arise from the encoding process, such as when coefficients are rounded, or from the transmission. This chapter covers two of the most popular recovery algorithms: blind reconstruction, where missing coefficients are set to zero, and active error correction, which aims to recover the signal perfectly based on the known coefficients. The erasures can be modeled as either having a deterministic or a random occurrence pattern. In the deterministic regime it has been customary to optimize the frame performance in the worst-case scenario. Optimality for a small number of erasures then leads to geometric conditions such as the class of equiangular tight frames. Random erasure models are often used in conjunction with performance measures based on averaged reconstruction errors, such as the meansquared error. Frames as codes for erasures are also closely related to recent results on sparse recovery. Finally, fusion frames and packet erasures introduce an additional structure which imposes constraints on the construction of optimal frames. Keywords Frames · Parseval frames · Codes · Erasures · Worst-case error · Mean-squared error · Random frames · Protocols · Fusion frames · Packet erasures · Equi-isoclinic fusion frames · Equidistance fusion frames
B.G. Bodmann () Mathematics Department, University of Houston, 651 Philip G. Hoffman Hall, Houston, TX 77204-3008, USA e-mail: [email protected] P.G. Casazza, G. Kutyniok (eds.), Finite Frames, Applied and Numerical Harmonic Analysis, DOI 10.1007/978-0-8176-8373-3_7, © Springer Science+Business Media New York 2013
241
242
B.G. Bodmann
7.1 Introduction Digital signal communications are omnipresent, ranging from cell phone transmissions to streaming media such as Voice over Internet Protocol telephony, satellite radio, or Internet TV. In principle, digital error correction protocols can guarantee nearly faultless transmissions in the presence of noise and data loss. Much of the development of these protocols is inspired by Shannon’s seminal work of more than 60 years ago [42–44], in which he founded the theory of transmitting data through unreliable analog channels. However, today we typically face a problem outside of Shannon’s immediate concern: transmitting analog data such as audio or v
Data Loading...
