Correlation properties of cyclic sequences
<p>In the unconstrained channel with additive Gaussian noise, where the optimum detector is based on correlation or matched filters, the quality of a code can be expressed as a function of the correlation values between code words. For a cyclic-sequence code, optimality reduces to a criterion...
id |
ndltd-CALTECH-oai-thesis.library.caltech.edu-3399 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-CALTECH-oai-thesis.library.caltech.edu-33992019-12-22T03:07:54Z Correlation properties of cyclic sequences Titsworth, Robert C. <p>In the unconstrained channel with additive Gaussian noise, where the optimum detector is based on correlation or matched filters, the quality of a code can be expressed as a function of the correlation values between code words. For a cyclic-sequence code, optimality reduces to a criterion to be met by the autocorrelation function of the sequence. Methods are presented here for determining cyclic sequences with given correlation properties.</p> <p>When the amount of equipment in the receiver is limited, matched filtering is no longer the optimal detection scheme. A better system, as is shown here, is one which, by the use of a Boolean function, combines several "component" sequences to generate the transmitted signal; the receiver consists of filters matched to each component. The logic, the number of components, the requirements of the component sequences to optimize the system, and a general method for treating Boolean logics are given in this work.</p> 1962 Thesis NonPeerReviewed application/pdf https://thesis.library.caltech.edu/3399/1/Titsworth_RC_1962.pdf https://resolver.caltech.edu/CaltechETD:etd-09092005-130635 Titsworth, Robert C. (1962) Correlation properties of cyclic sequences. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/XE6F-BM96. https://resolver.caltech.edu/CaltechETD:etd-09092005-130635 <https://resolver.caltech.edu/CaltechETD:etd-09092005-130635> https://thesis.library.caltech.edu/3399/ |
collection |
NDLTD |
format |
Others
|
sources |
NDLTD |
description |
<p>In the unconstrained channel with additive Gaussian noise, where the optimum detector is based on correlation or matched filters, the quality of a code can be expressed as a function of the correlation values between code words. For a cyclic-sequence code, optimality reduces to a criterion to be met by the autocorrelation function of the sequence. Methods are presented here for determining cyclic sequences with given correlation properties.</p>
<p>When the amount of equipment in the receiver is limited, matched filtering is no longer the optimal detection scheme. A better system, as is shown here, is one which, by the use of a Boolean function, combines several "component" sequences to generate the transmitted signal; the receiver consists of filters matched to each component. The logic, the number of components, the requirements of the component sequences to optimize the system, and a general method for treating Boolean logics are given in this work.</p> |
author |
Titsworth, Robert C. |
spellingShingle |
Titsworth, Robert C. Correlation properties of cyclic sequences |
author_facet |
Titsworth, Robert C. |
author_sort |
Titsworth, Robert C. |
title |
Correlation properties of cyclic sequences |
title_short |
Correlation properties of cyclic sequences |
title_full |
Correlation properties of cyclic sequences |
title_fullStr |
Correlation properties of cyclic sequences |
title_full_unstemmed |
Correlation properties of cyclic sequences |
title_sort |
correlation properties of cyclic sequences |
publishDate |
1962 |
url |
https://thesis.library.caltech.edu/3399/1/Titsworth_RC_1962.pdf Titsworth, Robert C. (1962) Correlation properties of cyclic sequences. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/XE6F-BM96. https://resolver.caltech.edu/CaltechETD:etd-09092005-130635 <https://resolver.caltech.edu/CaltechETD:etd-09092005-130635> |
work_keys_str_mv |
AT titsworthrobertc correlationpropertiesofcyclicsequences |
_version_ |
1719304851933888512 |