English
You are here:
AR4JA LDPC Decoder
AR4JA LDPC decoder is a configurable design that allows runtime configuration for decoding different code rates (i.e., 1/2, 2/3 and 3/4). To obtain high throughput, two different levels of parallelism are carried out; 128 check nodes and 6 variable nodes which are processed at the same time. Pipeline architecture is followed which significantly speeds up the whole decoding process. Also, layered architecture is implemented which helps to enhance the speed of the decoding process. AR4JA LDPC decoder supports soft decision decoding and hard decision output.
AR4JA LDPC decoder uses Min-Sum algorithm to perform decoding. Min-Sum algorithm is an iterative algorithm that progresses to convergence through two updates: check node update, and variable node update. Check node update is evaluated by calculating the minimums and signs of all connected variable nodes. Then variable node update takes place. Processing is done layer by layer until all layers and iterations are completed.
AR4JA LDPC decoder uses Min-Sum algorithm to perform decoding. Min-Sum algorithm is an iterative algorithm that progresses to convergence through two updates: check node update, and variable node update. Check node update is evaluated by calculating the minimums and signs of all connected variable nodes. Then variable node update takes place. Processing is done layer by layer until all layers and iterations are completed.
View AR4JA LDPC Decoder full description to...
- see the entire AR4JA LDPC Decoder datasheet
- get in contact with AR4JA LDPC Decoder Supplier