Searcharxiv⌕ Search

arXiv subjects

Hao Shen

Publications and source records attributed to Hao Shen.

141 records · Page 8Linked to original sources

Rapidly reconfigurable radio-frequency arbitrary waveforms synthesized on a CMOS photonic chip

Photonic methods of radio-frequency waveform generation and processing provide performance and flexibility over electronic methods due to the ultrawide bandwidth offered by the optical carriers. However, they suffer from lack of integration and slow reconfiguration speed. Here we propose an architecture of integrated photonic RF waveform generation and processing, and implement it on a silicon chip fabricated in a semiconductor manufacturing foundry. Our device can generate programmable RF bursts or continuous waveforms with only the light source, electrical drives/controls and detectors being off chip. It turns on and off an individual pulse in the RF burst within 4 nanoseconds, achieving a reconfiguration speed three orders of magnitude faster than thermal tuning. The on-chip optical delay elements offers an integrated approach to accurately manipulate individual RF waveform features without constrains set by the speed and timing jitter of electronics, and should find broad applications ranging from high-speed wireless to defense electronics.

physics.optics↗

Parallel Interleaver Design for a High Throughput HSPA+/LTE Multi-Standard Turbo Decoder

To meet the evolving data rate requirements of emerging wireless communication technologies, many parallel architectures have been proposed to implement high throughput turbo decoders. However, concurrent memory reading/writing in parallel turbo decoding architectures leads to severe memory conflict problem, which has become a major bottleneck for high throughput turbo decoders. In this paper, we propose a flexible and efficient VLSI architecture to solve the memory conflict problem for highly parallel turbo decoders targeting multi-standard 3G/4G wireless communication systems. To demonstrate the effectiveness of the proposed parallel interleaver architecture, we implemented an HSPA+/LTE/LTE-Advanced multi-standard turbo decoder with a 45nm CMOS technology. The implemented turbo decoder consists of 16 Radix-4 MAP decoder cores, and the chip core area is 2.43 mm^2. When clocked at 600 MHz, this turbo decoder can achieve a maximum decoding throughput of 826 Mbps in the HSPA+ mode and 1.67 Gbps in the LTE/LTE-Advanced mode, exceeding the peak data rate requirements for both standards.

cs.IT↗

An Adaptive Dictionary Learning Approach for Modeling Dynamical Textures

Video representation is an important and challenging task in the computer vision community. In this paper, we assume that image frames of a moving scene can be modeled as a Linear Dynamical System. We propose a sparse coding framework, named adaptive video dictionary learning (AVDL), to model a video adaptively. The developed framework is able to capture the dynamics of a moving scene by exploring both sparse properties and the temporal correlations of consecutive video frames. The proposed method is compared with state of the art video processing methods on several benchmark data sequences, which exhibit appearance changes and heavy occlusions.

cs.CV↗

Exact renormalization group analysis of turbulent transport by the shear flow

The exact renormalization group (RG) method initiated by Wilson and further developed by Polchinski is used to study the shear flow model proposed by Avellaneda and Majda as a simplified model for the diffusive transport of a passive scalar by a turbulent velocity field. It is shown that this exact RG method is capable of recovering all the scaling regimes as the spectral parameters of velocity statistics vary, found by Avellaneda and Majda in their rigorous study of this model. This gives further confidence that the RG method, if implemented in the right way instead of using drastic truncations as in the Yakhot-Orszag's approximate RG scheme, does give the correct prediction for the large scale behaviors of solutions of stochastic partial differential equations (PDE). We also derive the analog of the "large eddy simulation" models when a finite amount of small scales are eliminated from the problem.

math-ph↗

How to find G-admissible abelian coverings of a graph?

Given a finite connected simple graph $Γ$, and a subgroup $G$ of its automorphism group, a general method for finding all finite abelian regular coverings of $Γ$ that admit a lift of each element of $G$ is developed. As an application, all connected arc-transitive abelian regular coverings of the Petersen graph are classified up to isomorphism.

math.CO↗

Averaging Complex Subspaces via a Karcher Mean Approach

We propose a conjugate gradient type optimization technique for the computation of the Karcher mean on the set of complex linear subspaces of fixed dimension, modeled by the so-called Grassmannian. The identification of the Grassmannian with Hermitian projection matrices allows an accessible introduction of the geometric concepts required for an intrinsic conjugate gradient method. In particular, proper definitions of geodesics, parallel transport, and the Riemannian gradient of the Karcher mean function are presented. We provide an efficient step-size selection for the special case of one dimensional complex subspaces and illustrate how the method can be employed for blind identification via numerical experiments.

