# US 2003/0216901 A1 · Design apparatus and a method for generating an implementable description of a digital system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0216901 A1
- Document ID: US20030216901A1
- Status: Published application
- Kind: A1
- Application number: 09/873,553
- Filed: 2001-06-04
- Published: 2003-11-20
- Earliest claimed: 1997-03-14
- Assignees: Interuniversitair Micro-Elektronica Centrum (IMEC vzw)
- Inventors: Patrick Schaumont; Serge Vernalde; Johan Cockx
- Web page: https://patentgrep.com/patent/US20030216901A1

## CPC

- G06F 30/3308: using simulation
- G06F 30/30: Circuit design
- G06F 30/33: Design verification, e.g. functional simulation or model checking
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present invention is a design apparatus compiled on a computer environment for generating from a behavioral description of a system comprising at least one digital system part, an implementable description for said system, said behavioral description being represented on said computer environment as a first set of objects with a first set of relations therebetween, said implementable description being represented on said computer environment as a second set of objects with a second set of relations therebetween, said first and second set of objects being part of a design environment.

## Claims

### Claim 1

A design apparatus compiled on a computer environment for generating from a behavioral description of a system comprising at least one digital system part, an implementable description for said system, said behavioral description being represented on said computer environment as a first set of objects with a first set of relations therebetween, said implementable description being represented on said computer environment as a second set of objects with a second set of relations therebetween, said first and second set of objects being part of a design environment, and wherein said first and second set of objects are part of a single design environment.

### Claim 2 (depends on 1)

The design apparatus of claim 1 wherein said first and second set of objects are part of a single design environment.

### Claim 3 (depends on 1)

The design apparatus of claim 1, wherein said design environment comprises an Object Oriented Programming Language.

### Claim 4 (depends on 3)

The design apparatus of claim 3, wherein said Object Oriented Programming Language is C++.

### Claim 5 (depends on 1)

The design apparatus of claim 1, wherein said design environment is an open environment wherein new objects can be created.

### Claim 6 (depends on 1)

The design apparatus of claim 1, wherein at least part of the input signals and output signals of said first set of objects are at least part of the input signals and output signals of said second set of objects.

### Claim 7 (depends on 1)

The design apparatus of claim 1, wherein at least part of the input signals and output signals of said behavioral description are at least part of the input signals and output signals of said implementable description.

### Claim 8 (depends on 1)

The design apparatus of claim 1, wherein said first set of objects has first semantics and said second set of objects has second semantics.

### Claim 9 (depends on 8)

The design apparatus of claim 8, wherein said first semantics is a data-vector model and/or a data-flow model.

### Claim 10 (depends on 1)

The design apparatus of claim 1, wherein the behavioral description includes a structure-free description.

### Claim 11

A design apparatus compiled on a computer environment for generating from a behavioral description of a system comprising at least one digital system part, an implementable description for said system, said behavioral description being represented on said computer environment as a first set of objects with a first set of relations therebetween, said implementable description being represented on said computer environment as a second set of objects with a second set of relations therebetween, said first and second set of objects being part of a design environment, wherein said first and second set of objects are part of a single design environment, wherein said first set of objects has first semantics and said second set of objects has second semantics, and wherein said second semantics is a signal flow graph (SFG) data structure.

### Claim 12 (depends on 11)

The design apparatus of claim 11, wherein the impact in said implementable description of at least a part of the objects of said second set of objects is essentially the same as the impact in said behavioral description of at least a part of the objects of said first set of objects.

### Claim 13 (depends on 11)

The design apparatus of claim 11, further comprising means for simulating the behavior of said system, said means simulating the behavior of said behavioral description, said implementable description or any intermediate description therebetween.

### Claim 14 (depends on 11)

The design apparatus of claim 11, wherein at least part of said second set of objects is derived from objects belonging to said first set of objects.

### Claim 15 (depends on 11)

The design apparatus of claim 11, wherein said implementable description is at least partly obtained by refining said behavioral description.

### Claim 16 (depends on 11)

The design apparatus of claim 11, wherein said implementable description is an architecture description of said system.

