In this paper, we design and implement fast multiplierless approximations of the discrete cosine transform(DCT) with the lifting scheme, named the BinDCT, which avoids floating-point operations. This algorithm is derived from the plane rotation-based algorithm, which reduces 3 lifting steps to 2 lifting steps via the plane rotation. So the arithmetic operation cost is reduced greatly.