Fault Detection for a Butterfly Unit in an FFT Processor

Masahiro TSUNOYAMA; Satoshi OOKUMA; Sachio NAITO

Fault Detection for a Butterfly Unit in an FFT Processor

Masahiro TSUNOYAMA, Satoshi OOKUMA, Sachio NAITO

Full Text Views

0

Cite this

Summary :

This letter proposes a concurrent fault detection scheme for a butterfly unit in an FFT processor. A fault in a butterfly unit is detected by recomuting. Input data to the butterfly unit is coded by a bit rotation and used for recomputing. The recomputed outputs are decoded and compared with the output for the first computation. The hardware overhead for the scheme is O(N) and the time overhead is O(log (N)) where N is the number of input data.

Publication: IEICE TRANSACTIONS on transactions Vol.E73-E No.8 pp.1310-1313

Publication Date: 1990/08/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section LETTER (Special Issue on Fault-Tolerant Systems)

Category

Authors

Masahiro TSUNOYAMA
Satoshi OOKUMA
Sachio NAITO

Keyword

Cite this

Copy

Masahiro TSUNOYAMA, Satoshi OOKUMA, Sachio NAITO, "Fault Detection for a Butterfly Unit in an FFT Processor" in IEICE TRANSACTIONS on transactions, vol. E73-E, no. 8, pp. 1310-1313, August 1990, doi: .
Abstract: This letter proposes a concurrent fault detection scheme for a butterfly unit in an FFT processor. A fault in a butterfly unit is detected by recomuting. Input data to the butterfly unit is coded by a bit rotation and used for recomputing. The recomputed outputs are decoded and compared with the output for the first computation. The hardware overhead for the scheme is O(N) and the time overhead is O(log (N)) where N is the number of input data.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_8_1310/_p

Copy

@ARTICLE{e73-e_8_1310,
author={Masahiro TSUNOYAMA, Satoshi OOKUMA, Sachio NAITO, },
journal={IEICE TRANSACTIONS on transactions},
title={Fault Detection for a Butterfly Unit in an FFT Processor},
year={1990},
volume={E73-E},
number={8},
pages={1310-1313},
abstract={This letter proposes a concurrent fault detection scheme for a butterfly unit in an FFT processor. A fault in a butterfly unit is detected by recomuting. Input data to the butterfly unit is coded by a bit rotation and used for recomputing. The recomputed outputs are decoded and compared with the output for the first computation. The hardware overhead for the scheme is O(N) and the time overhead is O(log (N)) where N is the number of input data.},
keywords={},
doi={},
ISSN={},
month={August},}

Copy

TY - JOUR
TI - Fault Detection for a Butterfly Unit in an FFT Processor
T2 - IEICE TRANSACTIONS on transactions
SP - 1310
EP - 1313
AU - Masahiro TSUNOYAMA
AU - Satoshi OOKUMA
AU - Sachio NAITO
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 8
JA - IEICE TRANSACTIONS on transactions
Y1 - August 1990
AB - This letter proposes a concurrent fault detection scheme for a butterfly unit in an FFT processor. A fault in a butterfly unit is detected by recomuting. Input data to the butterfly unit is coded by a bit rotation and used for recomputing. The recomputed outputs are decoded and compared with the output for the first computation. The hardware overhead for the scheme is O(N) and the time overhead is O(log (N)) where N is the number of input data.
ER -