Achievable Throughput under BER Constraints via Transmission Scheduling and Multiuser Detection

@article{Nguyen2014AchievableTU,
  title={Achievable Throughput under BER Constraints via Transmission Scheduling and Multiuser Detection},
  author={G. D. Nguyen and S. Kompella and C. Kam},
  journal={IEEE Transactions on Wireless Communications},
  year={2014},
  volume={13},
  pages={124-131}
}
  • G. D. Nguyen, S. Kompella, C. Kam
  • Published 2014
  • Computer Science, Mathematics
  • IEEE Transactions on Wireless Communications
  • We evaluate the throughput that can be achieved under BER constraints by combined use of transmission scheduling and multiuser detection. A schedule is a rule that specifies which subset of users is allowed to simultaneously transmit in a time slot. These subsets of overlapping transmissions, which can vary in different time slots of the transmission frame, are decoded by receivers equipped with multiuser detection. The goal is to find the largest such subsets under the requirement that each… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES
    Transmission scheduling in capture-based wireless networks
    • 6
    • PDF
    Multiuser detection in single-path fading channels
    • 138
    Fundamentals of Resource Allocation in Wireless Networks - Theory and Algorithms (2. ed.)
    • 127
    • PDF
    Multiuser Detection
    • 4,582
    • Highly Influential
    • PDF
    ALOHA packet system with and without slots and capture
    • 1,325
    • PDF
    Network flows - theory, algorithms and applications
    • 6,126
    • PDF
    Elements of Information Theory
    • 38,856
    • PDF
    Packet switching in radio channels: part I
    • 483