This disclosure relates to methods of acquiring and processing signals for finite rate of innovation parameterization.
Signal parameterization is widely used in signal processing, storage, transmission, and analysis. Perhaps the most common is the use of Nyquist rate sampling, where a continuous time domain signal is represented by a set of sampled signal values at discrete times. As long as the original continuous signal is band limited to at most half the sampling rate, the set of samples can be used to reconstruct the complete signal by using, for example, a sine interpolation algorithm. In this common example, the signal is represented by a set of discrete parameters, the sample values, which can be stored, transmitted, and used at any time to reconstruct the original signal.
More recently, some signals having a large or even theoretically infinite bandwidth have been parameterized in other ways. Although these signals may contain frequency components that are arbitrarily large, they are characterized by a “rate-of-innovation” per unit time so that the signal can be parameterized with a finite set of values from which the original signal can be reconstructed. The problem to be solved then is how to derive a suitable set of parameter values from the original signal and how to reverse the process to reconstruct the complete signal using only the derived parameters. Finite Rate of Innovation (FRI) based signal analysis is one such method of analyzing signals, and is described in the following references: [1] M. Vetterli, P. Marziliano, T. Blu, “Sampling Signals with Finite Rate of Innovation”, IEEE Transactions on Signal Processing, vol. 50, no. 6, pp. 1417-1428, June 2002; [2] T. Blu, P. L. Dragotti, M. Vetterli, P. Marziliano, and L Coulot, “Sparse Sampling of Signal Innovations: Theory, Algorithms, and Performance Bounds”, IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 31-40, March 2008; [3] Y. Hao, P. Marziliano, M. Vetterli, T. Blu, “Compression of ECG as a Signal with Finite Rate of Innovation”, Proc. of the 2005 IEEE Engineering in Medicine and Biology 27th Annual Conference, Shanghai, China, Sep. 1-4, 2005, pp. 7564-7567; [4] Marziliano, M. Vetterli and T. Blu, “Sampling and Exact Reconstruction of Bandlimited Signals With Additive Shot Noise,” IEEE Transactions on Information Theory, vol. 52, No. 5, pp. 2230-2233, May 2006, and [5] U.S. Patent Publication 2011/0225218 to Eldar et al. entitled Low-Rate Sampling of Pulse Streams. Each of these references is incorporated by reference herein in its entirety.
As one example, a signal may contain a sequence of narrow pulses, where the information content in the signal is encoded in the location and amplitude of the pulses in the signal. If the pulse widths are narrow, conventional Nyquist rate sampling for storage, analysis, and reconstruction of such a signal would require high speed, high resolution sampling and storage of a large number of samples. However, because the signal may be characterized with only a few relevant parameters, such as a location and amplitude for each pulse, such a signal has a “rate of innovation” that is small. It has been shown (see reference 1 above, for example) that for such a signal, the relevant parameters of location and amplitude for each pulse in the signal can be derived using only low frequency components of the original signal. The frequency components required to derive the relevant parameters depends on the rate of innovation of the input signal rather than on the bandwidth of the input signal. As used herein, “FRI processing” means a process of using a subset of the frequency components of a signal, usually low frequency components, to derive parameters from which the original signal, including components of higher frequency than those used to derive the parameters, can be reconstructed. The derived parameters are referred to herein as “FRI parameters.” Pulse locations and amplitudes are examples of FRI parameters. This may be contrasted with what may be referred to as “Nyquist processing” and “Nyquist parameters,” which involve time or frequency domain data points having a density that satisfies the Nyquist sampling criteria for the bandwidth of the original signal.
For this reason, and as shown in
The systems, methods, and devices of the invention each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this invention as expressed by the claims which follow, some features will now be discussed briefly. After considering this discussion, and particularly after reading the section entitled “Detailed Description” one will understand how the features of this invention provide advantages that include lower power signal acquisition circuitry for use in FRI processing.
In one implementation, a method of sparse sampling an analog signal includes sampling and quantizing the analog signal with a delta-sigma modulator, filtering the sampled and quantized analog signal, and deriving FRI parameters from the filtered, sampled, and quantized analog filter.
In another implementation, an apparatus for parameterizing an analog signal includes a delta-sigma modulator having an input coupled to receive the analog signal and processing circuitry coupled to an output of the delta-sigma modulator and configured to filter an output of the delta-sigma modulator and to derive FRI parameters from the output of the delta-sigma modulator.
In another implementation, a method for sparse sampling an analog signal includes sampling and quantizing the analog signal with a delta-sigma modulator, determining a set of DFT coefficients from the output of the delta-sigma modulator, and deriving FRI parameters from the set of DFT coefficients
In another implementation, an apparatus for sparse sampling an analog signal includes a delta-sigma modulator having an input coupled to receive the analog signal, and processing circuitry coupled to an output of the delta-sigma modulator, and configured to determine a set of DFT coefficients from the output of the delta-sigma modulator and derive FRI parameters from the set of DFT coefficients.
Various aspects of the novel systems, apparatuses, and methods are described more fully hereinafter with reference to the accompanying drawings. The teachings may be embodied in many different forms and should not be construed as limited to any specific structure or function presented throughout this disclosure. Rather, these aspects are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art. Based on the teachings herein one skilled in the art should appreciate that the scope of the disclosure is intended to cover any aspect of the novel systems, apparatuses, and methods disclosed herein, whether implemented independently of or combined with any other aspect of the invention. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, the scope of the invention is intended to cover such an apparatus or method which is practiced using other structure, functionality, or structure and functionality in addition to or other than the various aspects of the invention set forth herein. It should be understood that any aspect disclosed herein may be embodied by one or more elements of a claim.
Although particular aspects are described herein, many variations and permutations of these aspects fall within the scope of the disclosure. Although some benefits and advantages of the preferred aspects are mentioned, the scope of the disclosure is not intended to be limited to particular benefits, uses, or objectives. Rather, aspects of the disclosure are intended to be broadly applicable to different systems, some of which are illustrated by way of example in the figures and in the following description of the preferred aspects. The detailed description and drawings are merely illustrative of the disclosure rather than limiting, the scope of the disclosure being defined by the appended claims and equivalents thereof.
As described above, the circuit of
Example ΔΣ modulator circuits are provided in
In a normal implementation of signal processing with a ΔΣ modulator, the sample rate of the ΔΣ modulator is oversampled at a multiple of the Nyquist rate for the highest frequency content fm of the input signal. A value referred to as the oversampling ratio (OSR) is often defined as fs/2fm, where fs is the sampling rate of the ΔΣ modulator (e.g. the clock rate of the clock in
The above discussion describes the usual use of ΔΣ modulators, where the highest input signal frequency content fm is determined, and a ΔΣ modulator design and OSR are selected based on fm to digitize the input signal with a desired SNR. Such a use of a ΔΣ modulator in an FRI processing system may eliminate the need for significant analog pre-filtering. However, the use of a ΔΣ modulator in this way does not fully utilize the characteristics of ΔΣ modulators that can be taken advantage of in an FRI processing system, as fm is already very high for these types of signals. In these cases, oversampling with a ΔΣ modulator may be difficult, for the same reasons that implementing the Nyquist rate high resolution sampler illustrated in
The inventors have realized, however, that as long as the OSR of the ΔΣ modulator 30 in
As an example, consider an input signal with fm of 3 kHz and an FRI processing algorithm that requires frequency components from 0 to 50 Hz to derive the FRI parameters that can reconstruct the original 3 kHz signal waveform. Conventionally, such a signal could be sampled unfiltered at 6 kHz or more using a Nyquist rate high resolution (e.g. 12-16 bit) sampler as in
Although not illustrated, some analog pre-filtering can also be used in the system of
In the system of
In the system of
The samples output from the ΔΣ modulator 30 are sent to signal processing circuitry 74 which may be configured to produce the FRI parameters of, for example, pulse width, time, and symmetric and asymmetric amplitude in the manner described in the Ser. No. 13/552,206 application. These may be sent wirelessly via antenna 76 to a mobile device 64 such as a cell phone, tablet, or other portable electronic system, which receives the parameters via antenna 80 and routes the parameters to signal processing circuitry 82 in the mobile device 64. It will be appreciated that the components of the patch 60 need not be mounted together on the same physical substrate, but could be split up in a variety of ways.
The signal processing circuitry 82 in the mobile device 64 may be configured to reconstruct the ECG waveforms using FRI parameters. The reconstructed signal may be displayed on a display 84 and manipulated with a keypad/touchscreen 86 on the mobile device. The mobile device may also be configured to transmit either the reconstructed waveform and/or the FRI parameters to an external network such as the Internet for storage, review by a physician, etc.
The signal processing circuit 74 can process the output bit stream in a variety of ways. The output bit stream from the ΔΣ modulator 30 can be simply forwarded to the transmission circuitry, with all further processing performed on the mobile device 64. A DFT can be performed on the bit stream and the DFT coefficients for FRI processing can be forwarded for transmission. The DFT coefficients can be used to derive the appropriate FRI parameters as described above on the patch 60, and these parameters can be transmitted to the mobile device 64. In another implementation, the bit stream can be digitally low pass filtered in the time or frequency domain to produce multi-bit data points representing the signal level at discrete time points such as are obtained by a high resolution sampling analog to digital converter. These digitally filtered points can be further decimated without loss of information. A DFT can be performed on these data points and the FRI parameters can be produced for transmission to the mobile device 64.
The various illustrative logic, logical blocks, modules, and algorithm steps described in connection with the implementations disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. The interchangeability of hardware and software has been described generally, in terms of functionality, and illustrated in the various illustrative components, blocks, modules, circuits and steps described above. Whether such functionality is implemented in hardware or software depends upon the particular application and design constraints imposed on the overall system.
The hardware and data processing apparatus used to implement the various illustrative logics, logical blocks, modules and circuits described in connection with the aspects disclosed herein may be implemented or performed with a general purpose single- or multi-chip processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, or, any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. In some implementations, particular steps and methods may be performed by circuitry that is specific to a given function.
In one or more aspects, the functions described may be implemented in hardware, digital electronic circuitry, computer software, firmware, including the structures disclosed in this specification and their structural equivalents thereof, or in any combination thereof. Implementations of the subject matter described in this specification also can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions, encoded on a computer storage media for execution by, or to control the operation of, data processing apparatus.
If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. The steps of a method or algorithm disclosed herein may be implemented in a processor-executable software module which may reside on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that can be enabled to transfer a computer program from one place to another. A storage media may be any available media that may be accessed by a computer. By way of example, and not limitation, such computer-readable media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that may be used to store desired program code in the form of instructions or data structures and that may be accessed by a computer. Also, any connection can be properly termed a computer-readable medium. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Blu-Ray™ disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media. Additionally, the operations of a method or algorithm may reside as one or any combination or set of codes and instructions on a machine readable medium and computer-readable medium, which may be incorporated into a computer program product.
Various modifications to the implementations described in this disclosure may be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other implementations without departing from the spirit or scope of this disclosure. Thus, the disclosure is not intended to be limited to the implementations shown herein, but is to be accorded the widest scope consistent with the claims, the principles and the novel features disclosed herein. The word “exemplary” is used exclusively herein to mean “serving as an example, instance, or illustration.” Any implementation described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other implementations.
Certain features that are described in this specification in the context of separate implementations also can be implemented in combination in a single implementation. Conversely, various features that are described in the context of a single implementation also can be implemented in multiple implementations separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Further, the drawings may schematically depict one more example processes in the form of a flow diagram. However, other operations that are not depicted can be incorporated in the example processes that are schematically illustrated. For example, one or more additional operations can be performed before, after, simultaneously, or between any of the illustrated operations. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the implementations described above should not be understood as requiring such separation in all implementations, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products. Additionally, other implementations are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results.
This application claims priority under 35 U.S.C. Section 119(e) to U.S. Provisional Application 61/717,491, filed on Oct. 23, 2012, and U.S. Provisional Application 61/785,679, filed on Mar. 14, 2013.
Number | Date | Country | |
---|---|---|---|
61785679 | Mar 2013 | US | |
61717491 | Oct 2012 | US |