### Abstract

A least squares (LS) pole-zero algorithm in the transform domain which fits each of the retained subsets of the complex transform components accurately is presented. The pole-zero function, while characterized by real coefficients about twice the number of the retained complex transform components, carries enough location, magnitude, and phase information for accurate signal reconstruction. The algorithm is applied for the coding of the mixed DFT-WHT parameters. Results are given for 8 Kb/s and 6.4 Kb/s.

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

Title of host publication | Midwest Symposium on Circuits and Systems |

Place of Publication | Piscataway, NJ, United States |

Publisher | Publ by IEEE |

Pages | 598-601 |

Number of pages | 4 |

State | Published - 1990 |

Event | Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) - Champaign, IL, USA Duration: Aug 14 1989 → Aug 16 1989 |

### Other

Other | Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) |
---|---|

City | Champaign, IL, USA |

Period | 8/14/89 → 8/16/89 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials

### Cite this

*Midwest Symposium on Circuits and Systems*(pp. 598-601). Piscataway, NJ, United States: Publ by IEEE.

**An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions.** / Spanias, Andreas; Mikhael, Wasfy B.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Midwest Symposium on Circuits and Systems.*Publ by IEEE, Piscataway, NJ, United States, pp. 598-601, Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, 8/14/89.

}

TY - GEN

T1 - An adaptive bit allocation scheme for coding of speech signals using partial sets of orthogonal functions

AU - Spanias, Andreas

AU - Mikhael, Wasfy B.

PY - 1990

Y1 - 1990

N2 - A least squares (LS) pole-zero algorithm in the transform domain which fits each of the retained subsets of the complex transform components accurately is presented. The pole-zero function, while characterized by real coefficients about twice the number of the retained complex transform components, carries enough location, magnitude, and phase information for accurate signal reconstruction. The algorithm is applied for the coding of the mixed DFT-WHT parameters. Results are given for 8 Kb/s and 6.4 Kb/s.

AB - A least squares (LS) pole-zero algorithm in the transform domain which fits each of the retained subsets of the complex transform components accurately is presented. The pole-zero function, while characterized by real coefficients about twice the number of the retained complex transform components, carries enough location, magnitude, and phase information for accurate signal reconstruction. The algorithm is applied for the coding of the mixed DFT-WHT parameters. Results are given for 8 Kb/s and 6.4 Kb/s.

UR - http://www.scopus.com/inward/record.url?scp=0025646887&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025646887&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025646887

SP - 598

EP - 601

BT - Midwest Symposium on Circuits and Systems

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -