Searcharxiv⌕ Search

arXiv subjects

Lei Zhao

Publications and source records attributed to Lei Zhao.

At least 253 records · Page 14Linked to original sources
arXiv2015

The Analog Front-end Prototype Electronics Designed for LHAASO WCDA

In the readout electronics of the Water Cerenkov Detector Array (WCDA) in the Large High Altitude Air Shower Observatory (LHAASO) experiment, both high-resolution charge and time measurement are required over a dynamic range from 1 photoelectron (P.E.) to 4000 P.E. The Analog Front-end (AFE) circuit is one of the crucial parts in the whole readout electronics. We designed and optimized a prototype of the AFE through parameter calculation and circuit simulation, and conducted initial electronics tests on this prototype to evaluate its performance. Test results indicate that the charge resolution is better than 1% @ 4000 P.E. and remains better than 10% @ 1 P.E., and the time resolution is better than 0.5 ns RMS, which is better than application requirement.

physics.ins-det↗
arXiv2015

Evaluation of a front-end ASIC for the readout of PMTs in large dynamic range

The Large High Altitude Air Shower Observatory (LHAASO) project has been proposed for the survey and study of cosmic rays. In the LHAASO project, the Water Cherenkov Detector Array (WCDA) is one of major detectors for searching gamma ray sources. A Charge-to-Time Convertor (QTC) ASIC (Application Specification Integrated Circuit) fabricated in Global Foundry 0.35 μm CMOS technology, has been developed for readout of Photomultiplier Tubes (PMTs) in the WCDA. This paper focuses on the evaluation of this front-end readout ASIC performance. Test results indicate that the time resolution is better than 400 ps and the charge resolution is better than 1% with large input signals and remains better than 15% @ 1 Photo Electron (P.E.), both beyond the application requirement. Moreover, this ASIC has a weak ambient temperature dependence, low input rate dependence and high channel-to-channel isolation.

physics.ins-det↗
arXiv2014

Partial Reduction and Delaunay/Deprit Variables

Based on a concept link between the partial reduction procedure of the reduction of the rotational symmetry of the N-body problem with the symplectic cross-section theorem of Guillemin-Sternberg, we present alternative proofs of the symplecticity of Delaunay and Deprit coordinates in celestial mechanics.

math.DS↗
arXiv2013

Quasi-periodic Almost-collision Orbits in the Spatial Three-Body Problem

In a system of particles, quasi-periodic almost-collision orbits are collisionless orbits along which two bodies become arbitrarily close to each other -- the lower limit of their distance is zero but the upper limit is strictly positive -- and which are quasi-periodic in a regularized system up to a change of time. The existence of such orbits was shown in the restricted planar circular three-body problem by A. Chenciner and J. Llibre, and later, in the planar three-body problem by J. Féjoz. In the spatial three-body problem, the existence of a set of positive measure of such orbits was predicted by C. Marchal. In this article, we present a proof of this fact.

math.DS↗
arXiv2013

A new method of waveform digitization based on time-interleaved A/D conversion

Time interleaved analog-to-digital conversion (TIADC) based on parallelism is an effective way to meet the requirement of the ultra-fast waveform digitizer beyond Gsps. Different methods to correct the mismatch errors among different analog-to-digital conversion channels have been developed previously. To overcome the speed limitation in hardware design and to implement the mismatch correction algorithm in real time, this paper proposes a fully parallel correction algorithm. A 12-bit 1-Gsps waveform digitizer with ENOB around 10.5 bit from 5 MHz to 200 MHz is implemented based on the real-time correction algorithm.

physics.ins-det↗
arXiv2013

Proposal of the Readout Electronics for the WCDA in LHAASO Experiment

The LHAASO (Large High Altitude Air Shower Observatory) experiment is proposed for very high energy gamma ray source survey, in which the WCDA (Water Cherenkov Detector Array) is the one of the major components. In the WCDA, a total of 3600 PMTs are placed under water in four ponds, each with a size of 150 m x 150 m. Precise time and charge measurement is required for the PMT signals, over a large signal amplitude range from single P.E. (photo electron) to 4000 P.E. To fulfill the high requirement of signal measurement in so many front end nodes scattered in a large area, special techniques are developed, such as multiple gain readout, hybrid transmission of clocks, commands, and data, precise clock phase alignment, and new trigger electronics. We present the readout electronics architecture for the WCDA and several prototype modules, which are now under test in the laboratory.

astro-ph.IM↗
arXiv2013

Universal Estimation of Directed Information

