Study On Data Compression For Fault Recorder

This paper is mainly to discuss the compression algorithm for electric power system fault recording data, which is essential to power system fault condition analyzing. But the data transmission to the control center is sometime quite difficulty due to the large chunk size of the recorded data as well as the comparatively narrow bandwidth of the communication channels. So it is often desired to squeeze the data before it is sent. Unfortunately, most popular algorithms are not ideal for the type of data. Thus a new approach called differential and static Huffman joint encoding method is presented in the paper to meet both the computing speed and the compression rate requirement of the resources limited application. The algorithm first removes the data correlation by replacing the sampling data with their differential values then reduces the data redundancy by compressing the data with static Huffman encoding. The result shows that the new algorithm does compression faster and easier than the dynamic Huffman encoding method, while both methods gaining about the same efficiency. Examples and C programming codes of the new algorithm are given in the paper too. Briefly discussed in the paper includes also the two-dimensional compression algorithm such as DCT for the fault recording data.Although the algorithm derived in the paper is originally designated to the fault recording data, it certainly can also be used to compress those data that has the same characteristics, such as the data of the periodic signal or the images with only sixteen-color index.