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

    Intermodulation
    intermodulation
    standard deviation
    Statistics
    statistics
    enumeration
    stopping
    Frequency bands
    radio frequencies

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    COMPUTATIONAL EXPERIENCE WITH A DUAL BACKTRACK ALGORITHM FOR IDENTIFYING FREQUENCIES LIKELY TO CREATE INTERMODULATION PROBLEMS. / Morito, Susumu; Salkin, Harvey M.; Mathur, Kamlesh.

    In: IEEE Transactions on Electromagnetic Compatibility, Vol. EMC-23, No. 1, 02.1981, p. 32-36.

    Research output: Contribution to journalArticle

    @article{15f60ea2af6e431cb7d7706ca2267b08,
    title = "COMPUTATIONAL EXPERIENCE WITH A DUAL BACKTRACK ALGORITHM FOR IDENTIFYING FREQUENCIES LIKELY TO CREATE INTERMODULATION PROBLEMS.",
    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.",
    author = "Susumu Morito and Salkin, {Harvey M.} and Kamlesh Mathur",
    year = "1981",
    month = "2",
    language = "English",
    volume = "EMC-23",
    pages = "32--36",
    journal = "IEEE Transactions on Electromagnetic Compatibility",
    issn = "0018-9375",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "1",

    }

    TY - JOUR

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

    AU - Morito, Susumu

    AU - Salkin, Harvey M.

    AU - Mathur, Kamlesh

    PY - 1981/2

    Y1 - 1981/2

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0019532384&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0019532384&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:0019532384

    VL - EMC-23

    SP - 32

    EP - 36

    JO - IEEE Transactions on Electromagnetic Compatibility

    JF - IEEE Transactions on Electromagnetic Compatibility

    SN - 0018-9375

    IS - 1

    ER -