Consiglio Nazionale delle Ricerche

Tipo di prodottoContributo in atti di convegno
TitoloSpace-time multiuser detectors for TDD-UTRA: design and optimization
Anno di pubblicazione2001
Formato
  • Elettronico
  • Cartaceo
Autore/iM. Beretta, A. Colamonico, M. Nicoli, V. Rampa, U. Spagnolini
Affiliazioni autoriD.E.I. - Politecnico di Milano; Siemens ICN, Cinisello Balsamo; D.E.I. - Politecnico di Milano; CSTS-CNR, Milano; D.E.I. - Politecnico di Milano
Autori CNR e affiliazioni
  • VITTORIO RAMPA
Lingua/e-
AbstractLinear multiuser detection (MUD) for frequency selective channels has always been considered a prohibitive computational task in CDMA systems. In time slotted CDMA, the block-type MUD involves the inversion of a large matrix that depends on the block size and on the number of users. Sub-optimal techniques are computationally efficient but show some performance degradation. The reduced complexity detectors can be either block-type or one-shot. Compared to one-shot approximation of MUD, the block-type detectors have less computational complexity and large latency. However, the tracking of channel variations within the block is not feasible with any block-type processing (e.g., for the adaptive receiver). These compelling aspects force us to use a one-shot MUD algorithm for space-time channels such as the sliding window decorrelator (SWD). Block-based MUD and SWD algorithms for TDD-UTRA system are compared in term of performance, computational complexity, parallelism and hardware implementation.
Lingua abstractinglese
Altro abstract-
Lingua altro abstract-
Pagine da375
Pagine a379
Pagine totali5
Rivista-
Numero volume della rivista1
Serie/Collana-
Titolo del volume-
Numero volume della serie/collana-
Curatore/i del volume-
ISBN0-7803-7005-8
DOI10.1109/VTC.2001.956623
Editore
  • IEEE - Institute of Electrical and Electronics Engineers, Piscataway, N.J. (Stati Uniti d'America)
Verificato da refereeSì: Internazionale
Stato della pubblicazione-
Indicizzazione (in banche dati controllate)
  • IEEE Xplore digital library (Codice:956623)
  • ISI Web of Science (WOS) (Codice:000173938400078)
  • Scopus (Codice:2-s2.0-0035183419)
Parole chiaveUMTS, TD-SCDMA, multiuser detection, computational complexity
Link (URL, URI)http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=956623
Titolo convegno/congressoProc. 54th Vehicular Technology Conference 2001 (VTC 2001 Fall)
Luogo convegno/congressoAtlantic City (USA)
Data/e convegno/congresso7-11 Oct.
RilevanzaInternazionale
RelazioneContributo
Titolo parallelo-
Note/Altre informazioni-
Strutture CNR
  • IEIIT — Istituto di elettronica e di ingegneria dell'informazione e delle telecomunicazioni
Moduli CNR
    Progetti Europei-
    Allegati
    • Space-time multiuser detectors for TDD-UTRA: design and optimization
      Descrizione: Published paper

    Dati storici
    I dati storici non sono modificabili, sono stati ereditati da altri sistemi (es. Gestione Istituti, PUMA, ...) e hanno solo valore storico.
    Area disciplinareInformation Technology & Communications Systems
    Area valutazione CIVRIngegneria industriale e informatica
    Descrizione sintetica del prodottoLinear multiuser detection (MUD) for frequency selective channels has always been considered a prohibitive computational task in CDMA systems. In time slotted CDMA, the block-type MUD involves the inversion of a large matrix that depends on the block size and on the number of users. Sub-optimal techniques are computationally efficient but show some performance degradation. The reduced complexity detectors can be either block-type or one-shot. Compared to one-shot approximation of MUD, the block-type detectors have less computational complexity and large latency. However, the tracking of channel variations within the block is not feasible with any block-type processing (e.g., for the adaptive receiver). These compelling aspects force us to use a one-shot MUD algorithm for space-time channels such as the sliding window decorrelator (SWD). Block-based MUD and SWD algorithms for TDD-UTRA systems are compared in terms of performance, computational complexity, parallelism and hardware implementation.