A reduced-complexity 'blind' space-frequency algorithm for peer-to-peer MFSK-FFH-CDMA detection & co-channel interference suppression.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F03%3A16030248" target="_blank" >RIV/67985556:_____/03:16030248 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

A reduced-complexity 'blind' space-frequency algorithm for peer-to-peer MFSK-FFH-CDMA detection & co-channel interference suppression.

Original language description

Wong [5] has earlier proposed a new transmission-detection scheme to 'blindly' detect an M-ary frequency-shift-keying (MFSK) fast frequency-hop (FFH) peer-to-peer codedivision multiple-access (CDMA) signal-of-interest (SOI) amid unknown co-channel interferences. A computationally more efficient realization of that earlier algorithm is herein presented. Also herein demonstrated is the efficacy of the proposed scheme for Galois-fields-based FFH-CDMA modulation.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

<a href="/en/project/GA102%2F01%2F0021" target="_blank" >GA102/01/0021: Nonlinear estimation and change detection for stochastic systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

IEEE Global Telecommunications Conference.

ISBN

0-7803-7975-6

ISSN

—

e-ISSN

—

Number of pages

5

Pages from-to

1-5

Publisher name

IEEE Communications Society

Place of publication

San Francisco

Event location

San Francisco [US]

Event date

Dec 1, 2003

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—