### Abstract

An algorithm based on a direction set (DS) method is presented for spectral estimation. It is a fast algorithm because it has a computational complexity of O(N) for each coefficient update. Its rate of convergence is comparable to that of the recently reported modified Conjugate Gradient (CG) algorithm which has a computational complexity of O(N^{2}). Computer simulations illustrate that this algorithm is very effective for spectral estimation. The frequency estimates generated by this algorithm are superior than those obtained by using the modified CG algorithm and yet at a lower computational cost. This algorithm can also be extended to other applications in adaptive signal processing.

Original language | English (US) |
---|---|

Pages | 146-149 |

Number of pages | 4 |

State | Published - Dec 1 1997 |

Externally published | Yes |

Event | Proceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2) - Victoria, Can Duration: Aug 20 1997 → Aug 22 1997 |

### Other

Other | Proceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2) |
---|---|

City | Victoria, Can |

Period | 8/20/97 → 8/22/97 |

### ASJC Scopus subject areas

- Signal Processing
- Computer Networks and Communications

## Fingerprint Dive into the research topics of 'Fast adaptive algorithm for spectral estimation'. Together they form a unique fingerprint.

## Cite this

*Fast adaptive algorithm for spectral estimation*. 146-149. Paper presented at Proceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2), Victoria, Can, .