Parallel computation of the time-frequency power spectrum: Analysis and comparison to the bispectrum

K. N. Le, G. K. Egan, K. P. Dabke

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

2 Citations (Scopus)

Abstract

Experiments of large data sets are computationally expensive. Signal processing analysis on a single CPU leads to unacceptably long execution times. The paper presents initial experiments on calculating the time-frequency power spectrum using the coarse-grained parallel programming technique. Experimental speedup factors are given and discussed. The measured speedup factor of the time-frequency power spectrum parallel calculation process is sublinear which indicates that the time-frequency power spectrum is a suitable application for parallel programming. The parallel efficiency is acceptable with the lowest value of 75.1% occurring at N = 10. The maximum speedup factor of 9.1 is obtained when N = 12 at 75.3% of efficiency.

Original languageEnglish
Title of host publication2001 International Conferences on Info-Tech and Info-Net
Subtitle of host publicationA Key to Better Life, ICII 2001 - Proceedings
EditorsZhongzhi Shi, Hui Li, Y.X. Zhong
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages322-327
Number of pages6
ISBN (Electronic)0780370104, 9780780370104
DOIs
Publication statusPublished - 2001
Externally publishedYes
EventInternational Conferences on Info-Tech and Info-Net, ICII 2001 - Beijing, China
Duration: 29 Oct 20011 Nov 2001

Publication series

Name2001 International Conferences on Info-Tech and Info-Net: A Key to Better Life, ICII 2001 - Proceedings
Volume3

Conference

ConferenceInternational Conferences on Info-Tech and Info-Net, ICII 2001
Country/TerritoryChina
CityBeijing
Period29/10/011/11/01

Bibliographical note

Publisher Copyright:
© 2001 IEEE.

Fingerprint

Dive into the research topics of 'Parallel computation of the time-frequency power spectrum: Analysis and comparison to the bispectrum'. Together they form a unique fingerprint.

Cite this