Microsoft Word - Article 17 - 175-1305-1-LE.docx ACTA IMEKO  February 2015, Volume 4, Number 1, 111 – 120  www.imeko.org    ACTA IMEKO | www.imeko.org  February 2015 | Volume 4 | Number 1 | 111  Frequency‐domain  characterization  of  random  demodulation  analog‐to‐information  converters  Doris Bao, Pasquale Daponte, Luca De Vito, Sergio Rapuano  Department of Engineering, University of Sannio, Piazza Roma, 21, 82100 Benevento, Italy    Section: RESEARCH PAPER   Keywords: Analog‐to‐Information Converter, Compressive sampling, Testing, Frequency domain.  Citation: Doris Bao, Pasquale Daponte, Luca De Vito, Sergio Rapuano, Frequency‐domain characterization of random demodulation analog‐to‐information  converters, Acta IMEKO, vol. 4, no. 1, article 17, February 2015, identifier: IMEKO‐ACTA‐04 (2015)‐01‐17  Editor: Paolo Carbone, University of Perugia   Received January 14 th , 2014; In final form April 4 th , 2014; Published February 2015  Copyright: © 2014 IMEKO. This is an open‐access article distributed under the terms of the Creative Commons Attribution 3.0 License, which permits  unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited  Funding: (none reported)  Corresponding author: Luca De Vito, e‐mail: devito@unisannio.it  1. INTRODUCTION  High-speed data acquisition is becoming a relevant topic in advanced applications, such as high-speed radar and communications, signal analysis, high-speed video acquisition, and so on. Moreover, it is a relevant challenge in wideband spectrum sensing for software defined radio and cognitive radio applications [1], [2]. Such demand often is not met by traditional Analog-to- Digital Converters (ADCs), due to technological limits in fast sampling rates [3]. The recent studies about compressive sampling (CS) drew a possible solution for signals, that can be represented by a finite number of non-zero elements in a specific domain. They demonstrated that, for such class of signals, it is possible to reconstruct the original waveform, from a set of samples of a lower dimension than that required by the Shannon theorem. The idea, underlying the AIC, is to spread the frequency content of the input signal. In this way, the high frequency components, folded back to low frequencies, can be acquired by an ADC with a lower sampling frequency than that required by the Shannon's theorem for the original signal. Basing on this concept, different architectures have been proposed, implementing the frequency spreading by exploiting: (i) non-uniform [4] or random sampling [5], (ii) random filters [6], and (iii) random demodulation [3]. The aim of the paper is to define performance parameters and test methods for AICs, starting from the state of art of research and the scientific knowledge about ADC testing, well summarized in [7] and [8]. To this aim, the first step is the application to AICs of standard parameters and test methods, actually defined for ADCs in order to study how they are influenced by (i) the AIC architecture type, (ii) the AIC design parameters, and (iii) the circuit non-idealities. ABSTRACT  The paper aims at proposing test methods for Analog‐to‐Information Converters (AICs).   In particular, the objective of this work is to verify if figures of merit and test methods, currently defined in standards for traditional  Analog‐to‐Digital Converters, can be applied to AICs based on the random demodulation architecture.  For this purpose, an AIC prototype has been designed, starting from commercially available integrated circuits. A simulation analysis  and an experimental  investigation have been carried out to study the additional  influencing factors such as the parameters of the  reconstruction algorithm. Results show that standard figures of merit are in general capable of describing the performance of AICs,  provided  that  they  are  slightly  modified  according  to  the  proposals  reported  in  the  paper.  In  addition,  test  methods  have  to  be  modified in order to take into account the statistical behavior of AICs.  ACTA IMEKO | www.imeko.org  February 2015 | Volume 4 | Number 1 | 112  In the scientific literature few papers can be found, facing the AIC testing and most of them take into account only a reduced set of Figures of Merits (FoMs) and influencing parameters [9]. In [10], the authors presented a preliminary investigation carried out in simulation and on a first AIC prototype, based on a digital oscilloscope, about the application of standard ADC FoMs on the AIC. This paper is an extended version of such work, in which new results are presented and a new AIC prototype is used, based on commercial integrated circuits. As in [10], the AIC architecture considered in this paper is based on the random demodulation, as it does not require a high sampling frequency ADC. However, test methods and considerations can be easily extended to the other types of AIC architectures. In particular, in the paper, a characterization of a random demodulation AIC has been carried out by applying a reconstruction algorithm to the AIC output and evaluating the dynamic parameters in the frequency domain, defined for ADC testing. To this aim, in a former phase, a behavioural model of the random demodulation AIC has been simulated, by considering the non-idealities introduced by its main building blocks. In a latter phase, an AIC prototype has been designed, by following the theoretical descriptions found in literature, and an experimental analysis has been conducted on it. The paper is organized as follows: In Section 2, an introductory description about compressive sampling theory is given; in Section 3, the random demodulation architecture, which was used both in the simulation and the experimental analyses of this work, is described; in Section 4, the approach followed for AIC testing is explained; then, in Section 5, a simulation phase is reported, in which the influence of several factors, such as circuit non-idealities, AIC design parameters and reconstruction algorithm parameters, have been investigated. In Section 6, the FoMs defined for traditional ADCs are revised. Finally, in Section 7, the experimental analysis is presented and results are discussed. 2.  THEORETICAL  BACKGROUND  The idea underlying CS approach is that many natural signals have concise representations when expressed in a convenient basis [11]. As an example, audio signals have sparse representations in the Short-Time Fourier Transform domain, or in the Modified Discrete Cosine Transform domain [12]. Another example is given by radar echo signals, that, depending on the radar signal type, can have sparse representations in the time, frequency, wavelet, or time-frequency domains [13]. Sparse representations of natural signals, audio, images and videos are currently exploited by transform coding schemes, such as those used by the JPEG, JPEG2000, MPEG, and MP3 standards. However, in signal compression, signals are acquired using Nyquist rate converters, then they are transformed in a proper domain, where less significant coefficients are discarded. CS, instead, aims to acquire directly the compressed version of the signal, without wasting acquisition or memory resources, by taking a vector y of observations of the signal to be acquired, where the size of y is lower than that required by the Shannon theorem to digitize the signal. In the past, some other techniques have been proposed to overcome the Shannon theorem constraints in some specific conditions. The equivalent time sampling of time domain signals is an example of such techniques. However, equivalent time sampling requires the observed portion of the signal to be repetitive. CS, instead is applicable even to a non-repetitive signal, providing that a domain can be found, where the representation of such signal is sparse. For a compressible signal x(t), if x is a the vector of N samples of it acquired according to the Shannon theorem, its compressed counterpart is represented by a vector y of size M < N, such that: ,= Φxy (1) where,  is a matrix modelling the compression process. It can demonstrated that an estimate of x can be reconstructed from y according to (1) if a matrix transformation  exists, such that: ,= Ψcx (2) where c has only K < M non-zero elements. The above defined condition is not rare in reality, since many natural signals are sparse or compressible in the sense that they have concise representations when expressed in the proper basis. By combining (1) and (2), the following expression is obtained: ,= Acy (3) where A =  is an M × N matrix and, therefore, (3) is an under-determined linear system in c. The system can be solved by finding the solution of (3) that minimizes the ℓ0 norm, that is having the highest number of non-zero elements in c:   .subject toˆ 0 Acycc =argmin= (4) The minimization of the ℓ0 norm is both numerically unstable and NP-complete, requiring an exhaustive enumeration of all       K N possible locations of the non-zero entries in c [14]. Therefore, the solution is approximated with that obtained by the minimization of the ℓ1 norm:   .subject toˆ 1 Acycc =argmin= (5) In presence of additive noise e, equation (3) becomes: eAcy += (6) and the minimization problem is modified as:   .subject toˆ 21 τ