A simple stack algorithm for a code division multiple access communication system

A frequency hopping multiple access communication system with an infinite population of potential users is considered. By making use of the idea of the t-orthogonal frequency hopping pattern of order ¿, the channel is split into a number of mutually interference free subchannels; then the idea of frequency hopping pattern sensing (FHPS) is adopted to provide ternary feedback information to the users. A packet is made to consist of a number of minipackets, which are capable of revealing the frequency hopping pattern that was used in the transmission of the whole packet. A simple algorithm, that belongs to the class of the STACK algorithms, is adopted for conflict resolutions. The performance of the system in terms of throughput and average packet delay is investigated and both analytical and simulation results are provided.

[1]  L. Kantorovich,et al.  Approximate methods of higher analysis , 1960 .

[2]  R. Mersereau,et al.  Multiple Access Frequency Hopping Patterns with Low Ambiguity , 1981, IEEE Transactions on Aerospace and Electronic Systems.

[3]  Kai Lai Chung,et al.  A Course in Probability Theory , 1949 .