Networking

A Fast Bit Removal Greedy Algorithm for Multiuser DMT-Based Systems

Download Now Free registration required

Executive Summary

Adaptive bit allocation for DMT-based systems is critical for preventing performance degradation due to poor allocation of bits given challenging channel and interference conditions. In this paper, the authors extend the single-user bit removal greedy algorithm to a multi-user environment. It has been proved that the proposed algorithm converges faster than the traditional multiuser greedy algorithm and performs better than the waterfilling algorithm. The use of optical fiber is ideal for high-speed transmission and long-distance links, but using the same technology in short-distance links (hundreds of meters) is an unnecessary luxury considering material cost, equipment and manpower.

  • Format: PDF
  • Size: 315.1 KB