Four estimators of the directed information rate between a pair of jointly stationary ergodic finite-alphabet processes are proposed, based on universal probability assignments. The first one is a Shannon--McMillan--Breiman type estimator, similar to those used by Verdú (2005) and Cai, Kulkarni, and Verdú (2006) for estimation of other information measures. We show the almost sure and $L_1$ convergence properties of the estimator for any underlying universal probability assignment. The other three estimators map universal probability assignments to different functionals, each exhibiting relative merits such as smoothness, nonnegativity, and boundedness. We establish the consistency of these estimators in almost sure and $L_1$ senses, and derive near-optimal rates of convergence in the minimax sense under mild conditions. These estimators carry over directly to estimating other information measures of stationary ergodic finite-alphabet processes, such as entropy rate and mutual information rate, with near-optimal performance and provide alternatives to classical approaches in the existing literature. Guided by these theoretical results, the proposed estimators are implemented using the context-tree weighting algorithm as the universal probability assignment. Experiments on synthetic and real data are presented, demonstrating the potential of the proposed schemes in practice and the utility of directed information estimation in detecting and measuring causal influence and delay.

cs.IT↗
arXiv2013

A Fast Improved Fat Tree Encoder for Wave Union TDC in an FPGA

Up to the present, the wave union method can achieve the best timing performance in FPGA based TDC designs. However, it should be guaranteed in such a structure that the non-thermometer code to binary code (NTH2B) encoding process should be finished within just one system clock cycle. So the implementation of the NTH2B encoder is quite challenging considering the high speed requirement. Besides, the high resolution wave union TDC also demands the encoder to convert an ultra-wide input code to a binary code. We present a fast improved fat tree encoder (IFTE) to fulfill such requirements, in which bubble error suppression is also integrated. With this encoder scheme, a wave union TDC with 7.7 ps RMS and 3.8 ps effective bin size was implemented in an FPGA from Xilinx Virtex 5 family. An encoding time of 8.33 ns was achieved for a 276-bit non-thermometer code to a 9-bit binary code conversion. We conducted a series of tests on the oscillating period of the wave union launcher, as well as the overall performance of the TDC; test results indicate that the IFTE works well. In fact, in the implementation of this encoder, no manual routing or special constrains were required; therefore, this IFTE structure could also be further applied in other delay chain based FPGA TDCs.

physics.ins-det↗
arXiv2013

GenomeFingerprinter and universal genome fingerprint analysis for systematic comparative genomics

How to compare whole genome sequences at large scale has not been achieved via conventional methods based on pair-wisely base-to-base comparison; nevertheless, no attention was paid to handle in-one-sitting a number of genomes crossing genetic category (chromosome, plasmid, and phage) with farther divergences (much less or no homologous) over large size ranges (from Kbp to Mbp). We created a new method, GenomeFingerprinter, to unambiguously produce three-dimensional coordinates from a sequence, followed by one three-dimensional plot and six two-dimensional trajectory projections to illustrate whole genome fingerprints. We further developed a set of concepts and tools and thereby established a new method, universal genome fingerprint analysis. We demonstrated their applications through case studies on over a hundred of genome sequences. Particularly, we defined the total genetic component configuration (TGCC) (i.e., chromosome, plasmid, and phage) for describing a strain as a system, and the universal genome fingerprint map (UGFM) of TGCC for differentiating a strain as a universal system, as well as the systematic comparative genomics (SCG) for comparing in-one-sitting a number of genomes crossing genetic category in diverse strains. By using UGFM, UGFM-TGCC, and UGFM-TGCC-SCG, we compared a number of genome sequences with farther divergences (chromosome, plasmid, and phage; bacterium, archaeal bacterium, and virus) over large size ranges (6Kbp~5Mbp), giving new insights into critical problematic issues in microbial genomics in the post-genomic era. This paper provided a new method for rapidly computing, geometrically visualizing, and intuitively comparing genome sequences at fingerprint level, and hence established a new method of universal genome fingerprint analysis for systematic comparative genomics.

q-bio.GN↗
arXiv2012

A Lattice of Gambles

