Recovering Lost Sensor Data through Compressed Sensing
|
|
- Bernice Goodman
- 5 years ago
- Views:
Transcription
1 Recovering Lost Sensor Data through Compressed Sensing Zainul Charbiwala Collaborators: Younghun Kim, Sadaf Zahedi, Supriyo Chakraborty, Ting He (IBM), Chatschik Bisdikian (IBM), Mani Srivastava
2 The Big Picture Lossy Communication Link 2
3 The Big Picture Lossy Communication Link 2
4 The Big Picture Lossy Communication Link 2
5 The Big Picture Lossy Communication Link How do we recover from this loss? 2
6 The Big Picture Lossy Communication Link How do we recover from this loss? Retransmit the lost packets 2
7 The Big Picture Lossy Communication Link How do we recover from this loss? Retransmit the lost packets 2
8 The Big Picture Generate Error Correction Bits Lossy Communication Link How do we recover from this loss? Retransmit the lost packets Proactively encode the data with some protection bits 2
9 The Big Picture Generate Error Correction Bits Lossy Communication Link How do we recover from this loss? Retransmit the lost packets Proactively encode the data with some protection bits 2
10 The Big Picture Generate Error Correction Bits Lossy Communication Link How do we recover from this loss? Retransmit the lost packets Proactively encode the data with some protection bits 2
11 The Big Picture Generate Error Correction Bits Lossy Communication Link How do we recover from this loss? Retransmit the lost packets Proactively encode the data with some protection bits Can we do something better? 2
12 The Big Picture - Using Compressed Sensing Lossy Communication Link CSEC 3
13 The Big Picture - Using Compressed Sensing Lossy Communication Link CSEC 3
14 The Big Picture - Using Compressed Sensing Generate Compressed Measurements Lossy Communication Link CSEC 3
15 The Big Picture - Using Compressed Sensing Generate Compressed Measurements Lossy Communication Link CSEC 3
16 The Big Picture - Using Compressed Sensing Generate Compressed Measurements Lossy Communication Link CSEC 3
17 The Big Picture - Using Compressed Sensing Generate Compressed Measurements Lossy Communication Link Recover from Received Compressed Measurements CSEC How does this work? 3
18 The Big Picture - Using Compressed Sensing Generate Compressed Measurements Lossy Communication Link Recover from Received Compressed Measurements CSEC How does this work? Use knowledge of signal model and channel 3
19 The Big Picture - Using Compressed Sensing Generate Compressed Measurements Lossy Communication Link Recover from Received Compressed Measurements CSEC How does this work? Use knowledge of signal model and channel CS uses randomized sampling/projections 3
20 The Big Picture - Using Compressed Sensing Generate Compressed Measurements How does this work? Lossy Communication Link Recover from Received Compressed Measurements CSEC Use knowledge of signal model and channel CS uses randomized sampling/projections Random losses look like additional randomness! 3
21 The Big Picture - Using Compressed Sensing Generate Compressed Measurements How does this work? Lossy Communication Link Recover from Received Compressed Measurements CSEC Use knowledge of signal model and channel CS uses randomized sampling/projections Random losses look like additional randomness! Rest of this talk focuses on describing How and How Well this works 3
22 Talk Outline A Quick Intro to Compressed Sensing Concluding Remarks CS Erasure Coding for Recovering Lost Sensor Data Evaluating CSEC s cost and performance 4
23 Why Compressed Sensing? Physical Signal Sampling Compression Communication Application 5
24 Why Compressed Sensing? Physical Signal Sampling Compression Communication Application Physical Signal Compressive Sampling Communication Decoding Application Shifts computation to a capable server 5
25 Transform Domain Analysis 6
26 Transform Domain Analysis We usually acquire signals in the time or spatial domain 6
27 Transform Domain Analysis We usually acquire signals in the time or spatial domain By looking at the signal in another domain, the signal may be represented more compactly 6
28 Transform Domain Analysis We usually acquire signals in the time or spatial domain By looking at the signal in another domain, the signal may be represented more compactly 6
29 Transform Domain Analysis We usually acquire signals in the time or spatial domain By looking at the signal in another domain, the signal may be represented more compactly Eg: a sine wave can be expressed by 3 parameters: frequency, amplitude and phase. 6
30 Transform Domain Analysis We usually acquire signals in the time or spatial domain By looking at the signal in another domain, the signal may be represented more compactly Eg: a sine wave can be expressed by 3 parameters: frequency, amplitude and phase. Or, in this case, by the index of the FFT coefficient and its complex value 6
31 Transform Domain Analysis We usually acquire signals in the time or spatial domain By looking at the signal in another domain, the signal may be represented more compactly Eg: a sine wave can be expressed by 3 parameters: frequency, amplitude and phase. Or, in this case, by the index of the FFT coefficient and its complex value Sine wave is sparse in frequency domain 6
32 Lossy Compression 7
33 Lossy Compression This is known as Transform Domain Compression 7
34 Lossy Compression This is known as Transform Domain Compression The domain in which the signal can be most compactly represented depends on the signal 7
35 Lossy Compression This is known as Transform Domain Compression The domain in which the signal can be most compactly represented depends on the signal The signal processing world has been coming up with domains for many classes of signals 7
36 Lossy Compression This is known as Transform Domain Compression The domain in which the signal can be most compactly represented depends on the signal The signal processing world has been coming up with domains for many classes of signals A necessary property for transforms is invertibility 7
37 Lossy Compression This is known as Transform Domain Compression The domain in which the signal can be most compactly represented depends on the signal The signal processing world has been coming up with domains for many classes of signals A necessary property for transforms is invertibility It would also be nice if there were efficient algorithms to convert the signals to transform between domains 7
38 Lossy Compression This is known as Transform Domain Compression The domain in which the signal can be most compactly represented depends on the signal The signal processing world has been coming up with domains for many classes of signals A necessary property for transforms is invertibility It would also be nice if there were efficient algorithms to convert the signals to transform between domains But why is it called lossy compression? 7
39 Lossy Compression When we transform the signal to the right domain, some coefficients stand out but lots will be near zero The top few coeffs describe the signal well enough 8
40 Lossy Compression When we transform the signal to the right domain, some coefficients stand out but lots will be near zero The top few coeffs describe the signal well enough 8
41 Lossy Compression When we transform the signal to the right domain, some coefficients stand out but lots will be near zero The top few coeffs describe the signal well enough 8
42 Lossy Compression 9
43 Lossy Compression JPEG (100%) : bytes, ~ 2x gain 9
44 Lossy Compression JPEG (100%) : bytes, ~ 2x gain JPEG (10%) : 7544 bytes, ~ 100x gain 9
45 Lossy Compression JPEG (100%) : bytes, ~ 2x gain JPEG (10%) : 7544 bytes, ~ 100x gain JPEG (1%) : 2942 bytes, ~ 260x gain 9
46 Compressing a Sine Wave 10
47 Compressing a Sine Wave Assume we re interesting in acquiring a single sine wave x(t) in a noiseless environment 10
48 Compressing a Sine Wave Assume we re interesting in acquiring a single sine wave x(t) in a noiseless environment An infinite duration sine wave can be expressed using three parameters: frequency f, amplitude a and phase φ. 10
49 Compressing a Sine Wave Assume we re interesting in acquiring a single sine wave x(t) in a noiseless environment An infinite duration sine wave can be expressed using three parameters: frequency f, amplitude a and phase φ. Question: What s the best way to find the parameters? 10
50 Compressing a Sine Wave 11
51 Compressing a Sine Wave Technically, to estimate three parameters one needs three good measurements 11
52 Compressing a Sine Wave Technically, to estimate three parameters one needs three good measurements Questions: 11
53 Compressing a Sine Wave Technically, to estimate three parameters one needs three good measurements Questions: What are good measurements? 11
54 Compressing a Sine Wave Technically, to estimate three parameters one needs three good measurements Questions: What are good measurements? How do you estimate f, a, φ from three measurements? 11
55 Compressed Sensing 12
56 Compressed Sensing With three samples: z 1, z2, z3 of the sine wave at times t1, t2, t3 12
57 Compressed Sensing With three samples: z 1, z2, z3 of the sine wave at times t1, t2, t3 We know that any solution of f, a and φ must meet the three constraints and spans a 3D space: 12
58 Compressed Sensing With three samples: z 1, z2, z3 of the sine wave at times t1, t2, t3 We know that any solution of f, a and φ must meet the three constraints and spans a 3D space: z i = x(t i ) = asin(2πft i + φ) i {1,2, 3} 12
59 Compressed Sensing With three samples: z 1, z2, z3 of the sine wave at times t1, t2, t3 We know that any solution of f, a and φ must meet the three constraints and spans a 3D space: z i = x(t i ) = asin(2πft i + φ) i {1,2, 3} Feasible solution space is much smaller φ a 12
60 Compressed Sensing With three samples: z 1, z2, z3 of the sine wave at times t1, t2, t3 We know that any solution of f, a and φ must meet the three constraints and spans a 3D space: z i = x(t i ) = asin(2πft i + φ) i {1,2, 3} Feasible solution space is much smaller As the number of constraints grows (from more measurements), the feasible solution space shrinks Exhaustive search over this space reveals the right answer φ a 12
61 Formulating the Problem We could also represent f, a and φ as a very long, but mostly empty FFT coefficient vector. 13
62 Formulating the Problem We could also represent f, a and φ as a very long, but mostly empty FFT coefficient vector. 13
63 Formulating the Problem We could also represent f, a and φ as a very long, but mostly empty FFT coefficient vector. x Sine wave. Amplitude represented by color 13
64 Formulating the Problem We could also represent f, a and φ as a very long, but mostly empty FFT coefficient vector. Ψ (Fourier Transform) x Sine wave. Amplitude represented by color 13
65 Formulating the Problem We could also represent f, a and φ as a very long, but mostly empty FFT coefficient vector. y = Ψ (Fourier Transform) x Sine wave. Amplitude represented by color 13
66 Formulating the Problem We could also represent f, a and φ as a very long, but mostly empty FFT coefficient vector. y = Ψ (Fourier Transform) x Sine wave. Amplitude represented by color j2π ft+φ ae 13
67 Sampling Matrix We could also write out the sampling process in matrix form 14
68 Sampling Matrix We could also write out the sampling process in matrix form x 14
69 Sampling Matrix We could also write out the sampling process in matrix form Φ x 14
70 Sampling Matrix We could also write out the sampling process in matrix form z = Φ x 14
71 Sampling Matrix We could also write out the sampling process in matrix form z = Φ x Three non-zero entries at some good locations 14
72 Sampling Matrix We could also write out the sampling process in matrix form Three measurements z = Φ x Three non-zero entries at some good locations 14
73 Sampling Matrix We could also write out the sampling process in matrix form Three measurements z = Φ k x n Three non-zero entries at some good locations 14
74 Exhaustive Search Objective of exhaustive search: Find an estimate of the vector y that meets the constraints and is the most compact representation of x (also called the sparsest representation) Our search is now guided by the fact that y is a sparse vector Rewriting constraints: z = Φx y = Ψx z = ΦΨ 1 y 15
75 Exhaustive Search Objective of exhaustive search: Find an estimate of the vector y that meets the constraints and is the most compact representation of x (also called the sparsest representation) Our search is now guided by the fact that y is a sparse vector Rewriting constraints: z = Φx y = Ψx z = ΦΨ 1 y ŷ = arg min y s.t. y 0 z = ΦΨ 1 y y 0 {i : y i 0} 15
76 Exhaustive Search Objective of exhaustive search: Find an estimate of the vector y that meets the constraints and is the most compact representation of x (also called the sparsest representation) Our search is now guided by the fact that y is a sparse vector Rewriting constraints: z = Φx y = Ψx z = ΦΨ 1 y ŷ = arg min y s.t. y 0 z = ΦΨ 1 y y 0 {i : y i 0} This optimization problem is NP-Hard! 15
77 l1 Minimization Approximate the l 0 norm to an l1 norm ŷ = argmin y s.t. y 1 z = ΦΨ 1 y y 1 = i y i This problem can now be solved efficiently using linear programming techniques This approximation was not new The big leap in Compressed Sensing was a theorem that showed that under the right conditions, this approximation was exact! 16
78 The Restricted Isometry Property ŷ = argmin y s.t. y 1 z = ΦΨ 1 y Rewrite as: z = A y For any positive integer constant s, find the smallest δ s such that: (1 δ s ) y 2 Ay 2 (1+ δ s ) y 2 holds for all s-sparse vectors y A vector is said to s-sparse if it has at most s non-zero entries 17
79 The Restricted Isometry Property ŷ = argmin y s.t. y 1 z = ΦΨ 1 y Rewrite as: z = A y For any positive integer constant s, find the smallest δ s such that: (1 δ s ) y 2 Ay 2 (1+ δ s ) y 2 holds for all s-sparse vectors y A vector is said to s-sparse if it has at most s non-zero entries The closer δ s (A) is to 0, the better the matrix combination A is at capturing unique features of the signal 17
80 CS Recovery Theorem Theorem: Assume that δ s (A) < 2-1 for some matrix A, then the solution to the l1 minimization problem obeys: [Candes-Romberg- Tao-05] ŷ y l1 C 0 for some small positive constant C 0 ŷ y s l1 ŷ y l 2 C 0 s ŷ y s l1 y s is an approximation of a non-sparse vector with only its s-largest entries If y is s-sparse, the reconstruction is exact 18
81 Gaussian Random Projections Gaussian: independent realizations of N (0, 1 n ) * y 19
82 Gaussian Random Projections Gaussian: independent realizations of N (0, 1 n ) Ψ -1 (Inverse Fourier Transform) * y 19
83 Gaussian Random Projections Gaussian: independent realizations of N (0, 1 n ) Φ * Ψ -1 (Inverse Fourier Transform) * y 19
84 Gaussian Random Projections Gaussian: independent realizations of N (0, 1 n ) z = Φ * Ψ -1 (Inverse Fourier Transform) * y 19
85 Bernoulli Random Projections Realizations of equiprobable Bernoulli RV z = Φ +1 n, 1 n * Ψ -1 (Inverse Fourier Transform) * y 20
86 Uniform Random Sampling Select samples uniformly randomly z = Φ * Ψ -1 (Inverse Fourier Transform) * y 21
87 Per-Module Energy Consumption on Mica 23456(789: %! $! #! "! ;<= >?) 001 ;D<<A<E(1A85(78F:! "!!! C+! +!! #+!! "!&'( )* "!&'( )* #!&'( )* #!&'( )* $!&'( )* $!&'( )* #+!&' )* #+!&' )* "!#%&',-.* ;<= >?) 001 "!#%&',-.* "!#%&',*/001 "!#%&',*/001 FFT computation higher than transmission cost Highest consumer in CS is the random number generator 22
88 Compressive Sampling Physical Signal x n Sampling z = I n x Time domain samples Physical Signal x n Compressive Sampling z = Φx k x n k < n Randomized measurements 23
89 Compressive Sampling Physical Signal x n Sampling z = I n x Compression y = Ψz n x n Compressed domain samples Physical Signal x n Compressive Sampling z = Φx k x n k < n Decoding y = argmin y y 1 s.t. z = ΦΨ 1 y Compressed domain samples 24
90 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples 25
91 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples Communication Missing samples When communication channel is lossy: 25
92 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples Communication Missing samples When communication channel is lossy: Use retransmissions to recover lost data 25
93 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples Communication Missing samples When communication channel is lossy: Use retransmissions to recover lost data Or, use error (erasure) correcting codes 25
94 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples Communication Missing samples 26
95 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples Channel Coding Communication Channel Missing Decoding samples Recovered compressed domain samples 26
96 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples Channel Coding w = Ωy m x n m > n Communication w l = Cw Channel Missing Decoding samples ŷ = ( CΩ) + w l Recovered compressed domain samples 26
97 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples Done at application layer Channel Coding w = Ωy m x n m > n Communication w l = Cw Channel Missing Decoding samples ŷ = ( CΩ) + w l Recovered compressed domain samples 26
98 Handling Missing Data Physical Signal Sampling Compression x n z = I n x y = Ψz n x n Compressed domain samples Done at application layer Channel Coding w = Ωy m x n m > n Communication w l = Cw Channel Missing Decoding samples ( ) + w l ŷ = CΩ Done at physical layer Can t exploit signal characteristics Recovered compressed domain samples 26
99 CS Erasure Coding Physical Signal x n Compressive Sampling z = Φx k x n k < n Communication z l = Cz Decoding y = argmin y y 1 s.t. z l = CΦΨ 1 y Compressed domain samples 27
100 CS Erasure Coding Physical Signal x n Compressive Sampling z = Φx k x n k < n Communication z l = Cz Decoding y = argmin y y 1 s.t. z l = CΦΨ 1 y Compressed domain samples Physical Signal x n Compressive Sampling z = Φx m x n k < m < n Communication z l = Cz Decoding y = argmin y y 1 s.t. z l = CΦΨ 1 y Compressed domain samples 27
101 CS Erasure Coding Physical Signal x n Compressive Sampling z = Φx k x n k < n Over-sampling in CS is Erasure Coding! Communication z l = Cz Decoding y = argmin y y 1 s.t. z l = CΦΨ 1 y Compressed domain samples Physical Signal x n Compressive Sampling z = Φx m x n k < m < n Communication z l = Cz Decoding y = argmin y y 1 s.t. z l = CΦΨ 1 y Compressed domain samples 27
102 Features of CS Erasure Coding No need of additional channel coding block Redundancy achieved by oversampling Recovery is resilient to incorrect channel estimates Traditional channel coding fails if redundancy is inadequate Decoding is free if CS was used for compression anyway 28
103 Features of CS Erasure Coding No need of additional channel coding block Redundancy achieved by oversampling Recovery is resilient to incorrect channel estimates Traditional channel coding fails if redundancy is inadequate Decoding is free if CS was used for compression anyway Intuition: Channel Coding spreads information out over measurements Compression (Source Coding) - compact information in few measurements CSEC - spreads information while compacting! 28
104 Effects of Missing Samples on CS z = Φ x 29
105 Effects of Missing Samples on CS z = Φ x Missing samples at the receiver 29
106 Effects of Missing Samples on CS z = Φ x Missing samples at the receiver Same as missing rows in the sampling matrix 29
107 Effects of Missing Samples on CS z = Φ x What happens if we over-sample? 29
108 Effects of Missing Samples on CS z = Φ x What happens if we over-sample? Can we recover the lost data? 29
109 Effects of Missing Samples on CS z = Φ x What happens if we over-sample? Can we recover the lost data? How much over-sampling is needed? 29
110 Some CS Results Theorem: If k samples of a length n signal are acquired uniformly randomly (if each sample is equiprobable) and reconstruction is performed in the Fourier basis: [Rudelson06] s C k log 4 (n) w.h.p. Where s is the sparsity of the signal 30
111 Extending CS Results Claim: When m>k samples are acquired uniformly randomly and communicated through a memoryless binary erasure channel that drops m-k samples, the received k samples are still equiprobable. Implies that bound on sparsity condition should hold. If bound is tight, over-sampling rate (m-k) is same as loss rate [Charbiwala10] 31
112 Evaluating the RIP Create CS Sampling+Domain Matrix Φ Simulate Channel * Compute RIP constant of received matrix Ψ -1 (Inverse Fourier Transform) 10 3 instances, size 256x
113 Evaluating the RIP Create CS Sampling+Domain Matrix A= Φ* Ψ -1 Simulate Channel Compute RIP constant of received matrix 10 3 instances, size 256x
114 Evaluating the RIP Create CS Sampling+Domain Matrix Simulate Channel Compute RIP constant of received matrix A= Φ* Ψ -1 A = C*Φ* Ψ instances, size 256x
115 RIP Verification in Memoryless Channels Fourier Random Sampling Baseline performance - No Loss (Shading: Min - Max) 33
116 RIP Verification in Memoryless Channels Fourier Random Sampling Baseline performance - No Loss (Shading: Min - Max) 20 % Loss - Increase in RIP constant 33
117 RIP Verification in Memoryless Channels Fourier Random Sampling Baseline performance - No Loss (Shading: Min - Max) 20 % Loss - Increase in RIP constant 20 % Oversampling - RIP constant recovers 33
118 RIP Verification in Bursty Channels Fourier Random Sampling Baseline performance - No Loss (Shading: Min - Max) 34
119 RIP Verification in Bursty Channels Fourier Random Sampling Baseline performance - No Loss (Shading: Min - Max) 20 % Loss - Increase in RIP constant and large variation 34
120 RIP Verification in Bursty Channels Fourier Random Sampling Baseline performance - No Loss (Shading: Min - Max) 20 % Loss - Increase in RIP constant and large variation 20 % Oversampling - RIP constant reduces but doesn t recover 34
121 RIP Verification in Bursty Channels Fourier Random Sampling Baseline performance - No Loss (Shading: Min - Max) 20 % Loss - Increase in RIP constant and large variation 20 % Oversampling - RIP constant reduces but doesn t recover Oversampling + Interleaving - RIP constant recovers 34
122 Signal Recovery Performance Evaluation Create Signal CS Sampling Interleave Samples Lossy Channel CS Recovery Reconstruction Error? 35
123 In Memoryless Channels Baseline performance - No Loss 36
124 In Memoryless Channels Baseline performance - No Loss 20 % Loss - Drop in recovery probability 36
125 In Memoryless Channels Baseline performance - No Loss 20 % Loss - Drop in recovery probability 20 % Oversampling - complete recovery 36
126 In Memoryless Channels Baseline performance - No Loss 20 % Loss - Drop in recovery probability 20 % Oversampling - complete recovery Less than 20 % Oversampling - recovery does not fail completely 36
127 In Bursty Channels Baseline performance - No Loss 37
128 In Bursty Channels Baseline performance - No Loss 20 % Loss - Drop in recovery probability 37
129 In Bursty Channels Baseline performance - No Loss 20 % Loss - Drop in recovery probability 20 % Oversampling - doesn t recover completely 37
130 In Bursty Channels Baseline performance - No Loss Oversampling + Interleaving - Still incomplete recovery 20 % Loss - Drop in recovery probability 20 % Oversampling - doesn t recover completely 37
131 In Bursty Channels Worse than baseline Baseline performance - No Loss Oversampling + Interleaving - Still incomplete recovery 20 % Loss - Drop in recovery probability 20 % Oversampling - doesn t recover completely Better than baseline Recovery incomplete because of low interleaving depth Recovery better at high sparsity because bursty channels deliver bigger packets on average, but with higher variance 37
132 In Bursty Channels Worse than baseline Baseline performance - No Loss Oversampling + Interleaving - Still incomplete recovery 20 % Loss - Drop in recovery probability 20 % Oversampling - doesn t recover completely Better than baseline Recovery incomplete because of low interleaving depth Recovery better at high sparsity because bursty channels deliver bigger packets on average, but with higher variance 37
133 In Real Channel Baseline performance - No Loss 38
134 In Real Channel Baseline performance - No Loss 20 % Loss - Drop in recovery probability 38
135 In Real Channel Baseline performance - No Loss 20 % Loss - Drop in recovery probability 20 % Oversampling - complete recovery 38
136 In Real Channel Baseline performance - No Loss 20 % Loss - Drop in recovery probability 20 % Oversampling - complete recovery Less than 20 % Oversampling - recovery does not fail completely 38
137 Cost of CSEC 5 Rnd ADC FFT Radio TX RS 4 Energy/block (mj) m=256 S-n-S m=10 C-n-S m=64 CS k=320 S-n-S+RS k=16 C-n-S+RS k=80 CSEC Sense and Send Sense, Compress (FFT) and Send CS and Send (1/4 th rate) Sense and Send with Reed Solomon Sense, Compress and Send with RS CSEC and Send 39
138 Cost of CSEC 5 Rnd ADC FFT Radio TX RS 4 Energy/block (mj) m=256 S-n-S m=10 C-n-S m=64 CS k=320 S-n-S+RS k=16 C-n-S+RS k=80 CSEC Sense and Send Sense, Compress (FFT) and Send CS and Send (1/4 th rate) Sense and Send with Reed Solomon Sense, Compress and Send with RS CSEC and Send 39
139 Summary Oversampling is a valid erasure coding strategy for compressive reconstruction For binary erasure channels, an oversampling rate equal to loss rate is sufficient (empirical) CS erasure coding can be rate-less like fountain codes Allows adaptation to varying channel conditions Can be computationally more efficient than traditional erasure codes 40
140 Closing Remarks CSEC spreads information out while compacting No free lunch syndrome: Data rate requirement is higher than if using good source and channel coding independently But, then, computation cost is higher too This can be done using over-sampling too Can use CS streaming with feedback CSEC requires knowledge of signal model If signal is non-stationary, model needs to be updated during recovery CSEC requires knowledge of channel conditions 41
141 Thank You
Beyond Nyquist. Joel A. Tropp. Applied and Computational Mathematics California Institute of Technology
Beyond Nyquist Joel A. Tropp Applied and Computational Mathematics California Institute of Technology jtropp@acm.caltech.edu With M. Duarte, J. Laska, R. Baraniuk (Rice DSP), D. Needell (UC-Davis), and
More informationCompressed Sensing for Multiple Access
Compressed Sensing for Multiple Access Xiaodai Dong Wireless Signal Processing & Networking Workshop: Emerging Wireless Technologies, Tohoku University, Sendai, Japan Oct. 28, 2013 Outline Background Existing
More informationCompressive Coded Aperture Superresolution Image Reconstruction
Compressive Coded Aperture Superresolution Image Reconstruction Roummel F. Marcia and Rebecca M. Willett Department of Electrical and Computer Engineering Duke University Research supported by DARPA and
More informationEnergy-Effective Communication Based on Compressed Sensing
American Journal of etworks and Communications 2016; 5(6): 121-127 http://www.sciencepublishinggroup.com//anc doi: 10.11648/.anc.20160506.11 ISS: 2326-893X (Print); ISS: 2326-8964 (Online) Energy-Effective
More informationEffects of Basis-mismatch in Compressive Sampling of Continuous Sinusoidal Signals
Effects of Basis-mismatch in Compressive Sampling of Continuous Sinusoidal Signals Daniel H. Chae, Parastoo Sadeghi, and Rodney A. Kennedy Research School of Information Sciences and Engineering The Australian
More informationEXACT SIGNAL RECOVERY FROM SPARSELY CORRUPTED MEASUREMENTS
EXACT SIGNAL RECOVERY FROM SPARSELY CORRUPTED MEASUREMENTS THROUGH THE PURSUIT OF JUSTICE Jason Laska, Mark Davenport, Richard Baraniuk SSC 2009 Collaborators Mark Davenport Richard Baraniuk Compressive
More informationOn-Mote Compressive Sampling in Wireless Seismic Sensor Networks
On-Mote Compressive Sampling in Wireless Seismic Sensor Networks Marc J. Rubin Computer Science Ph.D. Candidate Department of Electrical Engineering and Computer Science Colorado School of Mines mrubin@mines.edu
More informationCompressive Imaging: Theory and Practice
Compressive Imaging: Theory and Practice Mark Davenport Richard Baraniuk, Kevin Kelly Rice University ECE Department Digital Revolution Digital Acquisition Foundation: Shannon sampling theorem Must sample
More informationDigital Transmission using SECC Spring 2010 Lecture #7. (n,k,d) Systematic Block Codes. How many parity bits to use?
Digital Transmission using SECC 6.02 Spring 2010 Lecture #7 How many parity bits? Dealing with burst errors Reed-Solomon codes message Compute Checksum # message chk Partition Apply SECC Transmit errors
More informationSingle Error Correcting Codes (SECC) 6.02 Spring 2011 Lecture #9. Checking the parity. Using the Syndrome to Correct Errors
Single Error Correcting Codes (SECC) Basic idea: Use multiple parity bits, each covering a subset of the data bits. No two message bits belong to exactly the same subsets, so a single error will generate
More informationSignal Recovery from Random Measurements
Signal Recovery from Random Measurements Joel A. Tropp Anna C. Gilbert {jtropp annacg}@umich.edu Department of Mathematics The University of Michigan 1 The Signal Recovery Problem Let s be an m-sparse
More informationJICE: Joint Data Compression and Encryption for Wireless Energy Auditing Networks
JICE: Joint Data Compression and Encryption for Wireless Energy Auditing Networks Sheng-Yuan Chiu 1,2, Hoang Hai Nguyen 1, Rui Tan 1, David K.Y. Yau 1,3,Deokwoo Jung 1 1 Advanced Digital Science Center,
More informationDemocracy in Action. Quantization, Saturation, and Compressive Sensing!"#$%&'"#("
Democracy in Action Quantization, Saturation, and Compressive Sensing!"#$%&'"#(" Collaborators Petros Boufounos )"*(&+",-%.$*/ 0123"*4&5"*"%16( Background If we could first know where we are, and whither
More informationCompressive Through-focus Imaging
PIERS ONLINE, VOL. 6, NO. 8, 788 Compressive Through-focus Imaging Oren Mangoubi and Edwin A. Marengo Yale University, USA Northeastern University, USA Abstract Optical sensing and imaging applications
More informationCompressive Sampling with R: A Tutorial
1/15 Mehmet Süzen msuzen@mango-solutions.com data analysis that delivers 15 JUNE 2011 2/15 Plan Analog-to-Digital conversion: Shannon-Nyquist Rate Medical Imaging to One Pixel Camera Compressive Sampling
More informationCompressive Sensing based Asynchronous Random Access for Wireless Networks
Compressive Sensing based Asynchronous Random Access for Wireless Networks Vahid Shah-Mansouri, Suyang Duan, Ling-Hua Chang, Vincent W.S. Wong, and Jwo-Yuh Wu Department of Electrical and Computer Engineering,
More informationWAVELET-BASED COMPRESSED SPECTRUM SENSING FOR COGNITIVE RADIO WIRELESS NETWORKS. Hilmi E. Egilmez and Antonio Ortega
WAVELET-BASED COPRESSED SPECTRU SENSING FOR COGNITIVE RADIO WIRELESS NETWORKS Hilmi E. Egilmez and Antonio Ortega Signal & Image Processing Institute, University of Southern California, Los Angeles, CA,
More informationAn Energy Efficient Compressed Sensing Framework for the Compression of Electroencephalogram Signals
Sensors 2014, 14, 1474-1496; doi:10.3390/s140101474 OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journal/sensors Article An Energy Efficient Compressed Sensing Framework for the Compression of Electroencephalogram
More informationBackground Dirty Paper Coding Codeword Binning Code construction Remaining problems. Information Hiding. Phil Regalia
Information Hiding Phil Regalia Department of Electrical Engineering and Computer Science Catholic University of America Washington, DC 20064 regalia@cua.edu Baltimore IEEE Signal Processing Society Chapter,
More informationPerformance Analysis of Threshold Based Compressive Sensing Algorithm in Wireless Sensor Network
American Journal of Applied Sciences Original Research Paper Performance Analysis of Threshold Based Compressive Sensing Algorithm in Wireless Sensor Network Parnasree Chakraborty and C. Tharini Department
More informationThe Capability of Error Correction for Burst-noise Channels Using Error Estimating Code
The Capability of Error Correction for Burst-noise Channels Using Error Estimating Code Yaoyu Wang Nanjing University yaoyu.wang.nju@gmail.com June 10, 2016 Yaoyu Wang (NJU) Error correction with EEC June
More informationFrugal Sensing Spectral Analysis from Power Inequalities
Frugal Sensing Spectral Analysis from Power Inequalities Nikos Sidiropoulos Joint work with Omar Mehanna IEEE SPAWC 2013 Plenary, June 17, 2013, Darmstadt, Germany Wideband Spectrum Sensing (for CR/DSM)
More informationThe Scientist and Engineer's Guide to Digital Signal Processing By Steven W. Smith, Ph.D.
The Scientist and Engineer's Guide to Digital Signal Processing By Steven W. Smith, Ph.D. Home The Book by Chapters About the Book Steven W. Smith Blog Contact Book Search Download this chapter in PDF
More informationAn Introduction to Compressive Sensing and its Applications
International Journal of Scientific and Research Publications, Volume 4, Issue 6, June 2014 1 An Introduction to Compressive Sensing and its Applications Pooja C. Nahar *, Dr. Mahesh T. Kolte ** * Department
More informationSensing via Dimensionality Reduction Structured Sparsity Models
Sensing via Dimensionality Reduction Structured Sparsity Models Volkan Cevher volkan@rice.edu Sensors 1975-0.08MP 1957-30fps 1877 -? 1977 5hours 160MP 200,000fps 192,000Hz 30mins Digital Data Acquisition
More informationImproved Random Demodulator for Compressed Sensing Applications
Purdue University Purdue e-pubs Open Access Theses Theses and Dissertations Summer 2014 Improved Random Demodulator for Compressed Sensing Applications Sathya Narayanan Hariharan Purdue University Follow
More informationDistributed Compressed Sensing of Jointly Sparse Signals
Distributed Compressed Sensing of Jointly Sparse Signals Marco F. Duarte, Shriram Sarvotham, Dror Baron, Michael B. Wakin and Richard G. Baraniuk Department of Electrical and Computer Engineering, Rice
More informationThe Design of Compressive Sensing Filter
The Design of Compressive Sensing Filter Lianlin Li, Wenji Zhang, Yin Xiang and Fang Li Institute of Electronics, Chinese Academy of Sciences, Beijing, 100190 Lianlinli1980@gmail.com Abstract: In this
More informationHigh Resolution Radar Sensing via Compressive Illumination
High Resolution Radar Sensing via Compressive Illumination Emre Ertin Lee Potter, Randy Moses, Phil Schniter, Christian Austin, Jason Parker The Ohio State University New Frontiers in Imaging and Sensing
More informationVolume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationWireless Communication Systems: Implementation perspective
Wireless Communication Systems: Implementation perspective Course aims To provide an introduction to wireless communications models with an emphasis on real-life systems To investigate a major wireless
More informationCollaborative Compressive Spectrum Sensing in a UAV Environment
Collaborative Compressive Spectrum Sensing in a UAV Environment Hsieh-Chung Chen, H. T. Kung, Dario Vlah, Daniel Hague, Michael Muccio and Brendon Poland Harvard University, Cambridge, MA 2138 Air Force
More informationSPARSE TARGET RECOVERY PERFORMANCE OF MULTI-FREQUENCY CHIRP WAVEFORMS
9th European Signal Processing Conference EUSIPCO 2) Barcelona, Spain, August 29 - September 2, 2 SPARSE TARGET RECOVERY PERFORMANCE OF MULTI-FREQUENCY CHIRP WAVEFORMS Emre Ertin, Lee C. Potter, and Randolph
More informationPhil Schniter and Jason Parker
Parametric Bilinear Generalized Approximate Message Passing Phil Schniter and Jason Parker With support from NSF CCF-28754 and an AFOSR Lab Task (under Dr. Arje Nachman). ITA Feb 6, 25 Approximate Message
More informationCS4495/6495 Introduction to Computer Vision. 2C-L3 Aliasing
CS4495/6495 Introduction to Computer Vision 2C-L3 Aliasing Recall: Fourier Pairs (from Szeliski) Fourier Transform Sampling Pairs FT of an impulse train is an impulse train Sampling and Aliasing Sampling
More informationOptimization Techniques for Alphabet-Constrained Signal Design
Optimization Techniques for Alphabet-Constrained Signal Design Mojtaba Soltanalian Department of Electrical Engineering California Institute of Technology Stanford EE- ISL Mar. 2015 Optimization Techniques
More informationCOMPRESSIVE SENSING IN WIRELESS COMMUNICATIONS
COMPRESSIVE SENSING IN WIRELESS COMMUNICATIONS A Dissertation Presented to the Faculty of the Electrical and Computer Engineering Department University of Houston in Partial Fulfillment of the Requirements
More informationCompressive Sensing Using Random Demodulation
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Masters Theses Graduate School 8-2009 Compressive Sensing Using Random Demodulation Benjamin Scott Boggess University
More informationCompressive Orthogonal Frequency Division Multiplexing Waveform based Ground Penetrating Radar
Compressive Orthogonal Frequency Division Multiplexing Waveform based Ground Penetrating Radar Yu Zhang 1, Guoan Wang 2 and Tian Xia 1 Email: yzhang19@uvm.edu, gwang@cec.sc.edu and txia@uvm.edu 1 School
More informationDIGITALLY-ASSISTED MIXED-SIGNAL WIDEBAND COMPRESSIVE SENSING. A Dissertation ZHUIZHUAN YU DOCTOR OF PHILOSOPHY
DIGITALLY-ASSISTED MIXED-SIGNAL WIDEBAND COMPRESSIVE SENSING A Dissertation by ZHUIZHUAN YU Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements
More informationEmpirical Rate-Distortion Study of Compressive Sensing-based Joint Source-Channel Coding
Empirical -Distortion Study of Compressive Sensing-based Joint Source-Channel Coding Muriel L. Rambeloarison, Soheil Feizi, Georgios Angelopoulos, and Muriel Médard Research Laboratory of Electronics Massachusetts
More informationMinimax Universal Sampling for Compound Multiband Channels
ISIT 2013, Istanbul July 9, 2013 Minimax Universal Sampling for Compound Multiband Channels Yuxin Chen, Andrea Goldsmith, Yonina Eldar Stanford University Technion Capacity of Undersampled Channels Point-to-point
More informationSuper-Resolution and Reconstruction of Sparse Sub-Wavelength Images
Super-Resolution and Reconstruction of Sparse Sub-Wavelength Images Snir Gazit, 1 Alexander Szameit, 1 Yonina C. Eldar, 2 and Mordechai Segev 1 1. Department of Physics and Solid State Institute, Technion,
More informationDigital Television Lecture 5
Digital Television Lecture 5 Forward Error Correction (FEC) Åbo Akademi University Domkyrkotorget 5 Åbo 8.4. Error Correction in Transmissions Need for error correction in transmissions Loss of data during
More informationOpen Access Research of Dielectric Loss Measurement with Sparse Representation
Send Orders for Reprints to reprints@benthamscience.ae 698 The Open Automation and Control Systems Journal, 2, 7, 698-73 Open Access Research of Dielectric Loss Measurement with Sparse Representation Zheng
More informationNon-uniform sampling and reconstruction of multi-band signals and its application in wideband spectrum sensing of cognitive radio
Non-uniform sampling and reconstruction of multi-band signals and its application in wideband spectrum sensing of cognitive radio MOSLEM RASHIDI Signal Processing Group Department of Signals and Systems
More informationLab/Project Error Control Coding using LDPC Codes and HARQ
Linköping University Campus Norrköping Department of Science and Technology Erik Bergfeldt TNE066 Telecommunications Lab/Project Error Control Coding using LDPC Codes and HARQ Error control coding is an
More informationProgress In Electromagnetics Research B, Vol. 17, , 2009
Progress In Electromagnetics Research B, Vol. 17, 255 273, 2009 THE COMPRESSED-SAMPLING FILTER (CSF) L. Li, W. Zhang, Y. Xiang, and F. Li Institute of Electronics Chinese Academy of Sciences Beijing, China
More informationLec 19 Error and Loss Control I: FEC
Multimedia Communication Lec 19 Error and Loss Control I: FEC Zhu Li Course Web: http://l.web.umkc.edu/lizhu/teaching/ Z. Li, Multimedia Communciation, Spring 2017 p.1 Outline ReCap Lecture 18 TCP Congestion
More informationCompressed Meter Reading for Delay-sensitive and Secure Load Report in Smart Grid
Compressed Meter Reading for Delay-sensitive Secure Load Report in Smart Grid Husheng Li, Rukun Mao, Lifeng Lai Robert. C. Qiu Abstract It is a key task in smart grid to send the readings of smart meters
More informationVolcanic Earthquake Timing Using Wireless Sensor Networks
Volcanic Earthquake Timing Using Wireless Sensor Networks GuojinLiu 1,2 RuiTan 2,3 RuoguZhou 2 GuoliangXing 2 Wen-Zhan Song 4 Jonathan M. Lees 5 1 Chongqing University, P.R. China 2 Michigan State University,
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of OFDM under DWT, DCT based Image Processing Anshul Soni soni.anshulec14@gmail.com Ashok Chandra Tiwari Abstract In this paper, the performance of conventional discrete cosine transform
More informationPhysical Layer: Modulation, FEC. Wireless Networks: Guevara Noubir. S2001, COM3525 Wireless Networks Lecture 3, 1
Wireless Networks: Physical Layer: Modulation, FEC Guevara Noubir Noubir@ccsneuedu S, COM355 Wireless Networks Lecture 3, Lecture focus Modulation techniques Bit Error Rate Reducing the BER Forward Error
More informationUsing of compressed sensing in energy sensitive WSN applications
Proceedings of the Federated Conference on Computer Science and Information Systems pp. 1233 1238 DOI: 10.15439/2015F167 ACSIS, Vol. 5 Using of compressed sensing in energy sensitive WSN applications Ondrej
More informationarxiv: v2 [eess.iv] 11 Jan 2018
Image Acquisition System Using On Sensor Compressed Sampling Technique Pravir Singh Gupta a, Gwan Seong Choi a a Texas A&M University, Department of Electrical and Computer Engineering, College Station,
More informationUltrawideband Compressed Sensing: Channel Estimation
1 Ultrawideband Compressed Sensing: Channel Estimation Jose L. Paredes, Gonzalo R. Arce, Zhongmin Wang Electrical Engineering Department, Universidad de Los Andes, Mérida, 5101 Venezuela (e-mail:paredesj@ula.ve)
More informationFrom Fountain to BATS: Realization of Network Coding
From Fountain to BATS: Realization of Network Coding Shenghao Yang Jan 26, 2015 Shenzhen Shenghao Yang Jan 26, 2015 1 / 35 Outline 1 Outline 2 Single-Hop: Fountain Codes LT Codes Raptor codes: achieving
More informationDetection Performance of Compressively Sampled Radar Signals
Detection Performance of Compressively Sampled Radar Signals Bruce Pollock and Nathan A. Goodman Department of Electrical and Computer Engineering The University of Arizona Tucson, Arizona brpolloc@email.arizona.edu;
More informationImproved Compressive Sensing of Natural Scenes Using Localized Random Sampling
Improved Compressive Sensing of Natural Scenes Using Localized Random Sampling Victor J. Barranca 1, Gregor Kovačič 2 Douglas Zhou 3, David Cai 3,4,5 1 Department of Mathematics and Statistics, Swarthmore
More informationData Acquisition through joint Compressive Sensing and Principal Component Analysis
Data Acquisition through joint Compressive Sensing and Principal Component Analysis Riccardo Masiero, Giorgio Quer, Daniele Munaretto, Michele Rossi, Joerg Widmer, Michele Zorzi Abstract In this paper
More informationSub-Nyquist Sampling of Short Pulses
1134 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 3, MARCH 2012 Sub-Nyquist Sampling of Short Pulses Ewa Matusiak and Yonina C. Eldar, Senior Member, IEEE Abstract We develop sub-nyquist sampling
More informationCourse Developer: Ranjan Bose, IIT Delhi
Course Title: Coding Theory Course Developer: Ranjan Bose, IIT Delhi Part I Information Theory and Source Coding 1. Source Coding 1.1. Introduction to Information Theory 1.2. Uncertainty and Information
More informationCooperative Compressed Sensing for Decentralized Networks
Cooperative Compressed Sensing for Decentralized Networks Zhi (Gerry) Tian Dept. of ECE, Michigan Tech Univ. A presentation at ztian@mtu.edu February 18, 2011 Ground-Breaking Recent Advances (a1) s is
More informationRate-Adaptive Compressed-Sensing and Sparsity Variance of Biomedical Signals
Rate-Adaptive Compressed- and Sparsity Variance of Biomedical Signals Vahid Behravan, Neil E. Glover, Rutger Farry, Patrick Y. Chiang Oregon State University Corvallis, OR, USA {behravav,gloverne,farryr,pchiang}@onid.oregonstate.edu
More informationCompressive Sensing with Optimal Sparsifying Basis and Applications in Spectrum Sensing
Compressive Sensing with Optimal Sparsifying Basis and Applications in Spectrum Sensing Youngjune Gwon, H. T. Kung, and Dario Vlah Harvard University Abstract We describe a method of integrating Karhunen-
More informationAUDIO COMPRESSION USING DCT & CS
AUDIO COMPRESSION USING DCT & CS 1 MR. SUSHILKUMAR BAPUSAHEB SHINDE, 2 PROF. MR. RAKESH MANDLIYA 1 M. Tech. (VLSI), BMCT Indore, Madhya Pradesh, India, sushilkumarshinde69@gmail.com 2 Head of EC Department,
More informationChapter 2 Distributed Consensus Estimation of Wireless Sensor Networks
Chapter 2 Distributed Consensus Estimation of Wireless Sensor Networks Recently, consensus based distributed estimation has attracted considerable attention from various fields to estimate deterministic
More informationDesign and Implementation of Compressive Sensing on Pulsed Radar
44, Issue 1 (2018) 15-23 Journal of Advanced Research in Applied Mechanics Journal homepage: www.akademiabaru.com/aram.html ISSN: 2289-7895 Design and Implementation of Compressive Sensing on Pulsed Radar
More informationCompressive Sensing Multi-spectral Demosaicing from Single Sensor Architecture. Hemant Kumar Aggarwal and Angshul Majumdar
Compressive Sensing Multi-spectral Demosaicing from Single Sensor Architecture Hemant Kumar Aggarwal and Angshul Majumdar Indraprastha Institute of Information echnology Delhi ABSRAC his paper addresses
More informationIMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING.
IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. COMPACT LECTURE NOTES on COMMUNICATION THEORY. Prof. Athanassios Manikas, version Spring 22 Digital
More informationSAMPLING THEORY. Representing continuous signals with discrete numbers
SAMPLING THEORY Representing continuous signals with discrete numbers Roger B. Dannenberg Professor of Computer Science, Art, and Music Carnegie Mellon University ICM Week 3 Copyright 2002-2013 by Roger
More informationHardware Implementation of Proposed CAMP algorithm for Pulsed Radar
45, Issue 1 (2018) 26-36 Journal of Advanced Research in Applied Mechanics Journal homepage: www.akademiabaru.com/aram.html ISSN: 2289-7895 Hardware Implementation of Proposed CAMP algorithm for Pulsed
More informationScaling Network- based Spectrum Analyzer with Constant Communica<on Cost
Scaling Network- based Spectrum Analyzer with Constant Communica
More informationReliable Wireless Video Streaming with Digital Fountain Codes
1 Reliable Wireless Video Streaming with Digital Fountain Codes Raouf Hamzaoui, Shakeel Ahmad, Marwan Al-Akaidi Faculty of Computing Sciences and Engineering, De Montfort University - UK Department of
More informationOutline. Communications Engineering 1
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband channels Signal space representation Optimal
More informationComputing and Communications 2. Information Theory -Channel Capacity
1896 1920 1987 2006 Computing and Communications 2. Information Theory -Channel Capacity Ying Cui Department of Electronic Engineering Shanghai Jiao Tong University, China 2017, Autumn 1 Outline Communication
More informationEE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code. 1 Introduction. 2 Extended Hamming Code: Encoding. 1.
EE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code Project #1 is due on Tuesday, October 6, 2009, in class. You may turn the project report in early. Late projects are accepted
More informationEE216B: VLSI Signal Processing. Wavelets. Prof. Dejan Marković Shortcomings of the Fourier Transform (FT)
5//0 EE6B: VLSI Signal Processing Wavelets Prof. Dejan Marković ee6b@gmail.com Shortcomings of the Fourier Transform (FT) FT gives information about the spectral content of the signal but loses all time
More informationHybrid Coding (JPEG) Image Color Transform Preparation
Hybrid Coding (JPEG) 5/31/2007 Kompressionsverfahren: JPEG 1 Image Color Transform Preparation Example 4: 2: 2 YUV, 4: 1: 1 YUV, and YUV9 Coding Luminance (Y): brightness sampling frequency 13.5 MHz Chrominance
More informationBurst Error Correction Method Based on Arithmetic Weighted Checksums
Engineering, 0, 4, 768-773 http://dxdoiorg/0436/eng04098 Published Online November 0 (http://wwwscirporg/journal/eng) Burst Error Correction Method Based on Arithmetic Weighted Checksums Saleh Al-Omar,
More informationClipping Noise Cancellation Based on Compressed Sensing for Visible Light Communication
Clipping Noise Cancellation Based on Compressed Sensing for Visible Light Communication Presented by Jian Song jsong@tsinghua.edu.cn Tsinghua University, China 1 Contents 1 Technical Background 2 System
More informationResearch Article A Multiple Target Localization with Sparse Information in Wireless Sensor Networks
Hindawi Publishing Corporation International Journal of Distributed Sensor Networks Volume 216, Article ID 6198636, 1 pages http://dxdoiorg/11155/216/6198636 Research Article A Multiple Target Localization
More informationSPARSE CHANNEL ESTIMATION BY PILOT ALLOCATION IN MIMO-OFDM SYSTEMS
SPARSE CHANNEL ESTIMATION BY PILOT ALLOCATION IN MIMO-OFDM SYSTEMS Puneetha R 1, Dr.S.Akhila 2 1 M. Tech in Digital Communication B M S College Of Engineering Karnataka, India 2 Professor Department of
More informationImage compression with multipixels
UE22 FEBRUARY 2016 1 Image compression with multipixels Alberto Isaac Barquín Murguía Abstract Digital images, depending on their quality, can take huge amounts of storage space and the number of imaging
More informationIntroduction to Wavelet Transform. Chapter 7 Instructor: Hossein Pourghassem
Introduction to Wavelet Transform Chapter 7 Instructor: Hossein Pourghassem Introduction Most of the signals in practice, are TIME-DOMAIN signals in their raw format. It means that measured signal is a
More informationECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010)
ECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010) Instructor: Kevin Buckley, Tolentine 433a, 610-519-5658 (W), 610-519-4436 (F), buckley@ece.vill.edu,
More informationMATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING. A Public Lecture to the Uganda Mathematics Society
Abstract MATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING A Public Lecture to the Uganda Mathematics Society F F Tusubira, PhD, MUIPE, MIEE, REng, CEng Mathematical theory and techniques play a vital
More informationSolutions to Information Theory Exercise Problems 5 8
Solutions to Information Theory Exercise roblems 5 8 Exercise 5 a) n error-correcting 7/4) Hamming code combines four data bits b 3, b 5, b 6, b 7 with three error-correcting bits: b 1 = b 3 b 5 b 7, b
More informationLecture 3: Wireless Physical Layer: Modulation Techniques. Mythili Vutukuru CS 653 Spring 2014 Jan 13, Monday
Lecture 3: Wireless Physical Layer: Modulation Techniques Mythili Vutukuru CS 653 Spring 2014 Jan 13, Monday Modulation We saw a simple example of amplitude modulation in the last lecture Modulation how
More informationECE/OPTI533 Digital Image Processing class notes 288 Dr. Robert A. Schowengerdt 2003
Motivation Large amount of data in images Color video: 200Mb/sec Landsat TM multispectral satellite image: 200MB High potential for compression Redundancy (aka correlation) in images spatial, temporal,
More informationECE 6640 Digital Communications
ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part
More informationCS3291: Digital Signal Processing
CS39 Exam Jan 005 //08 /BMGC University of Manchester Department of Computer Science First Semester Year 3 Examination Paper CS39: Digital Signal Processing Date of Examination: January 005 Answer THREE
More informationTime division multiplexing The block diagram for TDM is illustrated as shown in the figure
CHAPTER 2 Syllabus: 1) Pulse amplitude modulation 2) TDM 3) Wave form coding techniques 4) PCM 5) Quantization noise and SNR 6) Robust quantization Pulse amplitude modulation In pulse amplitude modulation,
More informationMultiple Input Multiple Output (MIMO) Operation Principles
Afriyie Abraham Kwabena Multiple Input Multiple Output (MIMO) Operation Principles Helsinki Metropolia University of Applied Sciences Bachlor of Engineering Information Technology Thesis June 0 Abstract
More informationphotons photodetector t laser input current output current
6.962 Week 5 Summary: he Channel Presenter: Won S. Yoon March 8, 2 Introduction he channel was originally developed around 2 years ago as a model for an optical communication link. Since then, a rather
More informationABSTRACT. Imaging Plasmons with Compressive Hyperspectral Microscopy. Liyang Lu
ABSTRACT Imaging Plasmons with Compressive Hyperspectral Microscopy by Liyang Lu With the ability of revealing the interactions between objects and electromagnetic waves, hyperspectral imaging in optical
More informationOpen Access Sparse Representation Based Dielectric Loss Angle Measurement
566 The Open Electrical & Electronic Engineering Journal, 25, 9, 566-57 Send Orders for Reprints to reprints@benthamscience.ae Open Access Sparse Representation Based Dielectric Loss Angle Measurement
More informationChapter 4 SPEECH ENHANCEMENT
44 Chapter 4 SPEECH ENHANCEMENT 4.1 INTRODUCTION: Enhancement is defined as improvement in the value or Quality of something. Speech enhancement is defined as the improvement in intelligibility and/or
More informationConcurrent Channel Access and Estimation for Scalable Multiuser MIMO Networking
Concurrent Channel Access and Estimation for Scalable Multiuser MIMO Networking Tsung-Han Lin and H. T. Kung School of Engineering and Applied Sciences Harvard University {thlin, htk}@eecs.harvard.edu
More information2.1. General Purpose Run Length Encoding Relative Encoding Tokanization or Pattern Substitution
2.1. General Purpose There are many popular general purpose lossless compression techniques, that can be applied to any type of data. 2.1.1. Run Length Encoding Run Length Encoding is a compression technique
More information