This paper illustrates a novel method of speech compression and transmission. This method saves the transmission bandwidth required for the speech signal by a considerable amount. This scheme exploits...
As per this method, the low pass signal (speech) at the transmitter is divided into set of packets, each containing, say N number of samples. Of the N samples per packet, only certain lesser number of samples, say alpha N alone are transmitted. Here ï¡ is less than unity, so compression is achieved. The N samples per packet are subjected to a N-Point DFT. Since low pass signals alone are considered here, the number of significant values in the set of DFT samples is very limited. Transmitting these significant samples alone would suffice for reliable transmission. The number of samples, which are transmitted, is determined by the parameter alpha.
The parameter alpha is almost independent of the source of the speech signal. In other methods of speech compression, the specific characteristics of the source such as pitch are important for the algorithm to work.
An exact reverse process at the receiver reconstructs the samples. At the receiver, the N-point IDFT of the received signal is performed after necessary zero padding. Zero padding is necessary because at the transmitter of the N samples only alpha samples are transmitted, but at the receiver N samples are again needed to honestly reconstruct the signal.
Hence this method is efficient as only a portion of the total number of samples is transmitted thereby saving the bandwidth. Since the frequency samples are transmitted the phase information has also to be transmitted. Here again by exploiting the property of signals and their spectra that the PHASE INFORMATION CAN BE EMBEDDED WITHIN THE MAGNITUDE SPECTRUM by using simple mathematics without any heavy computations or by increasing the bandwidth.
Also the simulation result of this method shows that smaller the size of the packet the more faithful is the reproduction of received signal that is again an advantage as the computation time is reduced. The reduction in the computation time is due to the fact that the transmitter has to wait until N samples are obtained before starting the transmission. If N is small, the transmitter has to wait for a less duration of time and a smaller value of N achieves a better reconstruction at the receiver.
Thus this scheme provides a more efficient method of speech compression and this scheme is also very easy to implement with the help of available high-speed processors.