A gambler walks into a hypothetical fair casino with a very real dollar bill, but by the time he leaves he's exchanged the dollar for a random amount of money. What is lost in the process? It may be that the gambler walks out at the end of the day, after a roller-coaster ride of winning and losing, with his dollar still intact, or maybe even with two dollars. But what the gambler loses the moment he places his first bet is position. He exchanges one distribution of money for a distribution of lesser quality, from which he cannot return. Our first discussion in this work connects known results of economic inequality and majorization to the probability theory of gambling and Martingales. We provide a simple proof that fair gambles cannot increase the Lorenz curve, and we also constructively demonstrate that any sequence of non-increasing Lorenz curves corresponds to at least one Martingale. We next consider the efficiency of gambles. If all fair gambles are available then one can move down the lattice of distributions defined by the Lorenz ordering. However, the step from one distribution to the next is not unique. Is there a sense of efficiency with which one can move down the Lorenz stream? One approach would be to minimize the average total volume of money placed on the table. In this case, it turns out that implementing part of the strategy using private randomness can help reduce the need for the casino's randomness, resulting in less money on the table that the casino cannot get its hands on.

math.PR↗
arXiv2012

Finite $W$-superalgebras for queer Lie superalgebras

We initiate and develop the theory of finite $W$-superalgebras $\mathcal{W}_χ$ associated to the queer Lie superalgebra $\g=\q(N)$ and a nilpotent linear functional $χ\in \ev\g^*$. We show that the definition of the $W$-superalgebra is independent of various choices. We also establish a Skryabin type equivalence between the category of $\mathcal{W}_χ$-modules and a category of certain $\g$-modules.

math.RT↗
arXiv2012

Compression with Actions

We consider the setting where actions can be used to modify a state sequence before compression. The minimum rate needed to losslessly describe the optimal modified sequence is characterized when the state sequence is either non-causally or causally available at the action encoder. The achievability is closely related to the optimal channel coding strategy for channel with states. We also extend the analysis to the the lossy case.

cs.IT↗
arXiv2011

Coordination using Implicit Communication

We explore a basic noise-free signaling scenario where coordination and communication are naturally merged. A random signal X_1,...,X_n is processed to produce a control signal or action sequence A_1,...,A_n, which is observed and further processed (without access to X_1,...,X_n) to produce a third sequence B_1,...,B_n. The object of interest is the set of empirical joint distributions p(x,a,b) that can be achieved in this setting. We show that H(A) >= I(X;A,B) is the necessary and sufficient condition for achieving p(x,a,b) when no causality constraints are enforced on the encoders. We also give results for various causality constraints. This setting sheds light on the embedding of digital information in analog signals, a concept that is exploited in digital watermarking, steganography, cooperative communication, and strategic play in team games such as bridge.

cs.IT↗
arXiv2011

Representations of Lie superalgebras in prime characteristic II: The queer series

The modular representation theory of the queer Lie superalgebra q(n) over characteristic p>2 is developed. We obtain a criterion for the irreducibility of baby Verma modules with semisimple p-characters and a criterion for the semisimplicity of the corresponding reduced enveloping algebras. A (2p)-power divisibility of dimensions of q(n)-modules with nilpotent p-characters is established. The representation theory of q(2) is treated in detail. We formulate a Morita super-equivalence conjecture for q(n) with general p-characters which is verified for n=2.

math.RT↗
arXiv2010

On invariant sets in Lagrangian graphs

In this exposition, we show that a Hamiltonian is always constant on a compact invariant connected subset which lies in a Lagrangian graph provided that the Hamiltonian and the graph are smooth enough. We also provide some counterexamples for the case that the Hamiltonians are not smooth enough.

math.DS↗
arXiv2009

Representations of Lie superalgebras in prime characteristic III

For a restricted Lie superalgebra g over an algebraically closed field of characteristic p > 2, we generalize the deformation method of Premet and Skryabin to obtain results on the p-power and 2-power divisibility of dimensions of g-modules. In particular, we give a new proof of the Super Kac-Weisfeiler conjecture for basic classical Lie superalgebras. The new proof allows us to improve optimally the assumption on p. We also establish a semisimplicity criterion for the reduced enveloping superalgebras associated with semisimple p-characters for all basic classical Lie superalgebras using the technique of odd reflections.

math.RT↗
arXiv2009

A Random Variable Substitution Lemma With Applications to Multiple Description Coding

We establish a random variable substitution lemma and use it to investigate the role of refinement layer in multiple description coding, which clarifies the relationship among several existing achievable multiple description rate-distortion regions. Specifically, it is shown that the El Gamal-Cover (EGC) region is equivalent to the EGC* region (an antecedent version of the EGC region) while the Venkataramani-Kramer-Goyal (VKG) region (when specialized to the 2-description case) is equivalent to the Zhang-Berger (ZB) region. Moreover, we prove that for multiple description coding with individual and hierarchical distortion constraints, the number of layers in the VKG scheme can be significantly reduced when only certain weighted sum rates are concerned. The role of refinement layer in scalable coding (a special case of multiple description coding) is also studied.

cs.IT↗