Verification Academy

Search form

My Account Menu

  • Register
  • Log In
  • Topics
  • Courses
  • Forums
  • Patterns Library
  • Cookbooks
  • Events
  • More
  • All Topics
    The Verification Academy offers users multiple entry points to find the information they need. One of these entry points is through Topic collections. These topics are industry standards that all design and verification engineers should recognize. While we continue to add new topics, users are encourage to further refine collection information to meet their specific interests.
    • Languages & Standards

      • Portable Test and Stimulus
      • Functional Safety
      • Design & Verification Languages
    • Methodologies

      • UVM - Universal Verification Methodology
      • UVM Framework
      • UVM Connect
      • FPGA Verification
      • Coverage
    • Techniques & Tools

      • Verification IQ
      • Verification IP
      • Static-Based Techniques
      • Simulation-Based Techniques
      • Planning, Measurement, and Analysis
      • Formal-Based Techniques
      • Debug
      • Acceleration
  • All Courses
    The Verification Academy is organized into a collection of free online courses, focusing on various key aspects of advanced functional verification. Each course consists of multiple sessions—allowing the participant to pick and choose specific topics of interest, as well as revisit any specific topics for future reference. After completing a specific course, the participant should be armed with enough knowledge to then understand the necessary steps required for maturing their own organization’s skills and infrastructure on the specific topic of interest. The Verification Academy will provide you with a unique opportunity to develop an understanding of how to mature your organization’s processes so that you can then reap the benefits that advanced functional verification offers.
    • Universal Verification Methodology (UVM)

      • Introduction to UVM
      • UVM Basics
      • Advanced UVM
      • UVM Connect
      • UVM Debug
      • UVMF - One Bite at a Time
    • Featured Courses

      • Introduction to ISO 26262
      • Introduction to DO-254
      • Clock-Domain Crossing Verification
      • Portable Stimulus Basics
      • Power Aware CDC Verification
      • Power Aware Verification
      • SystemVerilog OOP for UVM Verification
    • Additional Courses

      • Assertion-Based Verification
      • An Introduction to Unit Testing with SVUnit
      • Evolving FPGA Verification Capabilities
      • Metrics in SoC Verification
      • SystemVerilog Testbench Acceleration
      • Testbench Co-Emulation: SystemC & TLM-2.0
      • Verification Planning and Management
      • VHDL-2008 Why It Matters
    • Formal-Based Techniques

      • Formal Assertion-Based Verification
      • Formal-Based Technology: Automatic Formal Solutions
      • Formal Coverage
      • Getting Started with Formal-Based Technology
      • Handling Inconclusive Assertions in Formal Verification
      • Sequential Logic Equivalence Checking
    • Analog/Mixed Signal

      • AMS Design Configuration Schemes
      • Improve AMS Verification Performance
      • Improve AMS Verification Quality
  • All Forum Topics
    The Verification Community is eager to answer your UVM, SystemVerilog and Coverage related questions. We encourage you to take an active role in the Forums by answering and commenting to any questions that you are able to.
    • UVM Forum

      • Active Questions
      • Solutions
      • Replies
      • No Replies
      • Search
      • UVM Forum
    • SystemVerilog Forum

      • Active Questions
      • Solutions
      • Replies
      • No Replies
      • Search
      • SystemVerilog Forum
    • Coverage Forum

      • Active Questions
      • Solutions
      • Replies
      • No Replies
      • Search
      • Coverage Forum
    • Additional Forums

      • Announcements
      • Downloads
      • OVM Forum
  • Patterns Library
    The Verification Academy Patterns Library contains a collection of solutions to many of today's verification problems. The patterns contained in the library span across the entire domain of verification (i.e., from specification to methodology to implementation—and across multiple verification engines such as formal, simulation, and emulation).
    • Implementation Patterns

      • Environment Patterns
      • Stimulus Patterns
      • Analysis Patterns
      • All Implementation Patterns
    • Specification Patterns

      • Occurrence Property Patterns
      • Order Property Patterns
      • All Specification Patterns
    • Pattern Resources

      • Start Here - Patterns Library Overview
      • Whitepaper - Taking Reuse to the Next Level
      • Verification Horizons - The Verification Academy Patterns Library
      • Contribute a Pattern to the Library
  • All Cookbooks
    Find all the methodology you need in this comprehensive and vast collection. The UVM and Coverage Cookbooks contain dozens of informative, executable articles covering all aspects of UVM and Coverage.
    • UVM Cookbook

      • UVM Basics
      • Testbench Architecture
      • DUT-Testbench Connections
      • Configuring a Test Environment
      • Analysis Components & Techniques
      • End Of Test Mechanisms
      • Sequences
      • The UVM Messaging System
      • Other Stimulus Techniques
      • Register Abstraction Layer
      • Testbench Acceleration through Co-Emulation
      • Debug of SV and UVM
      • UVM Connect - SV-SystemC interoperability
      • UVM Versions and Compatibility
      • UVM Cookbook
    • Coding Guidelines & Deployment

      • Code Examples
      • UVM Verification Component
      • Package/Organization
      • Questa/Compiling UVM
      • SystemVerilog Guidelines
      • SystemVerilog Performance Guidelines
      • UVM Guidelines
      • UVM Performance Guidelines
    • Coverage Cookbook

      • Introduction
      • What is Coverage?
      • Kinds of Coverage
      • Specification to Testplan
      • Testplan to Functional Coverage
      • Bus Protocol Coverage
      • Block Level Coverage
      • Datapath Coverage
      • SoC Coverage Example
      • Requirements Writing Guidelines
      • Coverage Cookbook
  • All Events
    No one argues that the challenges of verification are growing exponentially. What is needed to meet these challenges are tools, methodologies and processes that can help you transform your verification environment. These recorded seminars from Verification Academy trainers and users provide examples for adoption of new technologies and how to evolve your verification process.
    • Featured & On-Demand

      • Exploring Formal Coverage
      • Processor Customization
      • Interconnect Formal
      • Formal and the Next Normal
      • Formal Verification Made Easy
      • Data Independence and Non-Determinism
      • Exhaustive Scoreboarding
      • Visualizer Debug Environment
      • Webinar Calendar
    • On-Demand Library

      • SystemVerilog Assertions
      • Practical Flows for Continuous Integration
      • Continuous Integration
      • Questa Verification IQ
      • Avery & Siemens VIP
      • Protocol and Memory Interface Verification
      • HPC Protocols & Memories
      • Preparing for PCIe 6.0: Parts I & II
      • High Defect Coverage
      • SoC Design & Functional Safety Flow
      • Complex Safety Architectures
      • All On-Demand Recordings
    • Recording Archive

      • Lint vs Formal AutoCheck
      • FPGA Design Challenges
      • Design Solutions as a Sleep Aid
      • Fix FPGA Failures Faster
      • CDC and RDC Assist
      • The Dog ate my RTL
      • Questa Lint & CDC
      • Hierarchical CDC+RDC
      • Improving Initial RTL Quality
      • CDC Philosophy
      • Hardware Emulation Productivity
      • The Three Pillars of Intent-Focused Insight
      • All Webinar Topics
    • Conferences & WRG

      • 2022 Functional Verification Study
      • Improving Your SystemVerilog & UVM Skills
      • Automotive Functional Safety Forum
      • Aerospace & Defense Tech Day
      • Siemens EDA Functional Verification
      • Industry Data & Surveys
      • DVCon 2023
      • DVCon 2022
      • DVCon 2021
      • Osmosis 2022
      • All Conferences
    • Siemens EDA Learning Center

      • EDA Xcelerator Academy(Learning Services) Verification Training, Badging and Certification
      • View all Xcelerator Academy classes
  • About Verification Academy
    The Verification Academy will provide you with a unique opportunity to develop an understanding of how to mature your organization's processes so that you can then reap the benefits that advanced functional verification offers.
    • Blog & News

      • Verification IQ
      • Verification Horizons Blog
      • Technical Resources
    • Verification Horizons Publication

      • Verification Horizons - July 2023
      • Verification Horizons - March 2023
      • Verification Horizons - December 2022
      • Issue Archive
    • About Us

      • Verification Academy Overview
      • Subject Matter Experts
      • Academy News
      • Contact Us
    • Training

      • Learning @OneGlance (PDF)
      • SystemVerilog & UVM Classes
      • Siemens EDA Classes
