The effect of Gaussian approximations and bit-to-bit error dependence on packet throughput calculations in DS/SSMA radio systems

The method described allows one to analyze the throughput performance of a DS/SSMA packet network in which all packets have signature sequences that are completely random from bit-to-bit. The author models the network as an infinite-user slotted ALOHA system where unsuccessful transmissions are caused entirely by multiple access interference, and gives a procedure for calculating arbitrarily tight upper and lower throughput bounds. For simplification, he works primarily with the lower throughput bound and quantify the performance enhancement gained by incorporating block error correction capability into the packets. Although throughput is increased by using error control, the required redundancy shortens the number of data bits devoted to the message in a fixed-length packet; he takes this into account by calculating a quantity called the `effective throughput´