Skip to content

Refactor simulation, computation, fault analysis, and machine modules #149

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
marcostfermin wants to merge 1 commit into
base: develop
Choose a base branch
from
Open

Refactor simulation, computation, fault analysis, and machine modules #149

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 32 additions & 5 deletions electricpy/compute.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -54,6 +54,11 @@ def largest_integer(numBits, signed=True):
>>> cmp.largest_integer(32, signed=True)
2147483647
"""
if numBits is None:
raise ValueError("numBits must be a positive integer.")
numBits = int(numBits)
if numBits <= 0:
raise ValueError("numBits must be a positive integer.")
# Use Signed or Unsigned Formula
if signed:
return int(2 ** (numBits - 1) - 1)
Expand Down Expand Up @@ -123,7 +128,7 @@ def mod2div(divident, divisor):
# part used in each step) is 0, the step cannot
# use the regular divisor; we need to use an
# all-0s divisor.
tmp = xor('0' * pick, tmp) + divident[pick]
tmp = xor('0' * len(divisor), tmp) + divident[pick]

# increment pick to move further
pick += 1
Expand All @@ -134,7 +139,7 @@ def mod2div(divident, divisor):
if tmp[0] == '1':
tmp = xor(divisor, tmp)
else:
tmp = xor('0' * pick, tmp)
tmp = xor('0' * len(divisor), tmp)

checkword = tmp
return checkword
Expand All @@ -143,6 +148,17 @@ def mod2div(divident, divisor):
data = str(data)
# Condition Key
key = str(key)

# Basic validation
if len(key) < 2:
raise ValueError("CRC key must be at least 2 bits long.")
if set(data) - set('01'):
raise ValueError("CRC data must be a string of bits containing only '0' and '1'.")
if set(key) - set('01'):
raise ValueError("CRC key must be a string of bits containing only '0' and '1'.")
if key[0] != '1':
raise ValueError("CRC key must start with '1' (highest-order term present).")

l_key = len(key)

# Appends n-1 zeroes at end of data
Expand Down Expand Up @@ -216,7 +232,7 @@ def mod2div(divident, divisor):
# part used in each step) is 0, the step cannot
# use the regular divisor; we need to use an
# all-0s divisor.
tmp = xor('0' * pick, tmp) + divident[pick]
tmp = xor('0' * len(divisor), tmp) + divident[pick]

# increment pick to move further
pick += 1
Expand All @@ -227,7 +243,7 @@ def mod2div(divident, divisor):
if tmp[0] == '1':
tmp = xor(divisor, tmp)
else:
tmp = xor('0' * pick, tmp)
tmp = xor('0' * len(divisor), tmp)

checkword = tmp
return checkword
Expand All @@ -236,6 +252,17 @@ def mod2div(divident, divisor):
data = str(data)
# Condition Key
key = str(key)

# Basic validation
if len(key) < 2:
raise ValueError("CRC key must be at least 2 bits long.")
if set(data) - set('01'):
raise ValueError("CRC data must be a string of bits containing only '0' and '1'.")
if set(key) - set('01'):
raise ValueError("CRC key must be a string of bits containing only '0' and '1'.")
if key[0] != '1':
raise ValueError("CRC key must start with '1' (highest-order term present).")

l_key = len(key)

# Appends n-1 zeroes at end of data
Expand Down Expand Up @@ -264,7 +291,7 @@ def string_to_bits(str):
The binary representation of the
input string.
"""
data = (''.join(format(ord(x), 'b') for x in str))
data = (''.join(format(ord(x), '08b') for x in str))
return data

# END
Loading