This paper extends the expressive power of FP by introducing stream and recursive equations on stream for the description of parallel algorithms with cyclic data dependency and states. The decidability theorem of about whether the FP program has its systolic implementation is given. This research also shows that the systoliclizing method on graph can be easily used on FP description.