2
votes
Generate degree-bound LFSR to approximate given sequence
The measure you are interested in is usually called $k-$error linear complexity. See this review in Asiacrypt 2003 by Niederreiter. There are unpaywalled versions of this paper around. The ...
1
vote
For what $N$ does $2^N$ overflow?
You don't explain how $2^N$ is calculated, so I'm assuming you repeatedly multiply by 2 (or equivalently, you repeatedly add the number to itself, or shift it left). Here's how this process looks on a ...
1
vote
Register Transfer Activity
One way this can be performed in a single cycle is through register renaming. If the processor supports register renaming, no data needs to be moved: one simply renames which register is called R1 ...

D.W.♦
- 152k
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
shift-register × 10computer-architecture × 5
cryptography × 3
pseudo-random-generators × 3
algorithms × 2
cpu × 2
turing-machines × 1
computability × 1
approximation × 1
parallel-computing × 1
coding-theory × 1
counting × 1
cpu-pipelines × 1
sequential-circuit × 1