Timeline for 16-bit Parity Generator
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 16, 2015 at 14:33 | answer | added | QuantumRipple | timeline score: 3 | |
| Jul 19, 2015 at 11:03 | history | reopened |
Ethan Bierlein user34073 alexwlchan Loufylouf RubberDuck |
||
| Jul 18, 2015 at 16:02 | review | Reopen votes | |||
| Jul 19, 2015 at 11:03 | |||||
| May 31, 2015 at 23:16 | review | Reopen votes | |||
| Jun 1, 2015 at 2:41 | |||||
| Apr 28, 2015 at 10:02 | history | closed | 200_success | Needs details or clarity | |
| Apr 26, 2015 at 23:52 | comment | added | Paebbels | Can you define how your parity algorithmn should work? Normally, it's a pure XOR operation on all bits of a vector. It's just defined for one vector. Using an OR destrois the XOR meaning. If you don't use a one-bit xor_gate module, you could utilize carry-chains to improve the performance. | |
| Apr 26, 2015 at 15:18 | comment | added | Jonathan Drolet |
I never header of a parity of 2 numbers, how should it work exactly? Should it xor all the bits of a and b together? Do you have a testbench available? Also, it is very uncommon to order vector as range 0 to N in HDL, if you have no reason for for going against conventions, I would suggest you use N downto 0.
|
|
| Apr 26, 2015 at 0:18 | history | tweeted | twitter.com/#!/StackCodeReview/status/592120453906444288 | ||
| Apr 25, 2015 at 23:14 | review | First posts | |||
| Apr 26, 2015 at 5:55 | |||||
| Apr 25, 2015 at 23:14 | history | edited | Marc-Andre | CC BY-SA 3.0 |
no need to add tags in the question title, no need to greet us.
|
| Apr 25, 2015 at 23:11 | history | asked | Kevin Ellis | CC BY-SA 3.0 |