In this paper

the relationships between IFS fractal-based source coding techniques and traditional approaches are studied systematically for the first time. Connections between arithmetic coding

LPC and IFS are presented through theoretical analysis. Experimental comparison of IFS compression and transform coding

which tests their difference

gives evidence to the suitability of each to act as a generic signal compresssion approach. The superiority that is unique to fractal based-algorithms is reported. Some important problems for the further improvement to IFS signal compression are also analyzed.