Efficient signal processing using syntactic pattern recognition methods

This paper presents an optimal architecture for hardware implementation of Context-Free Grammar (CFG) parsers, which can be used to accelerate the performance of applications where response to real time signal processing is a crucial aspect, such as Electrocardiogram (ECG) analysis. Our architecture increases the performance by a factor of approximately two orders of magnitude compared to the pure software implementation, depending on the CFG. This speed up derives mainly from the hardware nature of the implementation, the innovative combinatorial nature of the circuit that implements the fundamental operation of the parsing algorithm and the underlying data representation. We further propose an automated synthesis tool that, given the specification of an arbitrary CFG and using the aforementioned hardware architecture in a template form, generates the HDL (Hardware Design Language) synthesizable source code of the hardware parser for the given grammar. The proposed architecture may be used for real time applications, e.g. natural languages interfaces. The generated source has been simulated for validation, synthesized and tested on a Xilinx FPGA (Field Programmable Gate Array) board.

[1]  Norbert Blum,et al.  Greibach Normal Form Transformation Revisited , 1999, Inf. Comput..

[2]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[3]  O. Firschein,et al.  Syntactic pattern recognition and applications , 1983, Proceedings of the IEEE.

[4]  Oscar H. Ibarra,et al.  Parallel Regognition and Parsing on the Hypercube , 1991, IEEE Trans. Computers.

[5]  Tadao Kasami,et al.  An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .

[6]  King-Sun Fu,et al.  Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture , 1986, Pattern Recognit..

[7]  George K. Papakonstantinou,et al.  An Embedded Microprocessor for Intelligent Control , 2005, J. Intell. Robotic Syst..

[8]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[9]  E. André The Generation of Multimedia Presentations , 2000 .

[10]  Jean-Cédric Chappelier,et al.  An FPGA-based coprocessor for the parsing of context-free grammars , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).

[11]  Walter L. Ruzzo,et al.  An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..

[12]  Gustavo Belforte,et al.  A Contribution to the Automatic Processing of Electrocardiograms Using Syntactic Methods , 1979, IEEE Transactions on Biomedical Engineering.

[13]  Walter Lawrence Ruzzo General context-free language recognition. , 1978 .

[14]  Dong-Yul Ra,et al.  A Parallel Parsing Algorithm for Arbitrary Context-Free Grammars , 1996, Inf. Process. Lett..

[15]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[16]  King-Sun Fu,et al.  Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  George K. Papakonstantinou,et al.  An Embedded System for Artificial Intelligence Applications , 2007 .

[18]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[19]  Alica Kelemenová,et al.  Complexity of Normal Form Grammars , 1984, Theor. Comput. Sci..

[20]  Emmanuel Skordalakis,et al.  Syntactic Pattern Recognition of the ECG , 1990, IEEE Trans. Pattern Anal. Mach. Intell..