Belief propagation processor
A processor and memory technology used in instruments, devices that perform computational operations by changing electrical or magnetic quantities, codes, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0080] refer to figure 1 , in one example of a simulation-based implementation of the Belief Propagation Processor, the decoder for a low-density parity-check (LDPC) code is based on a factor graph 100 in which a variable node 110 is associated with Different input bits (b j ) and a check (constraint) node 120 is associated with each constraint. exist figure 1 In , an example with eight input bits and four checks (constraints) on the input bits is shown. A code can be represented in matrix form, where each column is associated with a different input bit and each row is associated with a different check or constraint. The (i,j) term is 1 if the jth input is used for the ith constraint, and 0 otherwise. In the LDPC example, the constraint is that the XOR of the inputs to the constraint is 0. This example of an LPDC code of length 8 can be represented in terms of the parity check matrix as follows (note that the rows are dependent modulo 2 in this illustrative example, which...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 