Ask a Question
SystemVerilog
  • Home
  • Forums
  • SystemVerilog
  • Array randomization issue

Array randomization issue

SystemVerilog 6740
#array 23 #constraint ... 106 array randomization 17
nedicm
nedicm
Forum Access
6 posts
February 17, 2022 at 2:19 pm

Hi all,

I have a predefined array of struts (150 elements), and based on the array I should get another array (or queue) as a result of randomization. Newly created one should be the same type, but should contain less elements, and elements should be picked up from the original array.
Here is simplified pseudocode:

// type
typedef struct {string name;
                int param_1;
                int param_2;
                } traffic_t;
 
// predefined array
traffic_t trafic[] = '{
  '{name_1, num_11, num_12}, 
  '{name_2, num_21, num_22},
  '{name_3, num_31, num_32},
  '{name_4, num_41, num_42},  
//... 
  '{name_150, num_1501, num_1502}
};

Based on the array I should generate its reduced version, with following constraints:

  • it is not said how many elements reduced array should have, and it is should be randomly chosen
  • sum of all param_1 fields of newly created array should be == SUM_OF_PARAM_1
  • sum of all param_2 fields of newly created array should be <= SUM_OF_PARAM_2
  • the same element can appear multiple times in new array

As an example, as a result of randomization new array can contain following elements, if constraints are satisfied:

