Features:

• HDL-FSM-Editor enables you to implement a digital finite state machine (FSM) in a hardware description language (HDL) such as VHDL or Verilog.
• HDL-FSM-Editor is a graphical state diagram editor with which you can describe a complete FSM.
• HDL-FSM-Editor allows you to implement a FSM in the same way as it is usually described in your project documentation.
• HDL-FSM-Editor is the most simple FSM-Editor: It is very easy to use and avoids unnecessary functional overload.
• HDL-FSM-Editor generates efficient and short HDL-code for simulation and synthesis.
• HDL-FSM-Editor is platform independent, it runs at any platform which supports Python3.
• HDL-FSM-Editor is freeware and open source.

Advantages:

• When using HDL-FSM-Editor you create HDL designs 2 times faster compared to writing them manually in a text editor.
• When using HDL-FSM-Editor you implement less mistakes, as the state diagram provides a clear overview of the functionality of the FSM.
• When using HDL-FSM-Editor you will identify signals which are not read or not written easily, as they are highlighted.
• When using HDL-FSM-Editor your design can also be used as your documentation.
• When using HDL-FSM-Editor your colleagues can easily read, understand and modify the design you originally provided.
• When using HDL-FSM-Editor your HDL-Code will not contain any redundant HDL lines (which are often generated by other tools).
• When using HDL-FSM-Editor you will have immediate access to the generated HDL code inside HDL-FSM-Editor without using another tool.

Prerequisites:

• You must know how an FSM works, but you must not know the difference between a Moore and a Mealy machine (although it is better if you are aware of it).
• You must know a hardware description language such as VHDL or Verilog, as you have to write declarations, conditions and actions by yourself using the selected HDL.
• You must have an HDL-compiler and an HDL-simulator for the verification of your implemented design.

Rebecca Moore Ramming Rebecca [cracked] [ RECOMMENDED ✔ ]

The keyword "rebecca moore ramming rebecca" appears to be a composite of several different cultural and historical references, ranging from the influential American artist Rebecca Moore to the enduring Gothic legacy of Daphne du Maurier's novel Rebecca .

The name "Rebecca" is most synonymous with Daphne du Maurier’s 1938 Gothic masterpiece . In this narrative, the character Rebecca de Winter functions as a "haunting" presence that "ramms" into the life of the unnamed narrator (the second Mrs. de Winter). Rebecca Moore - Artist - MacDowell

: Beyond her personal connections, she has been a fellow at MacDowell and is recognized for her unique contributions to avant-garde music and animal rights advocacy. The Gothic Power of "Rebecca"

Rebecca Moore is a multifaceted American musician, actress, and activist. She became a central figure in the New York experimental theatre and performance art scene at a young age.

Depending on the intended context—whether it is the avant-garde art scene of New York or the psychological depth of classic literature—the term "Rebecca" carries significant weight.

: Moore is famously known as the muse for late singer-songwriter Jeff Buckley . Their relationship heavily inspired his seminal work, including the song "Lover, You Should've Come Over" , written after their breakup as he waited for a call that never came.

Here you can find links to several designs which I have created.
All designs are created by HDL-SCHEM-Editor and HDL-FSM-Editor and all designs are based at VHDL (only for division also Verilog is available).
By the link you will find all the needed source-files for both tools and also the generated VHDL/Verilog-files.

1. Cordic module
2. multiplication module
3. multiplication module with carry-save adders (CS)
4. multiplication module with signed digit adders (SD)
5. multiplication module with binary stored-carry adders (BSC)
6. multiplication module with Wallace tree (WT)
7. multiplication module with Wallace tree and Booth encoding (WT_BOOTH)
8. Karatsuba multiplication module
9. division module
10. division module at signed numbers
11. SRT division module
12. square module
13. Cordic square-root module
14. square-root module
15. Uart
16. Fifo
17. clock-divider module
18. AHB Multi-Layer Bus
19. AHB to APB bridge

---

1. The Cordic module "rotate":

• The module "rotation" can rotate vectors by a given angle (Cordic rotation mode) or to the x-axis (Cordic vectoring mode).

• The module "rotation" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

• The module "rotation" can be used to calculate the sine or cosine of an angle.

• The module "rotation" can be used to convert cartesian coordinates into polar coordinates and vice versa.

---

2. The multiplication module "multiply":

• The module "multiply" multiplies signed numbers.

• The module "multiply" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

• The module "multiply" has an architecture "struct" which implements the classic written multiplication algorithm.

• The module "multiply" has an architecture "fpga" which uses the VHDL multiplication operator.

---

3. The multiplication module "multiply_cs":

• The module "multiply_cs" uses "carry-save" adders for a carry propagation not to the next bit but to the next addition.

• The module "multiply_cs" multiplies signed numbers.

• The module "multiply_cs" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

---

4. The multiplication module "multiply_sd":

• The module "multiply_sd" uses "signed digit" adders for a carry propagation only to the next digit.

• The module "multiply_sd" multiplies signed numbers (internally coded with a redundant number system with radix 4).

• The module "multiply_sd" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

---

5. The multiplication module "multiply_bsc":

• The module "multiply_bsc" uses "binary stored-carry" adders for a fast limited carry propagation.

• The module "multiply_bsc" multiplies signed numbers.

• The module "multiply_bsc" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

---

6. The multiplication module "multiply_wt":

• The module "multiply_wt" uses a Wallace tree for a very fast product calculation.

• The module "multiply_wt" multiplies signed numbers.

• The module "multiply_wt" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

---

7. The multiplication module "multiply_wt_booth":

