Searching for optimal frame patterns in an integrated TDMA communication system using mean field annealing

In an integrated time-division multiple access (TDMA) communication system, voice and data are multiplexed in time to share a common transmission link in a frame format in which time is divided into slots. A certain number of time slots in a frame are allocated to voice and the rest are used to transmit data. Maximum data throughput can be achieved by searching for the optimal configuration(s) of relative positions of voice and data transmissions in a frame (frame pattern). When the problem size becomes large, the computational complexity in searching for the optimal patterns becomes intractable. In the paper, mean field annealing (MFA), which provides near-optimal solutions with reasonable complexity, is proposed to solve this problem. The determination of the related parameters are addressed. Comparison with the random search and simulated annealing algorithm is made in terms of solution optimality and computational complexity. Simulation results show that the MFA approach exhibits a good tradeoff between performance and computational complexity