new_array[] = '{
  '{name_3,   num_31,  num_32},
  '{name_19,  num_191, num_192},
  '{name_3,   num_31,  num_32},
  '{name_120, num_120, num_120}};

I have problem to set proper constraints. I tried with:

rand traffic_t new_array[$];
 
  constraint c1 {
      new_array.sum(item) with (int'(item.param_1)) == PARAM_1_RATE;
	}
  constraint c2 {
      new_array.sum(item) with (int'(item.param_2)) <= PARAM_2_RATE;
	}

but it doesnt work, because all simulators I tried have tendency to start picking up elements from the beginning, instead of picking up them randomly from original array. In pseudocode I'm getting something like this:

new_array[] = '{
  '{name_1, num_11, num_12}, 
  '{name_2, num_21, num_22},
  '{name_3, num_31, num_32},
  '{name_4, num_41, num_42}};

Does anybody understand why it happens?
Any idea how to set constraints properly?

Thank you
Marko

Replies

Log In to Reply
Jianfeng_0
Jianfeng_0
Full Access
58 posts
February 17, 2022 at 10:06 pm

In reply to nedicm:

How did you constrain elements in new_array are from pre-defined trafic array?

Rahulkumar
Rahulkumar
Full Access
173 posts
June 01, 2022 at 12:28 pm

In reply to nedicm:

    class Simple;
 
        typedef struct {
               string name;
               rand int unsigned param_1;
               rand int unsigned param_2;
        } traffic_t;
 
        traffic_t trafic[];
        rand traffic_t new_array[];
        rand int N[]; //helper
        int SUM_OF_PARAM_1 = 50;
        int SUM_OF_PARAM_2 = 25;
 
        function new();
             trafic = new[1000];
             foreach(trafic[i]) begin
                 $sformat(trafic[i].name,"name_%0d",i);
                 trafic[i].param_1 = $urandom_range(0,20);
                 trafic[i].param_2 = $urandom_range(0,20);
             end
        endfunction
 
        constraint c1 {
                new_array.size() inside {[1:10]};
                N.size() == new_array.size();
                foreach(N[i]) N[i] inside {[0:trafic.size()-1]};  
                foreach(new_array[i]) { 
                    new_array[i].param_1 == trafic[N[i]].param_1; 
                    new_array[i].param_2 == trafic[N[i]].param_2; 
                } 
                new_array.sum() with(int'(item.param_1)) == SUM_OF_PARAM_1;
                new_array.sum() with(int'(item.param_2)) <= SUM_OF_PARAM_2;
        }
 
        function void post_randomize();
                foreach(new_array[i]) begin new_array[i].name = trafic[N[i]].name; end
        endfunction 
 
    endclass

__________________________________________________________________________________
https://www.linkedin.com/in/patel-rahulkumar/

peter
peter
Full Access
164 posts
June 04, 2022 at 4:20 am

In reply to Rahulkumar:

Hi Rahulkumar,
what is the meaning of helper?
Thanks

imajeeth
imajeeth
Full Access
26 posts
July 22, 2023 at 10:44 am

In reply to Rahulkumar:

Quote:
In reply to nedicm:

    class Simple;
 
        typedef struct {
               string name;
               rand int unsigned param_1;
               rand int unsigned param_2;
        } traffic_t;
 
        traffic_t trafic[];
        rand traffic_t new_array[];
        rand int N[]; //helper
        int SUM_OF_PARAM_1 = 50;
        int SUM_OF_PARAM_2 = 25;
 
        function new();
             trafic = new[1000];
             foreach(trafic[i]) begin
                 $sformat(trafic[i].name,"name_%0d",i);
                 trafic[i].param_1 = $urandom_range(0,20);
                 trafic[i].param_2 = $urandom_range(0,20);
             end
        endfunction
 
        constraint c1 {
                new_array.size() inside {[1:10]};
                N.size() == new_array.size();
                foreach(N[i]) N[i] inside {[0:trafic.size()-1]};  
                foreach(new_array[i]) { 
                    new_array[i].param_1 == trafic[N[i]].param_1; 
                    new_array[i].param_2 == trafic[N[i]].param_2; 
                } 
                new_array.sum() with(int'(item.param_1)) == SUM_OF_PARAM_1;
                new_array.sum() with(int'(item.param_2)) <= SUM_OF_PARAM_2;
        }
 
        function void post_randomize();
                foreach(new_array[i]) begin new_array[i].name = trafic[N[i]].name; end
        endfunction 
 
    endclass

__________________________________________________________________________________
https://www.linkedin.com/in/patel-rahulkumar/

Hi,

Did you actually try to run your code in a simulator? I tried it and the simulator is unable to solve. I think the following 2 constraints, makes it hard for the constraint to solve.

new_array.sum() with(int'(item.param_1)) == SUM_OF_PARAM_1;
new_array.sum() with(int'(item.param_2)) <= SUM_OF_PARAM_2;


There is no guarantee that sum of param1 in original array is equal to SUM_OF_PARAM_1. I think the constraint for that should also be <= SUM_OF_PARAM1. Then it'll work.

By the way curious to know why name is not assigned in the constraint, but done in post_randomize?

Juhi_22
Juhi_22
Full Access
13 posts
September 08, 2023 at 3:27 pm

In reply to imajeeth:

    class Simple;
 
        typedef struct {
               string name;
               rand int unsigned param_1;
               rand int unsigned param_2;
        } traffic_t;
 
        rand traffic_t trafic[];
        rand traffic_t new_array[];
        rand int N[]; //helper
        int SUM_OF_PARAM_1 = 100;
        int SUM_OF_PARAM_2 = 25;
 
        function new();
          trafic = new[50];
             foreach(trafic[i]) begin
                 $sformat(trafic[i].name,"name_%0d",i);
                // trafic[i].param_1 = $urandom_range(0,20);
                 //trafic[i].param_2 = $urandom_range(0,20);
             end
        endfunction
 
        constraint c1 {
                new_array.size() inside {[1:10]};
                N.size() == new_array.size();
                foreach(N[i]) N[i] inside {[0:trafic.size()-1]};  
                foreach(new_array[i]) { 
                    new_array[i].param_1 == trafic[N[i]].param_1; 
                    new_array[i].param_2 == trafic[N[i]].param_2; 
                } 
                  new_array.sum() with(signed'(int'(item.param_1))) == SUM_OF_PARAM_1;
                new_array.sum() with(int'(item.param_2)) <= SUM_OF_PARAM_2;
          foreach(trafic[i]) {trafic[i].param_1 inside {[0:50]}; trafic[i].param_2 inside {[0:50]};}
        }
 
        function void post_randomize();
                foreach(new_array[i]) begin new_array[i].name = trafic[N[i]].name; end
        endfunction 
 
    endclass

module top;
  Simple s;
  
  initial begin
    s=new();
    repeat(5) begin
    assert(s.randomize());
    $display("%p",s.new_array);
    end
  end
endmodule

I have decreased size of array and made traffic class as randomized. It is working fine for repeat loop five times.

Thanks,
Juhi Patel
My Linkedin Profile

Siemens Digital Industries Software

Siemens Digital Industries Software

#TodayMeetsTomorrow

Portfolio

  • Cloud
  • Mendix
  • Electronic Design Automation
  • MindSphere
  • Design, Manufacturing and PLM Software
  • View all Portfolio

Explore

  • Community
  • Blog
  • Online Store

Siemens

  • About Us
  • Careers
  • Events
  • News and Press
  • Customer Stories
  • Partners
  • Trust Center

Contact

  • VA - Contact Us
  • PLM - Contact Us
  • EDA - Contact Us
  • Worldwide Offices
  • Support Center
  • Give us Feedback
© Siemens 2023
Terms of Use Privacy Statement Cookie Statement DMCA