Performance analysis of a frame detection algorithm for burst mode communications
In burst mode communication, the beginning of a burst is often estimated by comparing the power in a sliding window to a threshold. The simplicity of the algorithm makes it very attractive. The probability density function of the detection variable for this simple algorithm is the subject of (H. H....
        Saved in:
      
    
          | Published in | 2004 IEEE Wireless Communications and Networking Conference Vol. 1; pp. 571 - 576 Vol.1 | 
|---|---|
| Main Authors | , | 
| Format | Conference Proceeding | 
| Language | English | 
| Published | 
        Piscataway NJ
          IEEE
    
        2004
     | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9780780383449 0780383443  | 
| ISSN | 1525-3511 | 
| DOI | 10.1109/WCNC.2004.1311609 | 
Cover
| Summary: | In burst mode communication, the beginning of a burst is often estimated by comparing the power in a sliding window to a threshold. The simplicity of the algorithm makes it very attractive. The probability density function of the detection variable for this simple algorithm is the subject of (H. H. Nguyen et al., April 2003) where it is shown to be approximately Gamma distributed. This paper provides further analysis of this low complexity edge/burst detection DSP algorithm. The analysis yields two equations that relate "the probability of false detection" and "the probability of missing a detection" to window size and the decision threshold. | 
|---|---|
| ISBN: | 9780780383449 0780383443  | 
| ISSN: | 1525-3511 | 
| DOI: | 10.1109/WCNC.2004.1311609 |