Home > Articles > Programming

What Language I Use for... Hardware Design: BlueSpec

David Chisnall tells you why his language of choice for hardware design is Bluespec SystemVerilog (BSV).
Like this article? We recommend

There are a lot of programming languages for creating software, but for designing digital logic the field is much smaller. This isn't entirely surprising. Pretty much everyone has a computer capable of running software, but very few people have wafer fabs, and even FPGAs are relatively uncommon. (Read: expensive - the ones we use retail for about $8000.)

The two major players are VHDL and Verilog, which are register-transfer languages. This means that their basic abstractions are registers (things that hold a value) and combinational logic elements (things that take zero or more values and produce one or more new values). The simplest of these are wires, which take a value and deliver the same value.

In terms of abstraction level, it corresponds to something like C in the software world. You don't have to think about the placement of logic elements, but you do have to think about what every single one is, when things happen in terms of clock lines, and the amount of type checking that you have is on the level of ensuring that the real and expected inputs have the same number of bits.

There are some very high-level tools available for producing Verilog. One example is the Synopsis Processor Designer, which uses pipelines as the fundamental abstraction in a language called LISA 2. If you're designing something like a traditional CPU (including superscalar and GPU-style SIMT cores), it provides an easy way of specifying what happens in each stage.

Bluespec SystemVerilog (BSV) is a language that began life as a Haskell domain-specific language (although it now has very little of the Haskell syntax remaining). It was created by Arvind at MIT to design high-performance network cards. It has since been developed by a spin-out company that specializes in tools for digital logic, originally ASICs and increasingly FPGAs.

Thinking in Parallel

Coming from a software background, the first thing that you have to get used to in the hardware world is that everything happens at once. In software, even with multithreading, there is a point or a small set of points where your control flow is at any given time. You can allocate and deallocate resources on demand. In hardware, resources are "allocated" when you create the chip and then are either idle or working. In something like a pipelined CPU, you'll have multiple instructions in-flight at any given time, and each pipeline stage will be processing its inputs, independently of any concept of global state.

In Verilog, you typically keep things in sync using clock lines that are explicitly defined and used to trigger events. In BSV, this is inferred. A BSV module contains rules (actions) that are triggered whenever all their preconditions are met. Typically, these are implicit conditions.

For example, if you have pipeline stages connected by a FIFO, the rules that read from the FIFO will not fire unless the FIFO has one or more values in it. In the generated Verilog, there will be logic for asserting a line to indicate that there is data ready and using that to trigger the action, but (as should be the case in a high-level language) the programmer isn't responsible for creating it.

BSV modules are very close to classes in an object-oriented language. You instantiate them (statically, obviously, because instantiating a module means creating some hardware) and then you communicate with them either explicitly via methods or implicitly via FIFOs or similar. When you invoke a method from another module directly, that method invocation must happen in the same clock cycle as the caller, which means it imposes some synchronization overhead during synthesis and may end up lowering the maximum clock speed that the design can support.

How you communicate with modules depends a little bit on their complexity. Some are intended to be small and embeddable (for example, the register and FIFO implementations in the BSV standard library are, themselves, modules), and some are instantiated as part of larger modules. Larger ones, such as an instruction decoder, take a reasonable amount of die space and so will typically communicate via FIFOs or similar - something that allows them to work the next clock cycle from when the data was provided.

Don't Miss These Related Articles Also by David Chisnall

Learn more about David Chisnall

Strong Typing

When I'm writing software, I generally like languages with late binding and duck typing because they make it easier to refactor the code incrementally and without having to recompile all dependent libraries. In hardware, this is not an issue. You will never upgrade a shared library in a CPU. At most, you may upgrade some components on an SoC independently, and ensuring that the interfaces remain compatible is very important.

BSV provides a richer type system. In terms of basic data types, it's fairly close to Verilog. You can define integer types of arbitrary widths, tagged unions (where the type of the current value of the union is either propagated statically or via some extra wires), structures, and so on. It allows any of these to have notions of equality and mapping to bits derived automatically. The type system (as one might expect from a Haskell-derived language) goes a lot further than that and into the module system.

For example, when you create a register in BSV, you'll write something like this:

Reg#(UInt#(64))   counter   <- mkReg(0);

This defines a variable called counter. The type of this is parameterized. Reg is an interface that defines the methods available on registers. UInt is the unsigned integer type. This, then, is a register containing a 64-bit integer. It is defined by instantiating the mkReg module (concrete modules are typically prefixed by mk in BSD, short for make), which infers its type from the type of variable and has an initial value of 0.

This is where some of the real power of BSV starts to become apparent. There is a single mkReg module, which implements registers of any type. They are not limited to being just integers; they can hold any type that can be converted to the Bit type (another parameterized type, meaning a fixed-size group of bits). This isn't limited to the built-in types. It's possible to create, for example, floating-point operation modules that are parameterized on the number of bits in the mantissa and exponent and instantiate the same logic for 32-bit, 64-bit, or any other arbitrary sized values that you decide to support (I had a final-year undergraduate student implement an FPU in this way last year).

Simulation Speed and Verification

There are several advantages to a higher-level representation. The obvious one is that it's easier to check the code. The type checking is just the start here. There's a lot of work on converting BSV to representations that allow for formal verification and proving various properties of a system. The availability of more high-level semantic information in the language means that there's more information to check.

The higher-level representation also makes simulation a lot (2-3 orders of magnitude) faster. One of the problems with hardware design is that optimizing the code for synthesis means doing more in parallel, which makes simulation slower.

A cycle-accurate Verilog simulation needs to work at a much finer granularity than a cycle-accurate BSV simulation. The BSV simulator is still around 4 orders of magnitude than an FPGA synthesis, but that's a speed where it's (just about) possible to boot a real OS on a simulated CPU and run some simple tests. It's not something I'd recommend, but for simpler tests it's very fast.


I am a very lazy person and I hate solving the same problem more than once. As software has become more complex, code reuse has gone from being a nice ideal to a fundamental necessity, and the tools have evolved along with this. In the hardware world, it's still a lot less common. Talking to some of the major CPU and GPU vendors, their workflow still largely involves starting from scratch each new generation. They'll have some reusable building blocks, but the overall chip design is new each generation. The idea of incrementally improving it over time just doesn't happen (there are exceptions, but they're fairly rare).

With Bluespec SystemVerilog, it feels like this doesn't have to be the case. It's possible to reuse code, not just between projects but also within the same one. Instantiating different versions of a module just by changing some types in the declaration is amazingly powerful.

The one downside of BSV is that it's a proprietary language with a single vendor behind it. The proprietary part isn't really avoidable because most ASIC and FPGA development toolchains are proprietary. The single-vendor part is somewhat more unfortunate: There are lots of people willing to sell you Verilog toolchains and, although it might be painful, moving between them is possible.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020