### Claim 17 (depends on 16)

The design apparatus of claim 16, further comprising means for translating said architecture description into a synthesizable description of said system, said synthesizable description being directly implementable in hardware.

### Claim 18 (depends on 17)

The design apparatus of claim 17, wherein said hardware is a semiconductor chip.

### Claim 19 (depends on 11)

The design apparatus of claim 11, further comprising means to derive said first set of objects from a vector description describing said system as a set of operations on data vectors.

### Claim 20 (depends on 19)

The design apparatus of claim 19, wherein said vector description is a MATLAB description.

### Claim 21 (depends on 11)

The design apparatus of claim 11, further comprising means for simulating statically or demand-driven scheduled dataflow on said dataflow description.

### Claim 22 (depends on 11)

The design apparatus of claim 11, further comprising means for clock-cycle true simulating said digital system using said dataflow description and/or one or more of said SFG data structures using an expectation-based simulation.

### Claim 23 (depends on 11)

The design apparatus of claim 11, wherein the behavioral description includes a structure-free description.

### Claim 24

A method of designing a system comprising at least one digital part, comprising refining, wherein a behavioral description of said system is transformed into an implementable description of said system, said behavioral description being represented as a first set of objects with a first set of relations therebetween and said implementable description being represented as a second set of objects with a second set of relations therebetween, and wherein said refining comprises translating behavioral characteristics at least partly into structural characteristics.

### Claim 25 (depends on 24)

The method of claim 24, wherein the behavioral description includes a structure-free description.

### Claim 26 (depends on 24)

The method of claim 24, further comprising simulating in which the behavior of said behavioral description, said implementable description and/or any intermediate description therebetween is simulated.

### Claim 27 (depends on 24)

The method of claim 24, wherein said refining comprises the addition of new objects, permitting interaction with existing objects, and adjustments to said existing objects allowing said interaction.

### Claim 28 (depends on 24)

The method of claim 24, wherein said refining is performed in an open environment and comprises expansion of existing objects.

### Claim 29 (depends on 24)

The method of claim 24, wherein said refining comprises first refining, said first refining comprising:
determining the input vector lengths of input, output and intermediate signals;
determining the amount of parallelism of operations that process input signals to output signals;
determining actors, edges and tokens of said data-flow model; and
determining the wordlength of said tokens.

### Claim 30 (depends on 24)

The method of claim 24, wherein said second set of objects with said second set of relations therebetween are at least partly derived from said first set of objects with said first set of relations therebetween.

### Claim 31 (depends on 24)

The method of claim 24, wherein objects belonging to said second set of objects are new objects, identical with and/or derived by inheritance from objects from said first set of objects, or a combination thereof.

### Claim 32 (depends on 24)

The method of claim 24, further comprising combining several SFG models with a finite state machine description resulting in an implementable description.

### Claim 33 (depends on 32)

The method of claim 32, further comprising transforming said implementable description to synthesizable code.

### Claim 34 (depends on 33)

The method of claim 33, wherein said synthesizable code is VHDL code.

### Claim 35

A method of simulating a system, wherein a description of a system is transformed into compilable C++ code.

### Claim 36 (depends on 35)

The method of claim 35, wherein said description is an SFG data structure and said compilable C++ code is used to perform clock cycle true simulations.

### Claim 37 (depends on 35)

The method of claim 35, wherein the description includes a structure-free description.

### Claim 38 (depends on 1)

A hardware circuit or a software simulation of a hardware circuit designed with the design apparatus of claim 1.

### Claim 39 (depends on 24)

A hardware circuit or a software simulation of a hardware circuit designed with the method of claim 24.

### Claim 40

A design apparatus compiled on a computer environment for generating from a behavioral description of a system comprising at least one digital system part, an implementable description for said system, said behavioral description being represented on said computer environment as a first set of objects with a first set of relations therebetween, said implementable description being represented on said computer environment as a second set of objects with a second set of relations therebetween, said first and second set of objects being part of a design environment, wherein said first set of objects has first semantics and said second set of objects has second semantics, and wherein said first semantics is a data-vector model and/or a data-flow model, wherein means for clock-cycle true simulating said digital system using said dataflow description and/or one or more of said SFG data structures using an expectation-based simulation.

