System Level Design Languages:TLM Problems and Weaknesses

By -
TLM Problems and Weaknesses

Although TLM speeds up the entire design process and verification of a system, it has weaknesses that limit its effective use in the design process. One of its main problems is that there is no defined standard for TLM. Design reuse is more feasible if design groups have the same point of view of the design levels and subsets. The other problem is the lack of mature ESL tools to support TLM. Today, many ESL tool vendors are working on automation tools that can accept a design developed in transaction level. These tools include synthesis tools, verification tools, and debugging and simulation tools. A TLM synthesis tool can convert a transaction level design into its corresponding RTL design. The ESL tool vendors can develop their tools more efficiently if there is a specified and standard subset for TLM.

Although there are problems in utilizing TLM in the design process, there are companies that use TLM as their starting point in their design process. These companies use TLM to speed up their modeling phase, early verification process, and software development. With today’s tools they may have to convert their high-level model into lower levels manually or semimanually, but their entire design process time is reduced by using TLM.

Another critical issue in TLM is the design and mapping of real-time operating systems (RTOS) on the design processors and DSPs, and this issue is in its early study phase.

TLM Basic Definitions

The basic vocabulary used in a transaction level design is discussed below. Refer to the diagram of Figure 86.75 for a visual representation of these terms.

• Transaction: The data exchange between any two modules is done by a transaction.

• Module: A meaningful part of a system which has a specified functionality. Different modules in a system can communicate via their I/O ports and channels.

• Port: Connection of a channel to a module is done via a port.

• Channel: The communication protocol between two modules is defined in a channel. Channels are categorized to primitive and hierarchical channels. A primitive channel is a channel which connects two modules with a simple functionality, and a hierarchical channel is a more complex channel which may include ports, modules, and even other channels.

• Interface: An interface is a set of methods needed for definition and implementation of a com- munication protocol.

System Level Design Languages-0252

Comments

Post a Comment

Popular posts from this blog

Square wave oscillators and Op-amp square wave oscillator.

By -
Image
Square wave oscillators If Fourier analysis is performed on a square wave it is found that the waveform is composed of many harmonics of the fundamental frequency. This rich harmonic content makes the square wave particularly useful as a quick test of amplifier performance. Examples of possible results are shown. The simplest way to produce a square wave is to make a sine wave oscillator in one of the ways described earlier, then feed the output to some form of squaring circuit such as a Schmitt trigger. This is the method adopted in most commercial sine/square wave generators. There are, however, several circuits for square wave oscillators and a description of the most common follows. Multivibrator Technically the multivibrator is a relaxation oscillator, working on the charging of a capacitor through a resistor. If a negative edge is applied to the circuit in (a), transistor TR 1 turns off the for time taken for the base voltage to return to 0 V. If the voltage step is...
Read more

Adders:Carry Look-Ahead Adder.

By -
Image
Carry Look-Ahead Adder As previously stated, the carry, c i +1, produced at the i -th position is calculated as c i +1 = x i · y i ∨ c i ·( x i ⊕ y i ). This means that a carry is generated if both x i and y i are 1, or an incoming carry is propagated if one of x i and y i is 1 and the other is 0. Therefore, letting g i denote x i y i , we have c i +1 = g i ∨ c i p i , where p i = x i ⊕ y i . Here, g i is the formula for the carry generation condition at the i -th position, i.e., when g i is 1, a carry is generated at this position. Substituting g i –1 ∨ p i –1 c i –1 for c i , we get A carry look-ahead adder can be realized according to this expression, as illustrated in Figure 41.10 for the case of four bits [21]. According to this expression, c i +1’s are calculated at all positions in parallel. It is hard to realize an n -bit carry look-ahead adder precisely according to this expression, unless n is small, because maximum fan-in and fan-out restriction is violated at higher...
Read more