P. J. S. G. Ferreira and J. M. N. Vieira. Detection and correction of missing samples. In Proceedings of the 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Communication Systems Department, Swiss Federal Institute of Technology, Lausanne, Switzerland and with the Electrical Engineering and Computer Science Department, University of California, Berkeley, CA 94720 (e mail: Martin.Vetterli epfl.ch) Publisher Item Identifier S 1053 587X(00)10161 8. In [7], a similar problem is studied in the context of error correction. The authors reconstruct a passband signal of length given a noisy signal with errors in unknown locations. To determine the locations of the errors, they require the knowledge of at least values in the error spectrum. In other ....

P. J. S. G. Ferreira and J. M. N. Vieira, "Detection and correction of missing samples," in Proc. Workshop Sampling Theory Appl., Aveiro, Portugal, June 1997, pp. 169--174.

....j # ) e(n j # ) and proper choice of the j # lead to a set of linear equations Th = b for the coe#cients h k of the polynomial P . The zeros of the polynomial, and consequently the position and the number of errors, can be easily determined using the FFT algorithm. For details, see [14, 44]. It is time to consider an apparently distinct problem: fault tolerant computing. Consider a parallel computer, perhaps composed of many individual processing units, each having a certain probability of failure. It is of course desirable that a failure in one of the processing units does not ....

....theory (error control codes in the real field) has been noted before, but does not seem to be widely known in the signal processing community. Specific algorithms have been suggested to solve this problem; we refer to the method described in [43] which is able to correct a single error, and to [14, 27, 44], for the correction of multiple errors. 3.2 The role of frames The previous observations have several immediate consequences. Reference [41] o#ers one example: an iterative method to solve problem 2, based on a discrete discrete version of the Papoulis Chamzas nonlinear iteration [32] ....

P. J. S. G. Ferreira and J. M. N. Vieira. Detection and correction of missing samples. In Proceedings of the 1997.

...., j #= e#n , j #; and proper choice of the j leads to a set of linear equations Th = b for the coefficients h k of the polynomial P . The zeros of the polynomial, and consequently the position and the number of errors, can be easily determined using the FFT algorithm. For details, see [14,44]. It is time to consider an apparently distinct problem: fault tolerant computing. Consider a parallel computer, perhaps composed of many individual processing units, each having a certain probability of failure. It is of course desirable that a failure in one of the processing units does not ....

....theory (error control codes in the real field) has been noted before, but does not seem to be widely known in the signal processing community. Specific algorithms have been suggested to solve this problem; we refer to the method described in [43] which is able to correct a single error, and to [14, 27, 44], for the correction of multiple errors. 3.2. The role of frames The previous observations have several immediate consequences. Reference [41] offers one example: an iterative method to solve problem 2, based on a discrete discrete version of the Papoulis Chamzas nonlinear iteration [32] ....

P. J. S. G. Ferreira and J. M. N. Vieira. Detection and correction of missing samples. In Proceedings of the 1997 Workshop on Sampling Theory and Applications, pages 169--174, Aveiro, Portugal, June 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC