• DocumentCode
    1197964
  • Title

    Good multi-T phase codes under bandwidth and complexity constraints

  • Author

    Holubowicz, Witold ; Bobrowski, Ryszard

  • Author_Institution
    Franco-Polish Sch. of New Inf. & Commun. Technol., Poznan, Poland
  • Volume
    40
  • Issue
    5
  • fYear
    1994
  • fDate
    9/1/1994 12:00:00 AM
  • Firstpage
    1699
  • Lastpage
    1702
  • Abstract
    Multi-T phase codes are an equivalent realization of multi-h phase codes within the class of continuous phase modulations (CPM). The authors present, in the form of code tables, the results of a systematic search for binary and quaternary multi-T phase codes which maximize the free Euclidean distance under given bandwidth and complexity constraints
  • Keywords
    binary sequences; computational complexity; phase modulation; search problems; bandwidth constraints; binary multi-T phase codes; code tables; complexity constraints; continuous phase modulations; equivalent realization; multi-h phase codes; quaternary multi-T phase codes; search; Bandwidth; Communications technology; Constraint theory; Continuous phase modulation; Euclidean distance; Frequency; Hydrogen; Phase modulation; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.333897
  • Filename
    333897