The process described above is, in principle, an inversion of the type of {TAIL ~ process} used for {HEAD ~ Linear Predictive Coding} and is a general example of “filter inversion” for optimal watermark planning 
The process described above is , in principle , an inversion of the type of { TAIL ~ process } used for { HEAD ~ Linear Predictive Coding } and is a general example of “ filter inversion ” for optimal watermark planning
OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH TAIL TAIL TAIL TAIL TAIL OTH OTH HEAD HEAD HEAD HEAD HEAD HEAD HEAD OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH