摘要: A general method is proposed to factor a discrete W transform (DWT) into lifting steps and additions. Then, based on the relationships among various types of sinusoidal transforms, other transforms such as Fourier (DFT) cosine (DCT) are factored After approximating matrices, we get new integer IntDWT, IntDFT IntDCT which floating-point multiplication free. Transforms map also proposed. Fast algorithms given for their computational complexities analyzed. Based polynomial an index mapping, multi-dimensional presented with especially low complexity.