Orthogonally anchored blind interference suppression using the Sato cost criterion

Michael L Honig*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

Abstract

A blind adaptive interference suppression algorithm for Direct-Sequence Code-Division Multiple-Access using the orthogonal Sato cost criterion is presented. The algorithm is blind in the sense that it does not require a training sequence, although it does require (approximate knowledge of the user spreading waveform and associated timing. This orthogonally anchored Sato cost function leads to a stochastic gradient algorithm that has the advantage relative to the minimum variance algorithms.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE
Number of pages1
StatePublished - Jan 1 1995
EventProceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can
Duration: Sep 17 1995Sep 22 1995

Other

OtherProceedings of the 1995 IEEE International Symposium on Information Theory
CityWhistler, BC, Can
Period9/17/959/22/95

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Fingerprint Dive into the research topics of 'Orthogonally anchored blind interference suppression using the Sato cost criterion'. Together they form a unique fingerprint.

Cite this