Distributed adaptive node-specific MMSE signal estimation in sensor networks with a tree topology

European Signal Processing Conference

Volumn , Issue , 2009, Pages 794-798

  Bertrand, Alexander ^a   Moonen, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR COMBINATIONS; MULTIHOP TRANSMISSION; SIGNAL ESTIMATION; TREE TOPOLOGY;

ALGORITHMS; FORESTRY; RANDOM PROCESSES; SIGNAL ANALYSIS; TOPOLOGY; TREES (MATHEMATICS);

SENSOR NODES;

EID: 84863767719     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. D. Estrin, L. Girod, G. Pottie, and M. Srivastava, "Instrumenting the world with wireless sensor networks," Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on, vol. 4, pp. 2033-2036 vol.4, 2001.
2. A. Bertrand and M. Moonen, "Distributed adaptive estimation of node-specific signals in a fully connected sensor network," Internal report K.U. Leuven ESAT/SCD-SISTA, submitted for publication, 2009.
3. A. Bertrand and M. Moonen, "Distributed adaptive estimation of correlated node-specific signals in a fully connected sensor network," Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP), April 2009.
4. S. Doclo, T. Klasen, T. Van den Bogaert, J. Wouters, and M. Moonen, "Theoretical analysis of binaural cue preservation using multi-channel wiener filtering and interaural transfer functions," Proc. Int. Workshop on Acoustic Echo and Noise Control (IWAENC), Paris, France, Sep. 2006.
5. A. Bertrand and M. Moonen, "Robust distributed noise reduction in hearing aids with external acoustic sensor nodes," Internal report K.U. Leuven ESAT/SCD-SISTA, submitted for publication, 2009.
6. S. Doclo, T. van den Bogaert, M. Moonen, and J. Wouters, "Reduced-bandwidth and distributed mwf-based noise reduction algorithms for binaural hearing aids," IEEE Trans. Audio, Speech and Language Processing, vol. 17, pp. 38-51, Jan 2009.
7. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proceedings of the American Mathematical Society, vol. 7, pp. 48-50, Feb 1956.
8. H. Chen, A. Campbell, B. Thomas, and A. Tamir, "Minimax flow tree problems," forthcoming in Networks, 2008.