verilog - Page 2 - Developer IT

error when synthesizing VHDL code

- by EquinoX

I am getting the warning that: One or more signals are missing in the sensitivity list of always block. always@(Address)begin ReadData = instructMem[Address]; end How do I get rid of this warning?

Modelsim (XE III/Starter 6.4b) not allowing me to define a macro function

I'm working on a Xiling FPGA for a course project. Normally we use the lab computers, but I'm trying to install on my own computer. So, I'm trying to include a macro file using line: `include "Const.v" But the following macro function doesn't work. Any ideas why? `ifdef synthesis // if Synplify `define SYNPLIFY `define SYNTHESIS `define MACROSAFE `else // if not Synplify `ifdef MODELSIM `define SIMULATION `define MACROSAFE `else `define XST // synthesis translate_off // if XST then stop compiling `undef XST `define SIMULATION `define MODELSIM // synthesis translate_on // if XST then resume compiling `ifdef XST `define SYNTHESIS `define MACROSAFE `endif `endif `endif //------------------------------------------------------------------------------ //------------------------------------------------------------------------------ // Section: Log2 Macro // Desc: A macro to take the log base 2 of any number. Useful for // calculating bitwidths. Warning, this actually calculates // log2(x-1), not log2(x). //------------------------------------------------------------------------------ `ifdef MACROSAFE `define log2(x) ((((x) > 1) ? 1 : 0) + \ (((x) > 2) ? 1 : 0) + \ (((x) > 4) ? 1 : 0) + \ (((x) > 8) ? 1 : 0) + \ (((x) > 16) ? 1 : 0) + \ (((x) > 32) ? 1 : 0) + \ (((x) > 64) ? 1 : 0) + \ (((x) > 128) ? 1 : 0) + \ (((x) > 256) ? 1 : 0) + \ (((x) > 512) ? 1 : 0) + \ (((x) > 1024) ? 1 : 0) + \ (((x) > 2048) ? 1 : 0) + \ (((x) > 4096) ? 1 : 0) + \ (((x) > 8192) ? 1 : 0) + \ (((x) > 16384) ? 1 : 0) + \ (((x) > 32768) ? 1 : 0) + \ (((x) > 65536) ? 1 : 0) + \ (((x) > 131072) ? 1 : 0) + \ (((x) > 262144) ? 1 : 0) + \ (((x) > 524288) ? 1 : 0) + \ (((x) > 1048576) ? 1 : 0) + \ (((x) > 2097152) ? 1 : 0) + \ (((x) > 4194304) ? 1 : 0) + \ (((x) > 8388608) ? 1 : 0) + \ (((x) > 16777216) ? 1 : 0) + \ (((x) > 33554432) ? 1 : 0) + \ (((x) > 67108864) ? 1 : 0) + \ (((x) > 134217728) ? 1 : 0) + \ (((x) > 268435456) ? 1 : 0) + \ (((x) > 536870912) ? 1 : 0) + \ (((x) > 1073741824) ? 1 : 0)) `endif

Read the article

How to change the probability distribution of SystemVerilog random variables?

- by krupan

This is for SystemVerilog. I know you can specify weights for values, or ranges of values, in the set of values that a random variable chooses from, but what if you want a nice Gaussian distribution? How do you write that kind of constraint?

Read the article

Fast partial sorting algorithm

- by trican

I'm looking for a fast way to do a partial sort of 81 numbers - Ideally I'm looking to extract the lowest 16 values (its not necessary for the 16 to be in the absolutely correct order). The target for this is dedicated hardware in an FPGA - so this slightly complicated matters as I want the area of the resultant implementation as small as possible. I looked at and implemented the odd-even merge sort algorithm, but I'm ideally looking for anything that might be more efficient for my needs (trade algorithm implementation size for a partial sort giving lowest 16, not necessarily in order as opposed to a full sort) Any suggestions would be very welcome Many thanks

Read the article

How can I use foreach and fork together to do something in parallel?

- by kaushalmodi

This question is not UVM specific but the example that I am working on is UVM related. I have an array of agents in my UVM environment and I would like to launch a sequence on all of them in parallel. If I do the below: foreach (env.agt[i]) begin seq.start(env.agt[i].sqr); end , the sequence seq first executes on env.agt[0].sqr. Once that gets over, it then executes on env.agt[1].sqr and so on. I want to implement a foreach-fork statement so that seq is executed in parallel on all agt[i] sequencers. No matter how I order the fork-join and foreach, I am not able to achieve that. Can you please help me get that parallel sequence launching behavior? Thanks.

Read the article

converting if else statement to ternary

- by EquinoX

