Digital Receiver Design Using VHDL Generation From Data Flow Graphs

This paper describes a design methodology, a library of reusable VHDL descriptions and a VHDL generation tool used in the application area of digital signal processing, particularly digital receivers for communication links. The tool and the library interact with commercial system simulation and logic synthesis tools. The support of joint optimization of algorithm and architecture as well as the concept for design reuse are explained. The algorithms for generating VHDL code according to different user specifications are described. An application example is used to show the benefits and current limitations of the proposed methodology.

[1]  H. Meyr,et al.  Systematic design optimization of a competitive soft-concatenated decoding system , 1993, Proceedings of IEEE Workshop on VLSI Signal Processing.

[2]  Edward A. Lee Consistency in dataflow graphs , 1991, Proceedings of the International Conference on Application Specific Array Processors.

[3]  Heinrich Meyr,et al.  Two timing recovery algorithms for MSK , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[4]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[5]  Charles E. Leiserson,et al.  Optimizing Synchronous Circuitry by Retiming (Preliminary Version) , 1983 .

[6]  G. Jennings A case against event-driven simulation for digital system design , 1991, [1991] Proceedings of the 24th Annual Simulation Symposium.

[7]  Glenn Jennings A case against event-driven simulation for digital system design , 1991 .

[8]  Thomas Kailath,et al.  Obtaining schedules for digital systems , 1991, IEEE Trans. Signal Process..

[9]  Glenn Jennings A case against event-driven simulation for digital system design , 1991, Annual Simulation Symposium.

[10]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.

[11]  Edward A. Lee,et al.  Scheduling dynamic dataflow graphs with bounded memory using the token flow model , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.