based motion estimation is almost equal to that given in the cellular search algorithm but much complexity is reduced at the time of operation generally speaking a complete procedure of video compression should comprise the following steps 1 inputted data is moved to a ram or a buffer 2 dc compositions are removed 3 the best motion estimation is found to compute computing the motion compensation and prediction errors 4 in consideration of current bandwidth and storage space an optimal encoding codec is found in this invention the best motion estimation is emphasized and consumes maximum runtime in the whole process of video compression generally in the environment of a pc working the number of mean search points in each block is direct proportional to the runtime so the performance of runtime may be compared depending on the number of mean search points in each block further the amount of runtime also has something to do with the contents of input video data as described above the input data comprises a film moving fast such as the film of football and a film moving slowly such as the film of claire when the ncs algorithm is used the runtime may be lowered to 45 through 54.