math.DG↗

Influence of the substrate and precursor on the magnetic and magneto-transport properties in magnetite films

We have investigated the magnetic and transport properties of nanoscaled Fe3O4 films obtained from Chemical Vapor Deposition (CVD) technique using [FeIIFe2III(OBut)8] and [Fe2III(OBut)6] precursors. Samples were deposited on different substrates (i.e., MgO (001), MgAl2O4 (001) and Al2O3 (0001)) with thicknesses varying from 50 to 350 nm. Atomic Force Microscopy analysis indicated a granular nature of the samples, irrespective of the synthesis conditions (precursor and deposition temperature, Tpre) and substrate. Despite the similar morphology of the films, magnetic and transport properties were found to depend on the precursor used for deposition. Using [FeIIFe2III(OBut)8] as precursor resulted in lower resistivity, higher MS and a sharper magnetization decrease at the Verwey transition (TV). The temperature dependence of resistivity was found to depend on the precursor and Tpre. We found that the transport is dominated by the density of antiferromagnetic antiphase boundaries (AF-APB's) when [FeIIFe2III(OBut)8] precursor and Tpre = 363 K are used. On the other hand, grain boundary-scattering seems to be the main mechanism when [Fe2III(OBut)6] is used. The Magnetoresistance (MR(H)) displayed an approximate linear behavior in the high field regime (H > 796 kA/m), with a maximum value at room-temperature of \sim2-3% for H = 1592 kA/m, irrespective from the transport mechanism.

cond-mat.mtrl-sci↗

Uniqueness Analysis of Non-Unitary Matrix Joint Diagonalization

Matrix Joint Diagonalization (MJD) is a powerful approach for solving the Blind Source Separation (BSS) problem. It relies on the construction of matrices which are diagonalized by the unknown demixing matrix. Their joint diagonalizer serves as a correct estimate of this demixing matrix only if it is uniquely determined. Thus, a critical question is under what conditions a joint diagonalizer is unique. In the present work we fully answer this question about the identifiability of MJD based BSS approaches and provide a general result on uniqueness conditions of matrix joint diagonalization. It unifies all existing results which exploit the concepts of non-circularity, non-stationarity, non-whiteness, and non-Gaussianity. As a corollary, we propose a solution for complex BSS, which can be formulated in a closed form in terms of an eigenvalue and a singular value decomposition of two matrices.

cs.IT↗

Blind Source Separation with Compressively Sensed Linear Mixtures

This work studies the problem of simultaneously separating and reconstructing signals from compressively sensed linear mixtures. We assume that all source signals share a common sparse representation basis. The approach combines classical Compressive Sensing (CS) theory with a linear mixing model. It allows the mixtures to be sampled independently of each other. If samples are acquired in the time domain, this means that the sensors need not be synchronized. Since Blind Source Separation (BSS) from a linear mixture is only possible up to permutation and scaling, factoring out these ambiguities leads to a minimization problem on the so-called oblique manifold. We develop a geometric conjugate subgradient method that scales to large systems for solving the problem. Numerical results demonstrate the promising performance of the proposed algorithm compared to several state of the art methods.

cs.IT↗

New Constraints from PAMELA anti-proton data on Annihilating and Decaying Dark Matter

Recently the PAMELA experiment has released its updated anti-proton flux and anti-proton to proton flux ratio data up to energies of ~200GeV. With no clear excess of cosmic ray anti-protons at high energies, one can extend constraints on the production of anti-protons from dark matter. In this letter, we consider both the cases of dark matter annihilating and decaying into standard model particles that produce significant numbers of anti-protons. We provide two sets of constraints on the annihilation cross-sections/decay lifetimes. In the one set of constraints we ignore any source of anti-protons other than dark matter, which give the highest allowed cross-sections/inverse lifetimes. In the other set we include also anti-protons produced in collisions of cosmic rays with interstellar medium nuclei, getting tighter but more realistic constraints on the annihilation cross-sections/decay lifetimes.

astro-ph.HE↗

The fine intersection problem for Steiner triple systems

The intersection of two Steiner triple systems (X,A) and (X,B) is the set A intersect B. The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m,n) such that there exist two Steiner triple systems of order v whose intersection has n blocks over m points. We show that for v = 1 or 3 (mod 6), |I(v)| = Omega(v^3), where previous results only imply that |I(v)| = Omega(v^2).

math.CO↗

The PBD-Closure of Constant-Composition Codes

We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the size of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven.

cs.IT↗