I have translated the following code using ternary. However, I knew there was something wrong with it. Can someone please point me into the right direction? ForwardA = 0; ForwardB = 0; //EX Hazard if (EXMEMRegWrite == 1) begin if (EXMEMrd != 0) if (EXMEMrd == IDEXrs) ForwardA = 2'b10; if (EXMEMrd == IDEXrt && IDEXTest == 0) ForwardB = 2'b10; end //MEM Hazard if (MEMWBRegWrite == 1) begin if (MEMWBrd != 0) begin if (!(EXMEMRegWrite == 1 && EXMEMrd != 0 && (EXMEMrd == IDEXrs))) if (MEMWBrd == IDEXrs) ForwardA = 2'b01; if (IDEXTest == 0) begin if (!(EXMEMRegWrite == 1 && EXMEMrd != 0 && (EXMEMrd == IDEXrt))) if (MEMWBrd == IDEXrt) ForwardB = 2'b01; end end end ForwardA = (MEMWBRegWrite && MEMWBrd != 0 && (!(EXMEMRegWrite == 1 && EXMEMrd != 0 && (EXMEMrd == IDEXrs))) && (MEMWBrd == IDEXrs)) ? 2'b01 : ((EXMEMRegWrite && EXMEMrd != 0 && EXMEMrd == IDEXrs) ? 2'b10 : 0); ForwardB = (IDEXTest == 0 && MEMWBRegWrite && MEMWBrd != 0 && (!(EXMEMRegWrite == 1 && EXMEMrd != 0 && (EXMEMrd == IDEXrt))) && (MEMWBrd == IDEXrs)) ? 2'b01 : ((EXMEMRegWrite && EXMEMrd != 0 && EXMEMrd == IDEXrt && IDEXTest == 0) ? 2'b10 : 0);

Read the article

binary number comparison

- by EquinoX

If I have a 32 bit two's complement number and I want to know what is the easiest way to know of two numbers are equal... what would be the fastest bitwise operator to know this? I know xor'ing both numbers and check if the results are zero works well... any other one's? how about if a number is greater than 0?? I can check the 31'st bit to see if it's greater or equal to 0..but how about bgtz?

Read the article

Useful programming languages for hardware programming

- by Sebastian Griotberg

I am thinking to take the next semester a course called "Digital systems architecture", and I know that we need to program micro-controllers with several programming languages such as C, C++, verilog, and VHDL. I want to be prepared to take that course, but I need to know if I need to study deeper these languages. At this moment, I have taken one course in basic Java dealing with basic methods, data types, loop structures, vectors, matrices, and GUI programing. Must I study deeper Java and then go with C, and C++? Besides, I know basic verilog and VHDL.

Read the article

How can you learn to code faster? [closed]

- by SDGator

Possible Duplicate: How to Code Faster (Without Sacrificing Quality) I think I code pretty well. I'd say I'm in the top 20% of the folks doing what I do (ASIC verification using System Verilog). But, out of the folks that I admire and aspire to be like, the difference isn't so much quality of code, but the fact that they can pump out reams of good quality code very quickly. Of course, they've been at it far longer than I have. Is it possible to learn to code faster without compromising quality? Or is that something that only comes with time and experience?

Read the article

Is there an alternative to Google Code Search?

- by blunders

Per the Official Google Blog: Code Search, which was designed to help people search for open source code all over the web, will be shut down along with the Code Search API on January 15, 2012. Google Code Search is now gone, and since that makes it much harder to understand the features it presented, here's my attempt to render them via information I gathered from a cache of the page for the Search Options: The "In Search Box" just notes the syntax to type the command directly in the main search box instead of using the advance search interface. Package (In Search Box: "package:linux-2.6") Language (In Search Box: "lang:c++") (OPTIONS: any language, actionscript, ada, applescript, asp, assembly, autoconf, automake, awk, basic, bat, c, c#, c++, caja, cobol, coldfusion, configure, css, d, eiffel, erlang, fortran, go, haskell, inform, java, java, javascript, jsp, lex, limbo, lisp, lolcode, lua, m4, makefile, maple, mathematica, matlab, messagecatalog, modula2, modula3, objectivec, ocaml, pascal, perl, php, pod, prolog, proto, python, python, r, rebol, ruby, sas, scheme, scilab, sgml, shell, smalltalk, sml, sql, svg, tcl, tex, texinfo, troff, verilog, vhdl, vim, xslt, xul, yacc) File (In Search Box: "file:^.*.java$") Class (In Search Box: "class:HashMap") Function (In Search Box: "function:toString") License (In Search Box: "license:mozilla") (OPTIONS: null/any-license, aladdin/Aladdin-Public-License, artistic/Artistic-License, apache/Apache-License, apple/Apple-Public-Source-License, bsd/BSD-License, cpl/Common-Public-License, epl/Eclipse-Public-License, agpl/GNU-Affero-General-Public-License, gpl/GNU-General-Public-License, lgpl/GNU-Lesser-General-Public-License, disclaimer/Historical-Permission-Notice-and-Disclaimer, ibm/IBM-Public-License, lucent/Lucent-Public-License, mit/MIT-License, mozilla/Mozilla-Public-License, nasa/NASA-Open-Source-Agreement, python/Python-Software-Foundation-License, qpl/Q-Public-License, sleepycat/Sleepycat-License, zope/Zope-Public-License) Case Sensitive (In Search Box: "case:no") (OPTIONS: yes, no) Also of use in understanding the search tool would be the still live FAQs page for Google Code Search. Is there any code search engine that would fully replace Google Code Search's features?

Developer IT