Diagnosis of convoluting systems by space-time compression

Author

Vainstein, Feodore ; Hannon, Kevin

Author_Institution

North Carolina A&T State Univ., Greensboro, NC, USA

fYear

1995

fDate

12-14 Mar 1995

Firstpage

216

Lastpage

220

Abstract

The paper investigates fault detection in butterfly networks by considering a space time compression technique proposed by M.G. Karpovsky, L.B. Levitin and E.S. Vainstein (1990). The method of the paper is to show that the time compression technique works for the FFT butterfly network. Reduced matrices for the case when the upper vertex of the tree is absent is also investigated. Details and examples are presented. Preliminary results show that the space time compression technique can be used to determine the fault coverage of the FFT butterfly network and that the reduction of the error matrix may not be achievable

Keywords

convolution; data compression; fast Fourier transforms; fault diagnosis; hypercube networks; matrix algebra; signal processing; FFT; butterfly networks; convoluting systems; error matrix; fault coverage; fault detection; reduced matrices; space time compression technique; space-time compression; time compression technique; Concurrent computing; Convolution; Digital signal processing; Fast Fourier transforms; Fault detection; Fault location; Radar applications; Signal processing algorithms; System buses; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1995., Proceedings of the Twenty-Seventh Southeastern Symposium on

Conference_Location

Starkville, MS

ISSN

0094-2898

Print_ISBN

0-8186-6985-3

Type

conf

DOI

10.1109/SSST.1995.390581

Filename

390581