#

RTL Design and Verification

Our team of experienced design engineers, complemented by a group of mid-level engineers have worked on multiple aspects of the RTL design flow on chips used in the automotive, mobile, networking, multimedia and processor industries. The following schematic demonstrates how Mirafra’s expertise helps the pieces of the jigsaw fall into place.

#

Register Transfer Level (RTL) simulation and verification is one of the initial steps that was done. This step ensures that the design is logically correct and without major timing errors. It is advantageous to perform this step, especially in the early stages of the design, because long synthesis and place-and-route times can be avoided when an error is discovered at this stage. This step also eliminates all the syntax errors from your VHDL code.

We used the Synopsys simulation tools to perform RTL verification. More specifically, vhdlan, or VHDL_analyzer was used. In addition, if the design contains LogiBloX components, (which is usually the case), the corresponding VHDL primitives generated by Xilinx tools along with Xilinx libraries have to be visible to the Synopsys tools.

Expertise in Front-end RTL design and SoC integration of multi-million gates IPs and SoCs for a variety of industry verticals like mobile, processors, networking and multimedia. Experience in the design verification involving standardized methodology like UVM based functional and formal techniques, VIP development, Equivalence checking and Gate level simulations of complex IP and SoC designs.

Verification

AIML’s verification team has proven expertise on taking complete ownership of verification of a design from scratch – whether that is an IP/SOC/subsystem – and taking it to verification closure by performing the following activities.

  • Understanding the design specification document and creating the test plan.
  • Creating the complete verification environment using industry standard methodologies like UVM/OVM/VMM.
  • Executing the test plan by using an intelligent mix of constraint random, directed and random test cases Gate level simulations.
  • Verification closure through corner case verification, coverage closure and regression closure.

EFFICIENT FPGA MAPPING OF PIPELINE SDF FFT CORES

The FFT is one of the most widely used algorithms for calculating the Discrete Fourier Transform (DFT) owing to its efficiency in reducing computation time. Fast Fourier Transform (FFT) has been used in a wide range of applications, such as wide-band mobile digital communication system based on Orthogonal Frequency Division Multiplexing (OFDM) principle,

where the system implementation is only feasible when the equipment complexity and power consumption are greatly reduced by utilizing a realtime FFT transformer to replace the bank of (de)modulators for each individual sub-carriers. FFT, as an efficient algorithm to compute the Discrete Fourier Transform (DFT), is one of the most important operations in modern digital signal Processing and communication systems.

  • The SFF Architecture
  • Comparison with Earlier Proposed Architectures
  • FPGA Mapping
  • Parameterized FPGA Implementation
  • Project: Semiconductor
  • Categories : RTL Design
  • Status : Good
  • Client : Siddarth
  • Duration : 2 Months

Have a Project to Discuss? Would you like to learn more about what we do? Do you have a project you would like to discuss?

If so then please submit your response and we will contact you shortly.