### Claim 41

A method of designing a system comprising at least one digital part, comprising refining, wherein a behavioral description of said system is transformed into an implementable description of said system, said behavioral description being represented as a first set of objects with a first set of relations therebetween and said implementable description being represented as a second set of objects with a second set of relations therebetween, wherein said refining comprises first refining wherein said behavioral description is a data-vector model and is at least partly transformed into a data-flow model, and wherein said data-flow model is an untimed floating point data-flow model.

### Claim 42 (depends on 41)

The method of claim 41, wherein said refining further comprises second refining wherein said data-flow model is at least partly transformed into an SFG model.

### Claim 43 (depends on 41)

The method of claim 41, wherein said second set of objects with said second set of relations therebetween are at least partly derived from said first set of objects with said first set of relations therebetween.

### Claim 44 (depends on 41)

The method of claim 41, wherein objects belonging to said second set of objects are new objects, identical with and/or derived by inheritance from objects from said first set of objects, or a combination thereof.

### Claim 45

A method of designing a system comprising at least one digital part, comprising refining wherein a behavioral description of said system is transformed into an implementable description of said system, said behavioral description being represented as a first set of objects with a first set of relations therebetween and said implementable description being represented as a second set of objects with a second set of relations therebetween, wherein said refining comprises:
determining the input vector lengths of input, output and intermediate signals;
determining the amount of parallelism of operations that process input signals to output signals;
determining actors, edges and tokens of said data-flow model; and
determining the wordlength of said tokens.

### Claim 46

A method of designing a system comprising at least one digital part, comprising:
refining, wherein a behavioral description of said system is transformed into an implementable description of said system, said behavioral description being represented as a first set of objects with a first set of relations therebetween and said implementable description being represented as a second set of objects with a second set of relations therebetween,
wherein said refining comprises first refining, wherein said behavioral description is a data-vector model and is at least partly transformed into a data-flow model,
wherein said refining further comprises second refining, wherein said data-flow model is at least partly transformed into an SFG model, and
wherein said SFG model is a timed fixed point SFG model.

### Claim 47 (depends on 46)

The method of claim 46, wherein said second set of objects with said second set of relations therebetween are at least partly derived from said first set of objects with said first set of relations therebetween.

### Claim 48 (depends on 46)

The method of claim 46, wherein objects belonging to said second set of objects are new objects, identical with and/or derived by inheritance from objects from said first set of objects, or a combination thereof.

### Claim 49

A method of designing a system comprising at least one digital part, comprising:
refining, wherein a behavioral description of said system is transformed into an implementable description of said system, said behavioral description being represented as a first set of objects with a first set of relations therebetween and said implementable description being represented as a second set of objects with a second set of relations therebetween,
wherein said refining comprises first refining wherein said behavioral description is a data-vector model and is at least partly transformed into a data-flow model,
wherein said refining further comprises second refining wherein said data-flow model is at least partly transformed into an SFG model, and
combining several of said SFG models with a finite state machine description resulting in an implementable description.

### Claim 50 (depends on 49)

The method of claim 49, further comprising the step of transforming said implementable description to synthesizable code.

### Claim 51 (depends on 49)

The method of claim 49, wherein said synthesizable code is VHDL code.

### Claim 52

A method of simulating a system, wherein a description of a system is transformed into compilable C++ code, wherein said description comprises the combination of several SFG data structures with a finite state machine description resulting in an implementable description, said implementable description being said compilable C++ code suitable for simulating said system as software.

### Claim 53

A method of simulating a system, wherein a description of a system is transformed into compilable C++ code, wherein said simulating comprises a clock-cycle true simulation of said system being an expectation-based simulation using one or more SFG data structures, said expectation-based simulation comprising:
annotating a token age to every token;
annotating a queue age to every queue;
increasing token age according to the token aging rules and with the travel delay for every queue that has transported the token;
increasing queue age with the iteration time of the actor steering the queue; and
checking whether token age is never smaller than queue age throughout the simulation.
