In this paper, we develop iterative algorithms for reconstructing a minimum phase sequence from pthhea se or magnitude of its Fourier transform. These iterative solutions involve repeatedly imposing a causality constraint in the time domain and incorporating the known phase or magnitude function in the frequency domain. This approach is the basis of a new means of computing the Hilbert transform of the log-magnitude or phase of the Fourier transform of a minimum phase sequence which does not require phase unwrapping. Finally, we discuss the potential use of this iterative computation in determining samples of the unwrapped phase of a mixed phase sequence.