6,060 research outputs found

    Performance Analysis of l_0 Norm Constraint Least Mean Square Algorithm

    Full text link
    As one of the recently proposed algorithms for sparse system identification, l0l_0 norm constraint Least Mean Square (l0l_0-LMS) algorithm modifies the cost function of the traditional method with a penalty of tap-weight sparsity. The performance of l0l_0-LMS is quite attractive compared with its various precursors. However, there has been no detailed study of its performance. This paper presents all-around and throughout theoretical performance analysis of l0l_0-LMS for white Gaussian input data based on some reasonable assumptions. Expressions for steady-state mean square deviation (MSD) are derived and discussed with respect to algorithm parameters and system sparsity. The parameter selection rule is established for achieving the best performance. Approximated with Taylor series, the instantaneous behavior is also derived. In addition, the relationship between l0l_0-LMS and some previous arts and the sufficient conditions for l0l_0-LMS to accelerate convergence are set up. Finally, all of the theoretical results are compared with simulations and are shown to agree well in a large range of parameter setting.Comment: 31 pages, 8 figure

    A Robust Zero-point Attraction LMS Algorithm on Near Sparse System Identification

    Full text link
    The newly proposed l1l_1 norm constraint zero-point attraction Least Mean Square algorithm (ZA-LMS) demonstrates excellent performance on exact sparse system identification. However, ZA-LMS has less advantage against standard LMS when the system is near sparse. Thus, in this paper, firstly the near sparse system modeling by Generalized Gaussian Distribution is recommended, where the sparsity is defined accordingly. Secondly, two modifications to the ZA-LMS algorithm have been made. The l1l_1 norm penalty is replaced by a partial l1l_1 norm in the cost function, enhancing robustness without increasing the computational complexity. Moreover, the zero-point attraction item is weighted by the magnitude of estimation error which adjusts the zero-point attraction force dynamically. By combining the two improvements, Dynamic Windowing ZA-LMS (DWZA-LMS) algorithm is further proposed, which shows better performance on near sparse system identification. In addition, the mean square performance of DWZA-LMS algorithm is analyzed. Finally, computer simulations demonstrate the effectiveness of the proposed algorithm and verify the result of theoretical analysis.Comment: 20 pages, 11 figure

    Spectral function and fidelity susceptibility in quantum critical phenomena

    Full text link
    In this paper, we derive a simple equality that relates the spectral function I(k,ω)I(k,\omega) and the fidelity susceptibility χF\chi_F, i.e. χF=limη0πηI(0,iη)% \chi_F=\lim_{\eta\rightarrow 0}\frac{\pi}{\eta} I(0, i\eta) with η\eta being the half-width of the resonance peak in the spectral function. Since the spectral function can be measured in experiments by the neutron scattering or the angle-resolved photoemission spectroscopy(ARPES) technique, our equality makes the fidelity susceptibility directly measurable in experiments. Physically, our equality reveals also that the resonance peak in the spectral function actually denotes a quantum criticality-like point at which the solid state seemly undergoes a significant change.Comment: 5 pages, 2 figure

    Scaling dimension of fidelity susceptibility in quantum phase transitions

    Full text link
    We analyze ground-state behaviors of fidelity susceptibility (FS) and show that the FS has its own distinct dimension instead of real system's dimension in general quantum phases. The scaling relation of the FS in quantum phase transitions (QPTs) is then established on more general grounds. Depending on whether the FS's dimensions of two neighboring quantum phases are the same or not, we are able to classify QPTs into two distinct types. For the latter type, the change in the FS's dimension is a characteristic that separates two phases. As a non-trivial application to the Kitaev honeycomb model, we find that the FS is proportional to L2lnLL^2\ln L in the gapless phase, while L2L^2 in the gapped phase. Therefore, the extra dimension of lnL\ln L can be used as a characteristic of the gapless phase.Comment: 4 pages, 1 figure, final version to appear in EP
    corecore