Name
Abstract | ||
|---|---|---|
Network echo canceler chips are designed to handle several channels simultaneously. With the processing speeds now available, a single chip might handle several hundred channels. In current implementations, however, the adaptation algorithm is designed for a single channel, and the computations are replicated N/sub c/ times, where N/sub c/ is the number of channels. With such an implementation, the computational requirement is N/sub c/ times the peak load for a single channel. The number of computations required in each channel, however, varies widely over time. Therefore, a considerable reduction in computational load can be achieved by designing the system for the average load plus a margin to account for load variations. The reduction in complexity is achieved by exploiting three features: (a) the inherent pauses in conversations; (b) the sparseness of network echo paths; and (c) the fact that an adaptive filter does not need to be updated when the error signal is small. It is shown that, in principle, such a design can reduce the computational load by a very large factor - perhaps as large as thirty. It remains to be seen whether a customized hardware architecture can be implemented to take advantage fully of the proposed algorithm. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/ICASSP.2001.940347 | ICASSP '01). 2001 IEEE International Conference |
Keywords | Field | DocType |
adaptive filters,adaptive signal processing,digital signal processing chips,echo suppression,speech processing,telephony,adaptation algorithm,adaptive filter,average load,channel,computational load reduction,conversation pauses,dynamic resource allocation,load variation margin,network echo canceler chips,network echo cancellation,network echo path sparseness | Speech processing,Mathematical optimization,Computer science,Communication channel,Real-time computing,Chip,Resource allocation,Adaptive filter,Telephony,Computer engineering,Hardware architecture,Computation | Conference |
Volume | ISSN | ISBN |
5 | 1520-6149 | 0-7803-7041-4 |
Citations | PageRank | References |
6 | 0.67 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomas Gänsler | 1 | 101 | 9.60 |
| Jacob Benesty | 2 | 1941 | 146.01 |
| M. M. Sondhi | 3 | 347 | 29.43 |
| S. L. Gay | 4 | 129 | 18.00 |