Data Clustering by Minimum Difference Tree and PRI Transform

Abstract

Data clustering is an important problem in communication systems. In this paper a new algorithm for data clustering in a communication system is presented. The algorithm combines two techniques, the minimum difference tree and the PRI transform, to cluster the interleaved pulse trains. Since the method uses matrix and recursive computation, it has… (More)

Topics

8 Figures and Tables

Cite this paper

@inproceedings{Naseri2002DataCB, title={Data Clustering by Minimum Difference Tree and PRI Transform}, author={Amine Naseri and Hadi Shahriar Shahhoseini and Madjid Naderi}, year={2002} }