# US 2004/0210685 A1 · Block modeling input/output buffer

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

- Number: US 2004/0210685 A1
- Document ID: US20040210685A1
- Status: Published application
- Kind: A1
- Application number: 10/417,404
- Filed: 2003-04-16
- Published: 2004-10-21
- Earliest claimed: 2003-04-16
- Assignees: The MathWorks, Inc.
- Inventors: Donald Paul Orofino II; Ramamurthy Mani
- Web page: https://patentgrep.com/patent/US20040210685A1

## CPC

- G06F 30/33: Design verification, e.g. functional simulation or model checking
- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method of addressing a signal I/O buffer in a block of a block diagram model includes determining a base address, an element offset, a wrap-around size, a starting offset and a stride factor.

## Claims

### Claim 1

A method comprising:
in a block diagram model of a dynamic system, providing a plurality of signal input/output (I/O) types in each computational domain.

### Claim 2 (depends on 1)

The method of claim 1 in which addressing the signal I/O types comprises:
addressing a base address;
addressing an element offset;
addressing a wrap-around size;
addressing a starting offset; and
addressing a stride factor.

### Claim 3 (depends on 2)

The method of claim 2 in which the base address is a starting memory address of sequentially accessible elements of the signal I/O type.

### Claim 4 (depends on 2)

The method of claim 2 in which the element offset is an offset index i that is used in conjunction with the base address to obtain an ith element in the signal I/O type.

### Claim 5 (depends on 2)

The method of claim 2 in which the wrap-around size is an integer index after which the signal I/O type is considered to wrap around on itself.

### Claim 6 (depends on 2)

The method of claim 2 in which the starting offset is an integer offset that determines a relative position of a first element in the signal I/O type with respect to the base address.

### Claim 7 (depends on 2)

The method of claim 2 in which the stride factor is an integer that represents a spacing between elements in the signal I/O types.

### Claim 8 (depends on 2)

The method of claim 2 in which the signal I/O types comprise flexible dimensions.

### Claim 9 (depends on 1)

The method of claim 1 in which signal I/O types comprise dedicated or shared memory spaces used to retain and convey signal values from an output of a block to inputs of one or more blocks within the block diagram.

### Claim 10 (depends on 1)

The method of claim 1 wherein signal I/O types comprise a manner in which the I/O is organized in memory.

### Claim 11 (depends on 1)

The method of claim 1 in which the computational domain is a time-based simulation domain.

### Claim 12 (depends on 1)

The method of claim 1 in which the computational domain is a physical modeling computational domain.

### Claim 13 (depends on 1)

(Original) The method of claim 1 in which the computational domain is a data flow computational domain.

### Claim 14 (depends on 1)

The method of claim 1 in which the computational domain is a graphical programming computational domain.

### Claim 15 (depends on 1)

The method of claim 1 in which the I/O types differ on each port of a multi-port block.

### Claim 16 (depends on 1)

The method of claim 1 in which the block diagram comprises a plurality of blocks wherein one or more of the blocks negotiates signal I/O types that are used to retain signal values.

### Claim 17 (depends on 16)

The method of claim 16 in which the negotiation comprises ranking available signal I/O types to influence the selection of signal I/O types.

### Claim 18

A method of addressing a signal I/O buffer in a block of a block diagram model comprising determining a base address, an element offset, a wrap-around size, a starting offset and a stride factor.

### Claim 19 (depends on 18)

The method of claim 18 in which the base address is a starting memory address of sequentially accessible elements of the signal I/O buffer.

### Claim 20 (depends on 18)

The method of claim 18 in which the element offset is an offset index i that is used in conjunction with the base address to obtain an ith element in the signal I/O buffer.

### Claim 21 (depends on 18)

The method of claim 18 in which the wrap-around size is an integer index after which the signal I/O buffer is considered to wrap around on itself.

### Claim 22 (depends on 18)

The method of claim 18 in which the starting offset is an integer offset that determines a relative position of a first element in the signal I/O buffer with respect to the base address.

### Claim 23 (depends on 18)

The method of claim 18 in which the stride factor is an integer that represents a spacing between elements in the signal I/O buffer.

### Claim 24 (depends on 1)

The method of claim 1 further comprising displaying a visual depiction of the I/O types in the block diagram.

### Claim 25 (depends on 24)

The method of claim 24 in which the visual depiction is a textual annotation of an I/O type.

### Claim 26 (depends on 24)

The method of claim 24 in which the visual depiction is a textual annotation of an I/O type on a specific line.

### Claim 27 (depends on 24)

The method of claim 24 in which the visual depiction is a graphical depiction of an I/O type as a line style.

### Claim 28 (depends on 24)

The method of claim 24 in which the visual depiction is a graphical depiction of an I/O type as a port indicator of a block.

### Claim 29 (depends on 1)

The method of claim 1 further comprising generating code of the block diagram model.

### Claim 30 (depends on 18)

A method of claim 18 further comprising generating code of the block diagram model.

### Claim 31 (depends on 1)

The method of claim 1, in which I/O types describe complex-valued numerical data.

### Claim 32 (depends on 1)

The method of claim 1, in which I/O types describe one of scalar, vector, matrix, and arrays data.

### Claim 33 (depends on 1)

The method of claim 1, in which I/O types contain one of numerical value, structure, string, pointer, object, and indirect references thereto.
