Low complexity concurrent error detection for complex multiplication

Salvatore Pontarelli, Pedro Reviriego, Chris J. Bleakley, Juan Antonio Maestro

Research output: Contribution to journalArticle (Academic Journal)peer-review

12 Citations (Scopus)


This paper studies the problem of designing a low complexity Concurrent Error Detection (CED) circuit for the complex multiplication function commonly used in Digital Signal Processing circuits. Five novel CED architectures are proposed and their computational complexity, area, and delay evaluated in several circuit implementations. The most efficient architecture proposed reduces the number of gates required by up to 30 percent when compared with a conventional CED architecture based on Dual Modular Redundancy. Compared to a Residue Code CED scheme, the area of the proposed architectures is larger. However, for some of the proposed CEDs delay is significantly lower with reductions exceeding 30 percent in some configurations.

Original languageEnglish
Article number6327185
Pages (from-to)1899-1903
Number of pages5
JournalIEEE Transactions on Computers
Issue number9
Publication statusPublished - 12 Aug 2013


  • Complex multiplication
  • Concurrent error detection
  • Fault tolerance


Dive into the research topics of 'Low complexity concurrent error detection for complex multiplication'. Together they form a unique fingerprint.

Cite this