Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Forward collision resolution-a technique for random multiple-access to the adder channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bar-David, I. ; Dept. of Electr. Eng., Israel Inst. of Technol., Haifa, Israel ; Plotnik, E. ; Rom, R.

Consider M-Choose-T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method for constructing codes that achieve error-free M-Choose-T communication over the noiseless adder channel (AC), at a nominal rate of 1/T bits per channel symbol per active user, is described and an efficient decoding procedure is presented. The use of such codes is referred to as forward collision resolution (FCR), as it enables correct decoding of collided messages without retransmissions. For any given T a code is available that yields a stable throughput arbitrarily close to 1 message/slot. Furthermore, if the occurrence of collisions is made known to the transmitters, such a throughput can be maintained for arbitrary T,T⩽M as well. If such feedback is not available, and T is random, the probability of an unresolved collision is significantly smaller than the probability of a collision in an uncoded system, at comparable message-arrival and information rates

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 5 )