Scribd Logo
Upload

Welcome to Scribd!

  • 1993B

    Uploaded by

    Mhmd Neamat
    7 views5 pages
    tyutyuytuy

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    tyutyuytuy

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    7 views5 pages

    1993B

    Uploaded by

    Mhmd Neamat
    tyutyuytuy

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 5
    Optimal Selection of Reed-Solomon Code Rate and the Number of Frequency Slots in Asynchi onous FHSS-MA Networks Kyungwhoon Cheun and Wayne E. Stark Absiract— In this paper we. consider the performance of Reed-Solomon codes in asynchronous FHSS=MA. network, When 1 denates the number of frequency slots available to the network and r denotes the rate ofthe Reed-Solomon code, we bean optimal (gr) pairs that achieve given. performance fxiteria ‘with miniouen bandwidth expansion (y/+) for given umber of active users. We show that the optimal cide rate apily converges to constant valve and the optimus number tot ierease approximately linearly a the number of active tsers increase. This suggests that one should fx the code rate tnd increase the number of slots to accommedate the increasing Inumber of wers lathe hetwork wader a. given. performance Criteria with minimum bandwidth expansion, 1. Inrropuction 'N [1], Kim and Stark considered the performance of Reed-Solomon (RS) codes in frequency-hop_ spread: spectrum maltiple-access (FHSS-MA) networks. The per formance measures considered in [1] were the normalized throughput and achievable regions for the RS code rate that guarantee a given performance criteria. The normalized throughput w defined as rH’ P./q (r denotes the rate ofthe RS. code, K denotes the numberof ative users inthe network, Pe denotes the probability that a RS codeword will be transmitted through the network ertor free and @ denotes the number of frequency slots available) takes into account the bandwidth expansion eaused by the code rater which is less than unity and the number of frequency slots q which is greater than ‘unity. But the analysis of the achievable region does not take this fact into account. That is, for a given K, q and m (the length of the RS code), the maximum code rater was found that guarantees the RS codeword ercot probability P, 10 be less than a prespecified value of P. In this paper, instead of fixing 9, we find optimal (q,") pals that not only achieves P, dni is needed 10 ensure 0

    You might also like