Iterative method for obtaining good aperiodic binary sequences

  • P. V. Indiresan
  • G. K. Uttaradhi
Contributed Papers


A functional minimization approach over a discrete and nonconvex set of points inN-space has been adopted to obtaingood binary sequences. In order to achieve this goal, an iterative procedure based upon the well-known enumerative and combinational structures of the problem has been developed. A functional of the form\(\sum\nolimits_{K = 1}^{N - 1} {{{{K \mathord{\left/ {\vphantom {K {[C(K)]}}} \right. \kern-\nulldelimiterspace} {[C(K)]}}} \mathord{\left/ {\vphantom {{{K \mathord{\left/ {\vphantom {K {[C(K)]}}} \right. \kern-\nulldelimiterspace} {[C(K)]}}} {^2 }}} \right. \kern-\nulldelimiterspace} {^2 }}} \) is considered, whereK is the time shift in terms of the number of binary elements andC(K) the corresponding autocorrelation function; however, the method is quite general and could be used for any functional suitable for any given application. By this method, it has been found possible to minimize the functional by orders of magnitude in aboutN/2 steps, with maximum sidelobes around\(\surd N\), whereN is the code length.


Autocorrelation Iterative Method Autocorrelation Function Iterative Procedure Time Shift 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barker, R. H.,Group Synchronizing of Binary Digital Systems, in Communication Theory, Edited by W. Jackson, Academic Press, London, 1953, pp. 273–287.Google Scholar
  2. 2.
    Storer, J., andTuryn, R.,On Binary Sequences, Proceedings of the American Mathematical Society, Vol. 12, No. 3, 1961.Google Scholar
  3. 3.
    Poliak, Iu. V., andMoshetov, R. V.,Scientific Transactions of the Radio-Engineering Institute of the USSR Academy of Sciences, Vol. 1, No. 1, 1959.Google Scholar
  4. 4.
    Luenburger, D. C.,On Barker Codes of Even Length, IEEE Proceedings, Vol. 51, No. 1, 1963.Google Scholar
  5. 5.
    Turyn, R.,On Barker Codes of Even Length, IEEE Proceedings, Vol. 51, No. 9, 1963.Google Scholar
  6. 6.
    Glushkov, V. M.,Introduction to Cybernetics, Academic Press, New York, 1966.Google Scholar
  7. 7.
    Hadley, G.,Nonlinear and Dynamic Programming, Addison-Wesley Publishing Co., Reading, Mass., 1964.Google Scholar
  8. 8.
    MacLane, S., andBirkhoff, G.,Algebra, Macmillan, New York, 1967.Google Scholar
  9. 9.
    Schroeder, M. R.,Synthesis of Low-Peak-Factor Signals and Binary Sequences with Low Autocorrelation, IEEE Transactions on Information Theory, Vol. IT-16, No. 1, 1970.Google Scholar
  10. 10.
    Ozernoi, V. M., andRyabov, L. P.,Heuristic Method for the Optimization of a Schedule of Operations, Automation and Remote Control, Vol. 28, No. 12, 1967.Google Scholar
  11. 11.
    Belkina, M. V., Gromova, A. P., Kyumnop, E. P., andOskolkov, I. C.,Optimization of a Sequence of Operations, Automation and Remote Control, Vol. 26, No. 11, 1966.Google Scholar
  12. 12.
    Robinson, J. A.,A Review of Automatic Theorem Proving, Paper presented at the Symposium in Applied Mathematics, New York, 1966.Google Scholar
  13. 13.
    Churchhouse, R. G., andHertz, J. C., Editors,Computer in Mathematical Research, North Holland Publishing Company, Amsterdam, 1968.Google Scholar
  14. 14.
    Savage, M. J.,Junction Optimization Technique, Computer Journal, Vol. 12, No. 3, 1969.Google Scholar

Copyright information

© Plenum Publishing Corporation 1971

Authors and Affiliations

  • P. V. Indiresan
    • 1
  • G. K. Uttaradhi
    • 1
  1. 1.Department of Electrical EngineeringIndian Institute of TechnologyDelhiIndia

Personalised recommendations