Last update: Wed Sep 26 02:10:27 MDT 2018
Top |
Symbols |
Numbers |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@InProceedings{Woo:1991:PPF,
author = "M.-l. Woo and R. A. Renaut",
title = "Parallel power-of-two {FFTs} on hypercubes",
crossref = "IEEE:1991:PSA",
pages = "754--763",
year = "1991",
bibdate = "Wed Apr 15 16:28:01 MDT 1998",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods); C4230M
(Multiprocessor interconnection); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Dept. of Math., Arizona State Univ., Tempe, AZ, USA",
keywords = "computational complexity; distance one algorithm;
distance two algorithm; fast Fourier transforms;
hypercube architectures; hypercube networks;
interprocessor communications; ordered power-of-two
fast Fourier transforms; packet transmission; parallel
algorithms; parallel power of two FFTs; time
complexity",
sponsororg = "IEEE; ACM",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algorithm,
0(0)xxiii--917,
0(0)4,
0(0)56,
0(0)101,
0(0)122,
0(0)139,
0(0)187,
0(0)197,
0(0)218,
0(0)294,
0(0)316,
0(0)462,
0(0)502,
0(0)512,
0(0)578,
0(0)600,
0(0)633,
0(0)654,
0(0)678,
0(0)702,
0(0)712,
0(0)722,
0(0)732,
0(0)742,
0(0)764,
0(0)786,
0(0)842,
0(0)854,
0(0)866
- architecture,
0(0)46,
0(0)56,
0(0)122,
0(0)176,
0(0)187,
0(0)208,
0(0)348,
0(0)358,
0(0)370,
0(0)390,
0(0)554,
0(0)578,
0(0)654,
0(0)664,
0(0)682,
0(0)692,
0(0)702,
0(0)764,
0(0)776,
0(0)786,
0(0)842,
0(0)900
- C4190,
0(0)166
- C4230M,
0(0)380,
0(0)390,
0(0)400,
0(0)644,
0(0)654,
0(0)732,
0(0)764,
0(0)776
- C4240P,
0(0)197,
0(0)462,
0(0)578,
0(0)600,
0(0)633,
0(0)712,
0(0)722,
0(0)732,
0(0)742,
0(0)764,
0(0)786,
0(0)842,
0(0)854,
0(0)866
- communications,
0(0)101,
0(0)446,
0(0)644
- complexity,
0(0)4,
0(0)187,
0(0)197,
0(0)294,
0(0)512,
0(0)633,
0(0)732,
0(0)742
- computational,
0(0)4,
0(0)68,
0(0)158,
0(0)166,
0(0)187,
0(0)197,
0(0)230,
0(0)242,
0(0)294,
0(0)304,
0(0)462,
0(0)512,
0(0)541,
0(0)633,
0(0)732,
0(0)742
- distance,
0(0)390
- fast,
0(0)4,
0(0)56,
0(0)166,
0(0)446,
0(0)633
- FFTs,
0(0)446
- Fourier,
0(0)166,
0(0)446
- hypercube,
0(0)446,
0(0)578,
0(0)654,
0(0)764
- interconnection,
0(0)46,
0(0)358,
0(0)370,
0(0)380,
0(0)390,
0(0)400,
0(0)644,
0(0)654,
0(0)732,
0(0)764,
0(0)776,
0(0)818
- interprocessor,
0(0)316
- method,
0(0)56,
0(0)130,
0(0)158,
0(0)166,
0(0)218,
0(0)230,
0(0)242,
0(0)294,
0(0)304,
0(0)348,
0(0)462,
0(0)512,
0(0)522,
0(0)578,
0(0)610,
0(0)644,
0(0)722
- multiprocessor,
0(0)xxiii--917,
0(0)36,
0(0)46,
0(0)68,
0(0)86,
0(0)150,
0(0)158,
0(0)166,
0(0)208,
0(0)230,
0(0)304,
0(0)316,
0(0)328,
0(0)338,
0(0)380,
0(0)390,
0(0)400,
0(0)424,
0(0)481,
0(0)522,
0(0)540,
0(0)541,
0(0)554,
0(0)567,
0(0)600,
0(0)644,
0(0)654,
0(0)664,
0(0)682,
0(0)712,
0(0)732,
0(0)764,
0(0)776,
0(0)806,
0(0)818,
0(0)830,
0(0)842,
0(0)900
- network,
0(0)36,
0(0)46,
0(0)253,
0(0)380,
0(0)390,
0(0)400,
0(0)435,
0(0)664,
0(0)732,
0(0)742,
0(0)764,
0(0)776,
0(0)818,
0(0)830
- numerical,
0(0)xxiii--917,
0(0)101,
0(0)158,
0(0)166,
0(0)338,
0(0)412,
0(0)542,
0(0)678
- one,
0(0)806
- ordered,
0(0)197
- other,
0(0)14,
0(0)86,
0(0)101,
0(0)111,
0(0)158,
0(0)166,
0(0)208,
0(0)230,
0(0)294,
0(0)304,
0(0)338,
0(0)424,
0(0)544,
0(0)610,
0(0)620,
0(0)806,
0(0)842,
0(0)854,
0(0)900
- packet,
0(0)522,
0(0)654
- theory,
0(0)4,
0(0)158,
0(0)166,
0(0)187,
0(0)197,
0(0)230,
0(0)242,
0(0)294,
0(0)304,
0(0)462,
0(0)512,
0(0)578,
0(0)600,
0(0)633,
0(0)644,
0(0)654,
0(0)702,
0(0)712,
0(0)722,
0(0)732,
0(0)742,
0(0)764,
0(0)786,
0(0)806,
0(0)830,
0(0)842,
0(0)854,
0(0)866
- time,
0(0)4,
0(0)101,
0(0)370,
0(0)481,
0(0)502,
0(0)610,
0(0)633,
0(0)644,
0(0)677,
0(0)682,
0(0)742,
0(0)830,
0(0)842
- transforms,
0(0)166,
0(0)446
- transmission,
0(0)534,
0(0)644
- two,
0(0)56,
0(0)166