A derivation of the complex fast Kalman algorithm

A derivation of a complex-domain recursive linear prediction algorithm with a reduced number of computations is presented. It is denoted the complex fast Kalman algorithm by virtue of its similarity to the real domain algorithm of that name. It is seen to be very similar to real domain fast Kalman, when complex conjugation is considered in formulating the error measure.