Line drawing algorithm is very important in the computer graphics. It is the most famous algorithm that Bresenham Algorithm uses to draw a straightness line in a smooth fashion. The advantage of classic Bresenham Algorithm is that the operations are all integer numeric without division and decimal fraction. Meanwhile, the disadvantage of the algorithm is that it can just generate one pixel in a computation time and its low in efficiency. In this paper, an accelerated algorithm was proposed, which give full attention to the initiative relation between generation model of line and its linear slope, and it does generate more than one pixel of a line through row of raster display device. The core principle of the improved algorithm is utilizing the coordinate position of both ends of line and the symmetry characteristic for segments. After discussing theory and structure of the improved algorithm, the algorithm implementation and simulation are given at last. And finally, the hardware acceleration in the use of circular subtraction technology based on shift register was briefly described.