1998
DOI: 10.1109/7.722719
|View full text |Cite
|
Sign up to set email alerts
|

Mismatched filtering of odd-periodic binary sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2002
2002
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…To the best of our knowledge, there is no systematic method to construct optimum sequences except for time-consuming and costly exhaustive computer search. However, one can construct sequences with high filter efficiencies by mapping from -ary -sequences, or construct longer sequences from known sequences with high efficiencies by product theorem [6]- [8].…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…To the best of our knowledge, there is no systematic method to construct optimum sequences except for time-consuming and costly exhaustive computer search. However, one can construct sequences with high filter efficiencies by mapping from -ary -sequences, or construct longer sequences from known sequences with high efficiencies by product theorem [6]- [8].…”
Section: Preliminariesmentioning
confidence: 99%
“…In what follows, we refer to a sequence as being optimal for a given length if its efficiency , i.e., the ratio of the mismatched filter SNR to the matched filter SNR, takes on its maximum. In 1980, Ipatov published a table of optimum sequences up to length by computer search [8]. Further search results up to shown in [8] were originally found by Antweiler and Lüke.…”
Section: Introductionmentioning
confidence: 97%
See 1 more Smart Citation
“…In mismatched filtering systems, the sequence at the transmitter is different from that at the receiver [9].…”
Section: Introductionmentioning
confidence: 99%
“…In mismatched filtering systems, if u and v have small non-trivial correlation values, then u can be used as sending sequence in the transmitter and we can use correlation computation to detect u when setting v as address code in the receiver [1,2]. Sequence pairs are said to have perfect correlation if the non-trivial correlation values are all zero.…”
mentioning
confidence: 99%