The generations of the canonical signed digit (CSD) and of the generalised non-adjacent (GNAF) forms are investigated. The coding of these forms is reduced to a suitable prefix operation which requires O(log t) time to codify a sequence of t digits.

Fast VLSI circuits for CSD coding and GNAF coding

1996

Abstract

The generations of the canonical signed digit (CSD) and of the generalised non-adjacent (GNAF) forms are investigated. The coding of these forms is reduced to a suitable prefix operation which requires O(log t) time to codify a sequence of t digits.
1996
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
VLSI circuits
Analysis of Algorithms and Problem Complexity
File in questo prodotto:
File Dimensione Formato  
prod_413252-doc_145492.pdf

solo utenti autorizzati

Descrizione: Fast VLSI circuits for CSD coding and GNAF coding
Tipologia: Versione Editoriale (PDF)
Dimensione 618.48 kB
Formato Adobe PDF
618.48 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/371458
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? ND
social impact