An N-point FFT processes N complex signals to compute N output complex signals using decimation-in-time (DIT) or decimation-in-frequency (DIF) approach. The FFT makes use of n = log2N stages of computations where each stage computes N complex signals; N is assumed to be power-of-two. This paper considers implementation of a real signal of length N. Since the degrees of freedom of the input data is N, each stage of the FFT should not need to compute more than N signal values, where a signal value can corresponds to a purely real or purely imaginary value. Any more than N samples computed at any FFT stage is inherently redundant. This paper, for the first time, presents novel DIT and DIF structures for computing real FFT, referred as RFFT, that are canonic with respect to the number signal values computed at each FFT stage. In the proposed structure, in an N-point RFFT, exactly N signal values are computed at the output of each FFT stage and at the output. No prior canonic DIT RFFT structure was presented before. This paper, for the first time, presents a formal approach to compute RFFT using DIT in a canonic manner. While canonic FFT structures based on decimation-in-frequency were presented before, these structures were derived in an adhoc way. This paper presents a formal method to derive canonic DIF RFFT structures.