Sciweavers

1021 search results - page 8 / 205
» On the correlation of binary sequences
Sort
View
ICC
2009
IEEE
116views Communications» more  ICC 2009»
14 years 7 months ago
Efficient Implementation of Binary Sequence Generator for WiMAX and WRAN on Programmable Digital Signal Processor
In this paper, an efficient design for implementing binary sequence generator on 32-bit instruction execution mode TI TMS320C6416 DSP is presented. The main goal is to achieve high...
Lok Tiing Tie, Ser Wah Oh, K. J. M. Kua
SETA
2004
Springer
79views Mathematics» more  SETA 2004»
15 years 3 months ago
A Survey of the Merit Factor Problem for Binary Sequences
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
Jonathan Jedwab
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
15 years 1 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
Simone Faro, Thierry Lecroq
EJC
2010
14 years 10 months ago
Minimum degree and density of binary sequences
3 For d, k N with k 2d, let g(d, k) denote the infimum density of binary4 sequences (xi)iZ {0, 1}Z which satisfy the minimum degree condition d j=1 (xi+j +5
Stephan Brandt, Janina Müttel, Dieter Rautenb...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 4 months ago
A memetic algorithm for the low autocorrelation binary sequence problem
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
José E. Gallardo, Carlos Cotta, Antonio J. ...