ECG Sensing with Noise Filtering - Patent Review

-
This patent describes a new innovative technique for sensing ECG and filtering out the noise in the sensed ECG. This technique makes use of the Spatially Selective Filtering (SSF) and Periodic Component Analysis (PCA). Spatially Selective Filtering is based on the correlation of the input signals. A high level of correlation defines whether a signal component is to be passed by the filter or not. This decision is made by the use of Periodic Component Analysis.

The patent describes the algorithm to carry out the denoising of the sensed ECG signal. A sensed ECG signal first undergoes signal conditioning. The conditioned ECG is then broken down into large number of uncorrelated signals. Further these components in the signal are analysed by SSF and PCA for noise components. SSF and PCA remove noise components and the original noiseless ECG signal is reconstructed using inverse of the transform used to decompose the signal initially.

Calculation of noise threshold is a vital step to filtering out the noise from the ECG signal. This is followed by identifying coefficients below noise threshold as noise sub-components. Removing noise sub-components and computing dynamic signal to noise ratio. A comparator is used for comparing noise threshold with noise level of signals. The signal is further reconstructed.


Patent Details: ECG Sensing With Noise Filtering; Patent No: US 8543195B1; Date of Patent: Sept 24, 2013

Comments

Post a Comment

Popular posts from this blog

Exp- 4 Filtering of Long Data Sequence using Overlap Add and Overlap Save method

-
Overlap Add and Overlap Save method are used for filtering long data sequences. Such a long data sequence would need a very high order FFT- which is not feasible and the process can only start after we've obtained the entire data sequence which leads to a delay. The long data sequence is broken into smaller parts and performed FFT analysis. It is then fitted with one another, the overlapped portion is discarded in Overlap Save Method whereas it is added in OAM to get required output sequence.
Read more

Exp-2 Discrete Fourier Transform

-
This practical really helped me understand DFT in a greater depth. It helped me connect the knowledge sir taught in the class, and aquire a greater understanding. In  mathematics , the  discrete Fourier transform  ( DFT ) converts a finite sequence of equally-spaced  samples  of a  function  into a same-length sequence of equally-spaced samples of the  discrete-time Fourier transform  (DTFT), which is a  complex-valued  function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. To understand DFT better, we've performed discrete Fourier transform of a 4 point sequence by coding it. What I learned in that experiment is: 1) Results by DFT are always periodic about the number of input values. 2)The spectrum is discrete from o to pi. 3)Upon zero-padding the input signal, the length of the input signal increased- which increases the frequency spacing. 4)As frequ...
Read more

Exp-3 Fast Fourier Transform

-
Image
Fast Fourier Transform(FFT) A   Fast Fourier transform  ( FFT ) is an algorithm that samples a signal over a period of time (or space) and divides it into its frequency components. FFT is manually verified and performed using flowgraphs. FFT is much faster than DFT and more efficient as it requires less number of real and complex additions and multiplication. The computation is considerably reduced from M2N2 to MNlogMlogN
Read more