Efficient algorithms are described for computing the probability of detection for a binary integration when the probability of a threshold crossing changes from sample to sample. A binary integrator is exceeded (a hit occurs) in a sequence of N trials and declares a detection if the number of hits is at least as large as some number M, where O<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computation of binary integration detection probabilities


    Contributors:


    Publication date :

    1991-11-01


    Size :

    321599 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English