Frame Synchronization Techniques

IEEE Transactions on Communications

Volumn 28, Issue 8, 1980, Pages 1204-1213

  Scholtz, Robert A ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FRAME SYNCHRONIZATION;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0019045669     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1980.1094813     Document Type: Article

References (44)

1. R. H. Barker, “Group synchronizing of binary digital systems,” in Communication Theory, W. Jackson, Ed. New York: Academic-Butterworth, 1953.
2. J. L. Massey “Optimum frame synchronization,” IEEE Trans. Commun., vol. COM-20, pp. 115–119, Apr. 1972.
3. H. Taub and D. L. Schilling, Principles of Communication Systems. New York: McGraw-Hill, 1971.
4. J. J. Stiffler, Theory of Synchronous Communications. Englewood Cliffs, NJ: Prentice-Hall, 1971.
5. P. T. Nielsen “Some optimum and suboptimum frame synchronizers for binary data in Gaussian noise,” IEEE Trans. Commun., vol. COM-21, pp. 770–772, June 1973.
6. S. W. Golomb and L. D. Baumert “Backtrack programming,” J. Ass. Comput. Mach., vol. 12, pp. 516–524, Oct. 1965.
7. D. E. Knuth, The Art of Computer Progamming-Volume 3: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
8. M. W. Willard, “Optimum code patterns for PCM synchronization,” in Proc. 1962 Nat. Telemetering Conf., Washington, DC, May 1962, paper 5-5.
9. J. L. Maury and F.J. Styles, “Development of optimum frame synchronization codes for Goddard Space Flight Center PCM Telemetry Standards,” in Proc. 1965 Nat. Telemetering Conf., Los Angeles, CA, June 1964, paper 3-1.
10. F. Neuman and L. Hofman, “New pulse sequences with desirable correlation properties,” in Conf. Rec., 1971 Nat. Telemetering Conf., Washington, DC, 1971, pp. 277–282.
11. R. Turyn, “Sequences with small correlation,” in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1968, pp. 195–228.
12. A. M. Boehmer “Binary pulse compression codes,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 156–167, Apr. 1967.
13. B. K. Levitt “Long frame sync words for binary PSK telemetry,” IEEE Trans. Commun., vol. COM-23, pp. 1365–1367, Nov. 1975.
14. R. A. Scholtz and S. W. Golomb “Generalized Barker sequences,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 533–537, Oct. 1965.
15. R. A. Scholtz, “The search for digital radar-ranging signals,” in Proc. 4th Hawaii Int. Conf. System Sciences, Jan. 1971, pp. 377–379.
16. R. J. Turyn “Four-phase Barker codes,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 366–371, May 1974.
17. G. R. Welti “Quaternary codes for pulsed radar,” IRE Trans. Inform. Theory, vol. IT-6, pp. 400–405, June 1960.
18. R. A. Scholtz and L. R. Welch “Group characters: Sequences with good correlation properties,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 537–545, Sept. 1978.
19. R. M. Lerner, “Signals having good correlation functions,” in IEEE WESCON Conf. Rec., 1961, paper 9/3.
20. R. L. Frank “Polyphase codes with good non-periodic correlation properties,” IEEE Trans. Inform. Theory, vol. IT-9, pp. 43–45, Jan. 1963.
21. U. Somaini and M. H. Ackroyd, “Uniform complex codes with low autocorrelation sidelobes,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 689–691, Sept. 1974.
22. P. T. Nielsen “On the expected duration of a search for a fixed pattern in random data,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 702–704, Sept. 1973.
23. S. W. Golomb, L. R.Welch, and M. Delbruck, “Construction and properties of comma-free codes,” Biol. Medd. Dan. Vid. Selsk., vol. 23, no. 9, 1958.
24. S. W. Golomb, B. Gordon, and L. R. Welch “Comma-free codes,” Can. J. Math., vol. 10, pp. 202–209, 1958.
25. S. W. Golomb and B. Gordon “Codes with bounded synchronization delay,” Inform. Contr., vol. 8, pp. 355–372, Aug. 1965.
26. W. L. Eastman and S. Even “On synchronizable and PSK-synchronizable block codes,” IEEE Trans. Inform. Theory, vol. IT-10, pp. 351–356, Oct. 1964.
27. W. L. Eastman “On the construction of comma-free codes,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 263–266, Apr. 1965.
28. R. A. Scholtz “Maximal and variable wordlength comma-free codes,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 300–306, Mar. 1969.
29. R. A. Scholtz and L. R. Welch “The mechanization of codes with bounded synchronization delays,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 438–446, July 1970.
30. R. A. Scholtz, “Automated code word synchronization—The noiseless case,” in Proc. Int. Conf. Communications, San Francisco. CA, June 1970, pp. 18.8–18.14.
31. E. N. Gilbert, “Synchronization of binary messages,” IRETrans. Inform. Theory, pp. 470–477, Sept. 1960.
32. S. W. Golomb, Shift-Register Sequences. San Francisco, CA: Holden-Day, 1967.
33. W. B. Kendall and I. S. Reed “Path invariant comma-free codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 350–355, Oct. 1962.
34. L. J. Guibas and A. M. Odlyzko “Maximal prefix-synchronized codes,” SIAM J. Appl. Math., vol. 35, pp. 401–418, Sept. 1978.
35. A. Artom, “Choice of prefix in self-synchronizing codes,” IEEE Trans. Commun., pp. 253–254, Apr. 1972.
36. R. A. Scholtz “Codes with synchronization capability,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 135–142, Apr. 1966.
37. W. W. Peterson and E. J. Weldon, Error Correcting Codes (2nd Edition). Cambridge, MA: MIT Press, 1972.
38. R. Gallagher, “Sequential decoding for binary channels with noise and synchronization errors,” Mass. Inst. Tech., Cambridge, MA, MIT-RLE Rep. AD266-879, 1961.
39. G. D. Forney, Jr. “The Viterbi algorithm,” Proc. IEEE. vol. 61, pp. 268–278, Mar. 1973.
40. F. F. Sellers, Jr., “Bit loss and gain correction code,” IRE Trans. Inform. Theory, pp. 35–38, Jan. 1962.
41. J. D. Ullman “Near optimal, single-synchronization-error correcting codes,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 418–424, Oct. 1966.
42. J. D. Ullman “On the capabilities of codes to correct synchronization errors,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 95–105, June 1967.
43. V. I. Levenshtein “Binary codes for the correction of deletions, insertions, and changes of symbols,” Dokl. Acad. Navk. SSRR., vol. 163, pp. 845–848, Aug. 1965.
44. L. Calabi and W. E. Hartnett “A family of codes for the correction of substitution and synchronization errors,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 102–106, Jan. 1969.