COMPUTATIONAL EXPERIENCE WITH A DUAL BACKTRACK ALGORITHM FOR IDENTIFYING FREQUENCIES LIKELY TO CREATE INTERMODULATION PROBLEMS.

Susumu Morito, Harvey M. Salkin, Kamlesh Mathur

    Research output: Contribution to journalArticle

    5 Citations (Scopus)

    Abstract

    This paper describes the results of a computational study using a particular enumeration procedure, called a backtrack algorithm, to find the lowest order of radio-frequency intermodulation. The average lowest order and its standard deviation, the average computer time and its standard deviation, along with other relevant statistics are obtained for a series of randomly generated problems with sets of five to 75 threat or source frequencies. Other parameters, such as the guard band, the maximum number of concurrent threats, and the size of the frequency band on the lowest order of intermodulation are varied during the comptutations. Statistics for these computs runs, along with those relating to terminating the algorithm when the lowest ″acceptable″ order is reached, are presented in some detail. Brief conclusions follow a listing of the results.

    Original languageEnglish
    Pages (from-to)32-36
    Number of pages5
    JournalIEEE Transactions on Electromagnetic Compatibility
    VolumeEMC-23
    Issue number1
    Publication statusPublished - 1981 Feb

      Fingerprint

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this