CNR Institutional Research Information System

In this paper, the canonical signed digit (CSD)coding and the generalized non-adjacent form (GNAF)-coding of signed integers are reduced to a prefix computation. Hence, these coding operations. Which seem at first glance strictly sequential, can be optirnally perallelized.

Parallel CSD-coding and its generalization

1995

Abstract

In this paper, the canonical signed digit (CSD)coding and the generalized non-adjacent form (GNAF)-coding of signed integers are reduced to a prefix computation. Hence, these coding operations. Which seem at first glance strictly sequential, can be optirnally perallelized.
1995
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Inglese
Proceedings of International Conference on high performance computing
730
733
4
Sì, ma tipo non specificato
27-30 December 1995
New Delhi, India
CSD-coding
Analysis of Algorithms and Problem Complexity
Codice PuMA: /cnr.iei/1995-A2-035
2
restricted
Das, S; Pinotti, Mc
273
info:eu-repo/semantics/conferenceObject
04 Contributo in convegno::04.01 Contributo in Atti di convegno
04.01 Contributo in Atti di convegno
File in questo prodotto:
File Dimensione Formato  
prod_409370-doc_143908.pdf

solo utenti autorizzati

Descrizione: Parallel CSD-coding and its generalization
Tipologia: Versione Editoriale (PDF)
Dimensione 830.51 kB
Formato Adobe PDF
  Visualizza/Apri   Richiedi una copia
830.51 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/364109
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact