Let zj := e fj with fj ∈ (−∞, 0] + i [−π, π) be distinct nodes for j = 1, . . . ,M . With complex coefficients cj 6= 0, we consider a nonincreasing exponential sum h(x) := c1 e f1 x + . . . + cM e fM x (x ≥ 0). Many applications in electrical engineering, signal processing, and mathematical physics lead to the following problem: Determine all parameters of h, if 2N sampled values h(k) (k = 0, ....

A new algorithm based on least-squares method for harmonic and interharmonic analysis is proposed. The approach employs least-squares method and is based on a linear prediction relation for multiple sinusoidal signals. It is shown that the method allows for accurate harmonic and interharmonic estimation with high frequency resolution. The approach is compared with that of DFT method and prony m...

With the increasing demand of electric power supply, the necessity to transmit more power has become the need of the hour. The excess power can be transferred by building new infrastructure (costly and time taking) or by using series compensation (relatively cheaper and faster alternative). Series compensation is a technique in which line inductance is compensated by placing a capacitor in seri...

Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. Traditional approaches such as Basis Pursuit are based on relaxing a nonconvex `0-minimization problem [1]–[3]. In [4], a new polynomial complexity algorithm, ProSparse, is presented. ProSparse solves the sparse representation problem when the dictionary is the union...