This paper proposes a novel representation, known as Lv's distribution (LVD), of linear frequency modulated (LFM) signals. It has been well known that a monocomponent LFM signal can be uniquely determined by two important physical quantities, centroid frequency and chirp rate (CFCR). The basic reason for expressing a LFM signal in the CFCR domain is that these two quantities may not be apparent in the time or time-frequency (TF) domain. The goal of the LVD is to naturally and accurately represent a mono- or multicomponent LFM in the CFCR domain. The proposed LVD is simple and only requires a two-dimensional (2-D) Fourier transform of a parametric scaled symmetric instantaneous autocorrelation function. It can be easily implemented by using the complex multiplications and fast Fourier transforms (FFT) based on the scaling principle. The computational complexity, properties, detection performance and representation errors are analyzed for this new distribution. Comparisons with three other popular methods, Radon-Wigner transform (RWT), Radon-Ambiguity transform (RAT), and fractional Fourier transform (FRFT) are performed. With several numerical examples, our distribution is demonstrated to be a CFCR representation that is computed without using any searching operation. The main significance of the LVD is to convert a 1-D LFM into a 2-D single-frequency signal. One of the most important applications of the LVD is to generate a new TF representation, called inverse LVD (ILVD), and a new ambiguity function, called Lv's ambiguity function (LVAF), both of which may break through the tradeoff between resolution and cross terms.
22 May 2015 in IEEE Communications Surveys & Tutorials
Low-density parity-check (LDPC) codes have attracted much attention over the past two decades since they can asymptotically approach the Shannon capacity in a variety of data transmission and storage scenarios. As a type of promising structured LDPC codes, the protograph LDPC codes not only inherit the advantage of conventional LDPC codes, i.e., excellent error performance, but also possess simple representations to realize fast encoding and efficient decoding. This paper provides a comprehensive survey on the state-of-the-art in protograph LDPC code design and analysis for different channel conditions, including the additive white Gaussian noise (AWGN) channels, fading channels, partial response (PR) channels, and Poisson pulse-position modulation (PPM) channels. Moreover, the applications of protograph LDPC codes to joint source-and-channel coding (JSCC) and joint channel-and-physical-layer-network coding (JCPNC) are reviewed and studied. In particular, we focus our attention on the encoding design and assume the decoder is implemented by the belief propagation (BP) algorithm. Hopefully, this survey may facilitate research in this area.
24 September 2015 in IEEE Transactions on Signal Processing
Direction of arrival (DOA) estimation methods based on joint sparsity are attractive due to their superiority of high resolution with a limited number of snapshots. However, the common assumption that signals from different directions share the spectral band is inappropriate when they occupy different bands. To flexibly deal with this situation, a novel wideband DOA estimation algorithm is proposed to simultaneously infer the band occupation and estimate high-resolution DOAs by leveraging the sparsity in the angular domain. The band occupation is exploited by exerting a Dirichlet process (DP) prior over the latent parametric space. Moreover, the proposed method is extended to deal with the off-grid problem by two schemes. One applies a linear approximation to the true dictionary and infers the hidden variables and parameters by the variational Bayesian expectation-maximization (VBEM) in an integrated manner. The other is the separated scheme where DOA is refined by a postsearching procedure based on the reconstructed results. Since the proposed schemes can automatically partition the sub-bands into clusters according to their underlying occupation, more accurate DOA estimation can be achieved by using the measurements within one cluster. Results of comprehensive simulations demonstrate that the proposed schemes outperform other reported ones.
29 January 2014 in IEEE Transactions on Geoscience and Remote Sensing
For inverse synthetic aperture radar imagery, the inherent sparsity of the scatterers in the range-Doppler domain has been exploited to achieve a high-resolution range profile or Doppler spectrum. Prior to applying the sparse recovery technique, preprocessing procedures are performed for the minimization of the translational-motion-induced Doppler effects. Due to the imperfection of coarse motion compensation, the autofocus technique is further required to eliminate the residual phase errors. This paper considers the phase error correction problem in the context of the sparse signal recovery technique. In order to encode sparsity, a multitask Bayesian model is utilized to probabilistically formulate this problem in a hierarchical manner. In this novel method, a focused high-resolution radar image is obtained by estimating the sparse scattering coefficients and phase errors in individual and global stages, respectively, to statistically make use of the sparsity. The superiority of this algorithm is that the uncertainty information of the estimation can be properly incorporated to obtain enhanced estimation accuracy. Moreover, the proposed algorithm achieves guaranteed convergence and avoids a tedious parameter-tuning procedure. Experimental results based on synthetic and practical data have demonstrated that our method has a desirable denoising capability and can produce a relatively well-focused image of the target, particularly in low signal-to-noise ratio and high undersampling ratio scenarios, compared with other recently reported methods.
23 December 2013 in IEEE Transactions on Geoscience and Remote Sensing
This paper presents a novel inverse synthetic aperture radar (ISAR) imaging method by exploiting the inherent continuity of the scatterers on the target scene to obtain enhanced target images within a Bayesian framework. A simplified radar system is utilized by transmitting the sparse probing frequency signal, where the ISAR imaging problem can be converted to deal with underdetermined linear inverse scattering. Following the Bayesian compressive sensing (BCS) theory, a hierarchical Bayesian prior is employed to model the scatterers in the range-Doppler plane. In contrast to the independent prior on each scatterer in the conventional BCS, a correlated prior is proposed to statistically encourage the continuity structure of the scatterers in the target region. To overcome the intractability of the posterior distribution, the Gibbs sampling strategy is used for Bayesian inference. The parameters of the signal model are inferred efficiently from samples obtained by the Gibbs sampler. Because the proposed method is a data-driven learning process, the tedious parameter tuning process required by the convex optimization-based approaches can be avoided. Both the synthetic and the experimental results demonstrate that the proposed algorithm can achieve substantial improvements in the scenarios of limited measurements and low signal-to-noise ratio compared with other reported algorithms for ISAR imaging problems.
13 January 2011 in IEEE Transactions on Signal Processing
Group Lasso is a mixed l1/l2-regularization method for a block-wise sparse model that has attracted a lot of interests in statistics, machine learning, and data mining. This paper establishes the possibility of stably recovering original signals from the noisy data using the adaptive group Lasso with a combination of sufficient block-sparsity and favorable block structure of the overcomplete dictionary. The corresponding theoretical results about the solution uniqueness, support recovery and representation error bound are derived based on the properties of block-coherence and subcoherence. Compared with the theoretical results on the parametrized quadratic program of conventional sparse representation, our stability results are more general. A comparison with block-based orthogonal greedy algorithm is also presented. Numerical experiments demonstrate the validity and correctness of theoretical derivation and also show that in case of noisy situation, the adaptive group Lasso has a better reconstruction performance than the quadratic program approach if the observed sparse signals have a natural block structure.