메뉴 건너뛰기




Volumn 25, Issue 8, 1977, Pages 748-755

The Spread Spectrum Concept

Author keywords

[No Author keywords available]

Indexed keywords

SPREAD SPECTRUM COMMUNICATIONS;

EID: 0017525734     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1977.1093907     Document Type: Article
Times cited : (109)

References (15)
  • 2
    • 84939035260 scopus 로고
    • Spread Spectrum Communications
    • AGARD Lecture series no. 58, National Technical Information Service AD-766-914
    • “Spread Spectrum Communications,” AGARD Lecture series no. 58, National Technical Information Service AD-766-914, July 1973.
    • (1973)
  • 5
    • 84936896674 scopus 로고
    • Optimum Binary Sequences for Spread Spectrum Multiplexing
    • Oct.
    • R. Gold, “Optimum Binary Sequences for Spread Spectrum Multiplexing,” IEEE Trans. on Information Theory, Oct. 1967, pp. 619–621.
    • (1967) IEEE Trans. on Information Theory , pp. 619-621
    • Gold, R.1
  • 6
    • 84937741493 scopus 로고
    • Maximal Recursive Sequences with 3-Valued Recursive Crosscorrelation Functions
    • January
    • R. Gold, “Maximal Recursive Sequences with 3-Valued Recursive Crosscorrelation Functions,” IEEE Trans. on Information Theory, January, 1968, pp. 154–156.
    • (1968) IEEE Trans. on Information Theory , pp. 154-156
    • Gold, R.1
  • 7
    • 0016060859 scopus 로고
    • Lower Bounds on the Maximum Cross Correlation Between Signals
    • May
    • L. R. Welch, “Lower Bounds on the Maximum Cross Correlation Between Signals,” IEEE Trans. on Information Theory, May, 1974.
    • (1974) IEEE Trans. on Information Theory
    • Welch, L.R.1
  • 8
    • 0015986204 scopus 로고
    • Families of Sequences with Optimal Hamming-Correlation Properties
    • Jan.
    • A. Lempel and H. Greenberger, “Families of Sequences with Optimal Hamming-Correlation Properties,” IEEE Trans. on Information Theory, Jan. 1974, pp. 90–94.
    • (1974) IEEE Trans. on Information Theory , pp. 90-94
    • Lempel, A.1    Greenberger, H.2
  • 9
    • 84939064014 scopus 로고    scopus 로고
    • Optimal Frequency Hopping Sequences for Multiple Access
    • volume of reference (3).
    • G. Solomon, “Optimal Frequency Hopping Sequences for Multiple Access,” in volume 1 of reference (3).
    • , vol.1
    • Solomon, G.1
  • 10
    • 0015142570 scopus 로고
    • A New Coding Technique for Asynchronous Multiple Access Communication
    • October
    • A. R. Cohen, J. A. Heller, and A. J. Viterbi, “A New Coding Technique for Asynchronous Multiple Access Communication,” IEEE Trans. on Communication Technology, October 1971, pp. 849–855.
    • (1971) IEEE Trans. on Communication Technology , pp. 849-855
    • Cohen, A.R.1    Heller, J.A.2    Viterbi, A.J.3
  • 11
    • 84966216677 scopus 로고
    • Continued Fractions and Linear Recurrences
    • January
    • W. H. Mills, “Continued Fractions and Linear Recurrences,” Mathematics of Computation, January, 1975, pp. 173–180.
    • (1975) Mathematics of Computation , pp. 173-180
    • Mills, W.H.1
  • 12
    • 84874411276 scopus 로고
    • An Analysis of the Pseudo-Randomness Properties of Subsequences of Long m-Sequences
    • July
    • J. H. Lindholm, “An Analysis of the Pseudo-Randomness Properties of Subsequences of Long m-Sequences,” IEEE Trans. on Information Theory, July 1968, pp. 569–576.
    • (1968) IEEE Trans. on Information Theory , pp. 569-576
    • Lindholm, J.H.1
  • 15
    • 84939040506 scopus 로고
    • Pseudo-Noise Code Acquisition Using Majority Logic Decoding
    • June
    • C. J. Kilgus, “Pseudo-Noise Code Acquisition Using Majority Logic Decoding,” Proc. of ICC, June 1973, pp. 23.16-23.17.
    • (1973) Proc. of ICC , pp. 23.16-23.17
    • Kilgus, C.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.