Dynamic Redundancy Bit Allocation And Packet Size To Increase Throughput In Noisy Real Time Video Wireless Transmission

Abstract

The typical real-time wireless video-audio digital transmission process consists of capturing the signal, digitizing it, compressing it, adding cryptography to it (crypto it), adding redundancy to enable the receiver to detect and correct a number of bit errors, packetizing it, and then transmitting it. Transmitting the signal via the Transmission Control Protocol (TCP-IP) provides a fixed number of redundancy bits, and a very rigid transmission process that could result in a large number of automatic repeat requests and denial of services. In this research, we develop a dynamic transmission algorithm, whereby the degree of redundancy is a function of the noise and the probability $p$ for a bit to be corrupted. We also provide a variable number of protection depending on the importance of certain bits. In addition, we provide a variable packet size depending on the noise, in order to decrease the probability of automatic repeat request. The preferred protocol to be used with our algorithm is the User Datagram Protocol (UDP) fortified with our dynamic redundancy check algorithm, a packet sequence number, number of redundancy bits, signal group size as part of the packet header. Our algorithm has two parts. The first one is noise detection and noise quantization. The second part is redundancy bit adjustment and packet size adjustment to maximize the transmission throughput. In this paper, we present the analytics of keeping the correctable groups of bits in each transmission until the whole packet is received.