๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimality of binary sequences for correlation choppers

โœ Scribed by Andrzej Graffstein


Publisher
Elsevier Science
Year
1975
Weight
535 KB
Volume
131
Category
Article
ISSN
0029-554X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Optimal sequence estimation for convolut
โœ Fuqin Xiong ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 752 KB

Decoding convolutional codes with binary digital modulation in intersymbol inter-Jerence (ISI) channels is studied. The receiver structure is a whitened matched filter (WMF) whose transi[br function is determined by the ISI channel. Decoding t~f the output sequence can be per/brined in two steps or

A Proof of the Welch and Niho Conjecture
โœ Henk D.L. Hollmann; Qing Xiang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 412 KB

Binary m-sequences are widely applied in navigation, radar, and communication systems because of their nice autocorrelation and cross-correlation properties. In this paper, we consider the cross-correlation between a binary m-sequence of length 2K!1 and a decimation of that sequence by an integer t.

Storage efficient decoding for a class o
โœ K.G. Paterson; M.J.B. Robshaw ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 748 KB

A binary span k de Bruijn sequence is a binary sequence of period 2 k such that each k-tuple of bits occurs exactly once as a subsequence in a period of the sequence. The de Bruijn sequences have applications in position sensing and range finding, as well as in other areas, by virtue of this subsequ