The fractional Fourier transform (FRFT) has been used for many years, and it is useful in many applications. Most applications of the FRFT are based on the design of fractional filters (such as removal of chirp noise and the fractional Hilbert transform) or on fractional correlation (such as scaled space-variant pattern recognition). In this study we introduce several types of simplified fractional Fourier transform (SFRFT). Such transforms are all special cases of a linear canonical transform (an affine Fourier transform or an ABCD transform). They have the same capabilities as the original FRFT for design of fractional filters or for fractional correlation. But they are simpler than the original FRFT in terms of digital computation, optical implementation, implementation of gradient-index media, and implementation of radar systems. Our goal is to search for the simplest transform that has the same capabilities as the original FRFT. Thus we discuss not only the formulas and properties of the SFRFT's but also their implementation. Although these SFRFT's usually have no additivity properties, they are useful for the practical applications. They have great potential for replacing the original FRFT's in many applications.