Simple nonlinear lters are often used to enforce \hard" syntactic constraints while remaining close to the observation data; e.g., in the binary case it is common practice to employ iterations of a suitable median, or a one-pass recursive median, openclose, or closopen lter to impose a minimum symbol run-length constraint while remaining \faithful" to the observation. Unfortunately , these lters are-in general-suboptimal. Motivated by this observation, we pose the following optimization: Given… CONTINUE READING