Acquisition Sequences in PPM Communications

IEEE Transactions on Information Theory

Volumn 33, Issue 5, 1987, Pages 738-744

  Gagliardi, R ^a   Robbins, J ^b   Taylor, H ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTICAL COMMUNICATION; PULSE TIME MODULATION; SONAR;

ACQUISITION SEQUENCES IN PPM COMMUNICATIONS; COSTAS ARRAYS; FRAME SYNCHRONIZATION; PULSE-POSITION MODULATION (PPM); SONAR ARRAYS;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0023420305     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1987.1057336     Document Type: Article

References (19)

1. R. Gagliardi and S. Karp, Optical Communication. New York: Wiley, 1975, ch. 8.
2. J. Schwartz, “Modulation techniques for multiple access to a satellite repeater,” in Satellite Communications. H. Van Trees, Ed. New York: IEEE Press, 1979, pp. 308–322.
3. P. Pauter, Modulation, Noise, and Spectral Analysis. New York: McGraw-Hill, 1964, ch. 12.
4. R. Gagliardi, “Time synchronization in optical PPM systems,” in Proc. Globecom., San Diego, CA, 1983.
5. J. Stiffler, Theory of Synchronous Communications. Englewood Cliffs, NJ: Prentice-Hall, 1971, ch. 7.
6. R.A. Scholtz and S.W. Golomb, “Generalized Barker sequences,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 660–673, Oct. 1975.
7. C. Georghiades, “Joint Baud and frame synchronization in direct detection optical communications,” IEEE Trans. Commun., vol. COM-33, pp. 357–361, Apr. 1985.
8. S.W. Golomb and L.D. Baumert, “Backtrack programming,” J. Ass. Comput. Mach., vol. 12, no. 4, pp. 516–524, Oct. 1965.
9. J. Costas, “Medium constraints on sonar design,” in EASCON Convention Rec., 1975, pp. 68A-68L.
10. S.W. Golomb and H. Taylor, “Two-dimensional synchronization patterns for minimum ambiguity,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 600–604, July 1982.
11. S.W. Golomb, “Constructions and properties of Costas arrays,” in Proc. IEEE, vol. 72, no. 9, pp. 1143–1163, Sept. 1984.
12. G.S. Bloom and S.W. Golomb, “Numbered complete graphs, unusual rulers, and assorted applications,” in SpringerVerlag Lecture Notes in Mathematics 642; Theory and Applications of Graphs, Proceedings, Michigan, May 11–15, 1976, Y. Alavi and D.R. Lick, Eds., Library of Congress QA 3 L28 v. 642.
13. J.P. Robinson, “Optimum Golomb rulers,” IEEE Trans. Comput., vol. C-28, no. 18, Dec. 1979.
14. M.B. Sverdlik and A.N. Meleshkevich, “Synthesis of optimum pulsed sequences having the property of ‘no more than one coincidence,'” Radiotehn. Elektron., vol. 19, pp. 721-729, 1974 (in Russian); translated as Radio Eng. Electron. Phys., vol. 19, pp. 46–54, 1974.
15. J.P. Robinson and A.J. Bernstein, “A class of binary recurrent codes with limited error propagation,” IEEE Trans. Inform. Theory, vol. IT-13, Jan. 1967.
16. B. Lindstrom, “An inequality for B2-sequences,” J. Combin. Theory, vol. 6, pp. 211–212, 1969; see also Math. Rev. vol. 38, no. 4436.
17. P. Erdos and P. Turan, “On a problem of Sidon in additive number theory and some related problems,” J. London Math. Soc., vol. 16, pp. 212–215, 1941.
18. J. Singer, “A theorem in finite projective geometry and some applications to number theory,” Trans. Amer. Math. Soc., vol. 43, pp. 377–385, 1938.
19. P. Erdos, J. London Math. Soc., vol. 19, p. 208, 1944.