Abstract
A study is made of collision resolution algorithms for code-division multiple-access systems. Both random and fixed code assignment are considered. Different codes are orthogonal. Two types of multiuser interference are considered. Either the well-known 0.487 algorithm or a windowed version of Capetanakis' collision resolution algorithm is used in resolving collisions. Throughput and delay are derived for each of the protocols considered. Computer simulations are provided to verify the validity of the analysis.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
