The implementation of an efficient Zigzag scan

The continuous growth of multimedia data capacity and the large capacity of communication lines had always become the obstacle in communication of multimedia data. to overcome this,data compression process in a shorter time is required. one part of jpeg algorithm that is able to determine compression ratio and compression process speed is zigzag coding or zigzag scan algorithm. this research is focused on developing the zigzag scan algorithm with mapping method. zigzag scan with mapping method is a sorting process of dct-quantized data result according to the position sequence determined in a zigzag. implementation of the zigzag scan mapping method into fpga using rom that serves as zigzag address generator and ram that serves to write (put) and read (issued) data according zigzag address generated by rom. the efficiency of zigzag scan with mapping method has been successfully developed. it is able to accelerate the sorting process of dct-quantized coefficients period because input data can be immediately located in sequence position which has been determined without any value comparison and repetition process. zigzag scan with mapping method process time is 250 mhz or approximately 4ns per byte data (12 ns per pixel) with the delay time (latency) by 64 clock. it means that the generated ic zigzag scan prototype can be operated in real-time jpeg/mpeg compression with a maximum of 3 mega pixel per frame for video with 25 fps speed. the generated ic zigzag scan component (ip core) needs 10 slices of flip-flop (30 times less than arafa method and 2 times less than ketul method) and luts as many as 39 slices (20 times less than arafa method and 2 times less that ketul method).