Performance Analysis of Bit Loading Algorithms for fault tolerant Submarine Communication

Abstract

In this paper, performance metrics of rate adaptive and margin adaptive bit loading algorithms is simulated and analyzed to improve the data rate in undersea communication channel. In fault tolerant undersea communication, achieving higher data rate is a challenge. Bit loading algorithms have proven efficient with limited power budget. An optimal bit loading algorithm with low complexity and fast convergence for rate adaptive and margin adaptive problems with bit error rate (BER) constraints will increase the data rate and reliability of the system significantly. The simulation has been carried for submarine audio channel with a bandwidth of 0-20kHz considering ambient noise and thorps attenuation model for 16 subcarriers. Three different approaches such as Chow, Campello and Ant Colony Optimization are simulated for margin adaptive and rate adaptive criteria. Simulation results show that, for margin adaptive conditions Campello and ACO algorithms reduce energy by a factor of 71.50% and 13.05% with respect to Chow’s algorithm with an input of 90 bits. It was also observed that for rate adaptive conditions, Chow and ACO algorithms gave marginally increased bit rate compared to Campello algorithm with energy fixed at 8.35J. Campello and ACO algorithm execution time were reduced by a factor of 67% and 87.10% respectively as compared to Chow’s algorithm.