Abstract: A mechanism for converting a graphical model of a system into an intermediate representation (IR) of a model is discussed. The mechanism alters the IR, and uses the altered IR to create a new or updated graphical model of the system that may be viewed and simulated by a user. Once the user is satisfied with the alterations to the IR, the IR or the graphical model may be used to generate code in a target language to enable the building of the physical system being designed. The use of the altered IR to generate a new or updated graphical model allows a more efficient and customizable design and simulation process than is typically found by simulating code that has been converted to target languages. The generation of the graphical model based on the altered IR allows a user to visually inspect the changes to the system, and the simulation of the graphical model based on the altered IR allows corrective action to be taken to account for any changes that occurred during the transformation of the model.

Abstract: The present invention provides systems and methods which allow the translation of a first representation into an intermediate representation and then into a target representation. The first representation can take numerous forms, including a system model that contains hardware components, software components or some combination thereof. Additionally, the target representation can be in the form of a desired system implementation. The intermediate representation generated from the first representation can include both parallel and serial processes from the first representation. This intermediate representation then uses both serial and parallel processing techniques operating on the system model from within a single intermediate representation to translate the system model of the first representation into a target representation. The target representation may be in a format that is readily used in the creation of a system implementation by a user.

Abstract: A technical computing environment may include a modeling component to facilitate construction of a model and a code generation component. The modeling component may include an input component to receive one or more input signals through an interface protocol, and one or more components to receive one or more parameters, corresponding to the input signals received using the interface protocol, and to operate on the one or more parameters. The code generation component may include a code generator to generate, from the model, programming code compatible with a target environment, and an output interface to output the programming code.

Abstract: A modeling system includes a graphical programming environment that receives a first graphical model from a user. The system may also receive a configuration control set for the first graphical model. A code generation engine converts the first graphical model into an intermediate representation (IR). A second graphical model is created from the IR and the configuration control set. The second graphical model is displayed to the user, and may be subject to one or more modifications. Code in a target language may be generated from the second graphical model.

Abstract: A programming language type system includes, in a memory, a set of numeric type including integer types, fixed-point types and floating-point types, a set of type propagation rules to automatically determine result types of any combination of integer types, fixed-point types and floating-point types, constant annotations to explicitly specify a result type of a literal constant, context-sensitive constants whose type is determined from a context of a constant according to the set of type propagation rules, an assignment operator to explicitly specify a type of a value or computation, and operator annotations to explicitly specify a result type of a computation.

Abstract: A method includes combining functionality from a matrix language programming environment, a statechart programming environment and a block diagram programming environment into an integrated programming environment. The method can also include generating computer instructions from the integrated programming environment in a single user action. The integrated programming environment can support fixed-point arithmetic.

Abstract: Methods and systems for providing a synchronous model in a modeling environment are disclosed. The predetermined operations of the model, such as a transition to a state in a state-based modeling environment, are implicitly synchronized with a signal selected by users, such as a clock signal. The predetermined operations of the model may be synchronized on a rising and/or falling edge of the clock signal. The synchronization of the operations is guarded in which the predetermined operation of the model occurs only on the synchronization signal selected by the users while other operations may occur at any time when the model is activated.

Abstract: A programming language type system includes, in a memory, a set of numeric type including integer types, fixed-point types and floating-point types, a set of type propagation rules to automatically determine result types of any combination of integer types, fixed-point types and floating-point types, constant annotations to explicitly specify a result type of a literal constant, context-sensitive constants whose type is determined from a context of a constant according to the set of type propagation rules, an assignment operator to explicitly specify a type of a value or computation, and operator annotations to explicitly specify a result type of a computation.

Abstract: A programming language type system includes, in a memory, a set of numeric type including integer types, fixed-point types and floating-point types, a set of type propagation rules to automatically determine result types of any combination of integer types, fixed-point types and floating-point types, constant annotations to explicitly specify a result type of a literal constant, context-sensitive constants whose type is determined from a context of a constant according to the set of type propagation rules, an assignment operator to explicitly specify a type of a value or computation, and operator annotations to explicitly specify a result type of a computation.

Abstract: A programming language type system includes, in a memory, a set of numeric type including integer types, fixed-point types and floating-point types, a set of type propagation rules to automatically determine result types of any combination of integer types, fixed-point types and floating-point types, constant annotations to explicitly specify a result type of a literal constant, context-sensitive constants whose type is determined from a context of a constant according to the set of type propagation rules, an assignment operator to explicitly specify a type of a value or computation, and operator annotations to explicitly specify a result type of a computation.

Abstract: A method includes combining functionality from a matrix language programming environment, a statechart programming environment and a block diagram programming environment into an integrated programming environment. The method can also include generating computer instructions from the integrated programming environment in a single user action. The integrated programming environment can support fixed-point arithmetic.

Abstract: A system and method for analyzing large logic traces, with the system having an input for regular expressions, a generator for receiving the regular expressions and generating finite automata which use arithmetic/logic expressions that permit the use of a substantially infinite alphabet, an input for a large trace array, and an analyzer for searching the large trace array with the finite automata, with the analyzer producing results of the search.

Abstract: A system and method for analyzing complex overlapping sequences of events in trace arrays, with the system having an input for receiving regular expressions that have been grouped in a predetermined manner, a generator for receiving the grouped regular expressions and generating multiple finite automata based on the groupings of regular expressions, with each finite automaton being generated using arithmetic/logic expressions to permit the use of a substantially infinite alphabet, an input for the trace array, and an analyzer for searching the trace array simultaneously with the multiple finite automata and providing a way by which the multiple finite automata may communicate with one another during searching, with the analyzer further outputting the results of the search.

Abstract: A circuit that may be implemented in a computer system that will measure the maximum and minimum time intervals for system elements to respond to a request for data or information. The circuit includes control logic that controls operation of the circuit, an up-counter and a down-counter that are used together for measuring the maximum or minimum response time interval, and a display for displaying the maximum or minimum response time interval that is measured during a test period.

Abstract: A high-speed pseudo-random number generator comprising a first shift register with p stages for storing and shifting a value with the least significant bit being adjacent an output terminal; a second shift register with b stages for storing and shifting a pre-loaded value with the least significant bit of the pre-loaded value being stored in the bth stage; a serial adder having at least l input taps with the serial adder adding the two values shifted out of the first and second shift registers and loading the sum output of the serial adder into the first shift register; and a controller for controlling clocking of the first and second shift registers and the serial adder, controlling pre-loading of the pre-load value into the second shift register, and clearing the serial adder.