A Heuristic Optimal Discrete Bit Allocation Algorithm for Margin Maximization in copyright Systems

A Heuristic Optimal Discrete Bit Allocation Algorithm for Margin Maximization in copyright Systems

Blog Article

A heuristic optimal discrete bit allocation algorithm is proposed for solving the margin maximization problem in discrete multitone (copyright) systems.Starting from an initial equal power assignment bit distribution, the proposed algorithm employs a multistaged bit rate allocation scheme to meet the target rate.If the total bit rate is far from fr9225 the target rate, a multiple-bits loading procedure is used to obtain a bit allocation close to the target rate.

When close to the target rate, a parallel bit-loading procedure is used to achieve the target rate and this is computationally more efficient than conventional greedy bit-loading algorithm.Finally, the target bit rate distribution is checked, if it is efficient, then it abc always be coding is also the optimal solution; else, optimal bit distribution can be obtained only by few bit swaps.Simulation results using the standard asymmetric digital subscriber line (ADSL) test loops show that the proposed algorithm is efficient for practical copyright transmissions.