• The module "multiply_wt_booth" uses Booth encoding with radix-4 conversion to reduce the number of partial products.

• The module "multiply_wt_booth" uses a Wallace tree for a very fast product calculation.

• The module "multiply_wt_booth" multiplies signed numbers.

• The module "multiply_wt_booth" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

---

8. The Karatsuba multiplication module "multiply_karatsuba":

• The module "multiply_karatsuba" multiplies signed numbers.

• The module "multiply_karatsuba" can be configured by generics which define the number of bits of all the operands.

• The module "multiply_karatsuba" has an architecture "struct" which implements the Karatsuba multiplication algorithm.

• The module "multiply_karatsuba" has an architecture "mul_operator" which uses the VHDL multiplication operator.

---

9. The non restoring division module "division":

• The module "division" calculates quotient and remainder from signed dividend and signed divisor.

• The signs are removed before an unsigned division is executed and added afterwards.

• The module "division" is available as VHDL and as Verilog design.

• The module "division" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

• The module "division" uses a non restoring division algorithm.

---

10. The non restoring division module "division_signed":

• The module "division_signed" calculates quotient and remainder from signed dividend and signed divisor.

• In contrary to the module division the signs are not removed before the division is executed.

• This leads to a quotient which is not coded as binary number with the bit weights 0 or 1,
  but as a number with bit weights +1 or -1. After the division this number is converted into a binary number.

• After the conversion the quotient and the remainder are fixed in some cases.

• The module "division_signed" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

• The module "division_signed" uses a non restoring division algorithm.

---

11. The SRT division module "division_srt_radix2":

• The module "division_srt_radix2" calculates quotient and remainder from signed dividend and signed divisor.

• The module uses the SRT algorithm to make fast divisions possible even at operands which have a large number of bits.

• As a radix2 SRT algorithm is used the quotient is first not coded as binary number with the bit weights 0 or 1,
  but as a number with bit weights -1, 0 or +1. After the division this number is converted into a binary number.

• The module "division_srt_radix2" can be configured by generics which define the number of bits of all the operands and which define the latency of the module (in clock cycles).

---

12. The square module "square":

• The module "square" calculates the square from a signed operand.

• The module is faster and smaller than the multiply module.

• The module "square" can be configured by generics which define the number of bits of the operand and which define the latency of the module (in clock cycles).

---

13. The Cordic square-root module "cordic_square_root":

• The module "cordic_square_root" calculates the root from an unsigned radicand by using the Hyperbolic Cordic algorithm.

• The module "cordic_square_root" determines not only the integer bits of the root, but also the same number of bits after the binary point.

• The module "cordic_square_root" can be configured by generics which define the number of bits of the operand and which define the latency of the module (in clock cycles).

---

14. The square-root module "square_root":

• The module "square_root" calculates the root from an unsigned radicand by an exact algorithm.

• When no root bits after the binary point are needed, then the module "square_root" needs the same number of iterations as the module "cordic_square_root".
  Otherwise the module requires twice the number of iterations and also approximately twice as many resources.

• The module "square_root" can be configured by generics which define the number of bits of the operand and which define the latency of the module (in clock cycles).

---

15. The Uart module "uart":

• The module "uart" transfers data by the universal asynchronous receiver/transmitter protocol.

• The module "uart" uses a clock divider which can divide by non integer numbers.

• The module "uart" can be configured by generics which define the number of bits of the data and other behaviour of the module.

---

16. The Fifo module "fifo":

• The module "fifo" stores data according to the "first-in, first-out" principle.

• The module "fifo" can be configured by generics which define the number of bits of the data and the depth of the Fifo.

---

17. The clock-divider module "clock_divider":

• The module "clock_divider" creates a new clock with an integer or a non-integer multiple of the incoming clock period.

• The module "clock_divider" can be configured by generics which define the number of bits of the configuration inputs.

---

18. The AHB Multi-Layer Bus module "ahb_multilayer":

• The module "ahb_multilayer" is a generic AHB Multi-Layer Bus which connects several AHB masters to several AHB slaves.

• The module "ahb_multilayer" can be configured by generics which define the number of masters and slaves and some other properties.

---

19. The AHB to APB bridge module "ahb_apb_bridge":

• The module "ahb_apb_bridge" is a generic bridge module, which connects one AHB master to several APB slaves.

• The module "ahb_apb_bridge" can be configured by generics which define the number of APB slaves and some other properties.

The keyword "rebecca moore ramming rebecca" appears to be a composite of several different cultural and historical references, ranging from the influential American artist Rebecca Moore to the enduring Gothic legacy of Daphne du Maurier's novel Rebecca .

The name "Rebecca" is most synonymous with Daphne du Maurier’s 1938 Gothic masterpiece . In this narrative, the character Rebecca de Winter functions as a "haunting" presence that "ramms" into the life of the unnamed narrator (the second Mrs. de Winter). Rebecca Moore - Artist - MacDowell

: Beyond her personal connections, she has been a fellow at MacDowell and is recognized for her unique contributions to avant-garde music and animal rights advocacy. The Gothic Power of "Rebecca"

Rebecca Moore is a multifaceted American musician, actress, and activist. She became a central figure in the New York experimental theatre and performance art scene at a young age.

Depending on the intended context—whether it is the avant-garde art scene of New York or the psychological depth of classic literature—the term "Rebecca" carries significant weight.

: Moore is famously known as the muse for late singer-songwriter Jeff Buckley . Their relationship heavily inspired his seminal work, including the song "Lover, You Should've Come Over" , written after their breakup as he waited for a call that never came.

If you detect any bugs or have any questions,
please send a mail to "matthias.schweikart@gmx.de".