SearcharxivSearch

arXiv subjects

Thomas Burger

Publications and source records attributed to Thomas Burger.

5 recordsLinked to original sources

Spectral Impact of Mismatches in Interleaved ADCs

Interleaved ADCs are critical for applications requiring multi-gigasample per second (GS/s) rates, but their performance is often limited by offset, gain, and timing skew mismatches across the sub-ADCs. We propose exact but compact expressions that describe the impact of each of those non-idealities on the output spectrum. We derive the distribution of the power of the induced spurs and replicas, critical for yield-oriented derivation of sub-ADC specifications. Finally, we provide a practical example in which calibration step sizes are derived under the constraint of a target production yield.

eess.SP

Variable Metric Splitting Methods for Neuromorphic Circuits Simulation

This paper proposes a variable metric splitting algorithm to solve the electrical behavior of neuromorphic circuits made of capacitors, memristive elements, and batteries. The gradient property of the memristive elements is exploited to split the current to voltage operator as the sum of the derivative operator, a Riemannian gradient operator, and a nonlinear residual operator that is linearized at each step of the algorithm. The diagonal structure of the three operators makes the variable metric forward-backward splitting algorithm scalable and amenable to the simulation of large-scale neuromorphic circuits.

eess.SY

Calibrating Control-Bounded ADCs

The paper considers the calibration of control-bounded analog-to-digital converters. It is demonstrated that variations of the analog frontend can be addressed by calibrating the digital estimation filter. In simulations (both behavioral and transistor level) of a leapfrog analog frontend, the proposed calibration method restores essentially the nominal performance. Moreover, with digital-filter calibration in mind, the paper reformulates the design problem of control-bounded converters and thereby clarifies the role of sampling, desired filter shape, and nominal conversion error.

eess.SY

Challenging targets or describing mismatches? A comment on Common Decoy Distribution by Madej et al

In their recent article, Madej et al. 1 proposed an original way to solve the recurrent issue of controlling for the false discovery rate (FDR) in peptide-spectrum-match (PSM) validation. Briefly, they proposed to derive a single precise distribution of decoy matches termed the Common Decoy Distribution (CDD) and to use it to control for FDR during a target-only search. Conceptually, this approach is appealing as it takes the best of two worlds, i.e., decoy-based approaches (which leverage a large-scale collection of empirical mismatches) and decoy-free approaches (which are not subject to the randomness of decoy generation while sparing an additional database search). Interestingly, CDD also corresponds to a middle-of-the-road approach in statistics with respect to the two main families of FDR control procedures: Although historically based on estimating the falsepositive distribution, FDR control has recently been demonstrated to be possible thanks to competition between the original variables (in proteomics, target sequences) and their fictional counterparts (in proteomics, decoys). Discriminating between these two theoretical trends is of prime importance for computational proteomics. In addition to highlighting why proteomics was a source of inspiration for theoretical biostatistics, it provides practical insights into the improvements that can be made to FDR control methods used in proteomics, including CDD.

q-bio.GN

Bridging belief function theory to modern machine learning

Machine learning is a quickly evolving field which now looks really different from what it was 15 years ago, when classification and clustering were major issues. This document proposes several trends to explore the new questions of modern machine learning, with the strong afterthought that the belief function framework has a major role to play.

cs.AI