Daniele Lo Iacono

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ettore Messina

> Home > Persons > Daniele Lo Iacono

Publications

2006
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/date/IaconoZMPSB06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/date/IaconoZMPSB06
Daniele Lo Iacono, J. Zory, Ettore Messina, Nicolo Piazzese, G. Saia, A. Bettinelli:
ASIP architecture for multi-standard wireless terminals. DATE Designers' Forum 2006: 118-123
2005
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/iswcs/IaconoZMP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iswcs/IaconoZMP05
Daniele Lo Iacono, J. Zory, Ettore Messina, Nicolo Piazzese:
Block processing engine for high-throughput wireless communications. ISWCS 2005: 118-122
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/wcnc/IaconoMVS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wcnc/IaconoMVS05
Daniele Lo Iacono, Ettore Messina, Costantino Volpe, Arnaldo Spalvieri:
Serial block processing for multi-code WCDMA frequency domain equalization. WCNC 2005: 164-170
2004
[c1]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/iscas/IaconoMAG04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscas/IaconoMAG04
Daniele Lo Iacono, Ettore Messina, Giuseppe Avellone, Agostino Galluzzo:
Memory optimization techniques for UMTS code generation. ISCAS (4) 2004: 73-76

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.