For each check node, the most reliable nonzero-LLR
messages from the connected variable nodes need to be found by
the sorter. Although the sorting over each additional v-to-c message
vector takes around clock cycles, one v-to-c message
vector is available every clock cycles due to the speed
limitation of the path constructors. Hence, having copies
of the sorters, the most reliable nonzero-LLR v-to-c messages
for each of the check nodes in a layer can be found after
clock cycles. In Fig. 6, the numbers , 5 and 2 denote latencies
as multiples of . Once the sorted messages are available,
Path Constructor-I can start to derive the c-to-v messages
for the current layer. Since Path Constructor-I has copies
of the architecture in Fig. 4, the c-to-v messages for the variable
nodes in each block column of can be derived after
clock cycles. Hence, all c-to-v messages for a layer can be also
computed in clock cycles.
For each check node, the most reliable nonzero-LLR
messages from the connected variable nodes need to be found by
the sorter. Although the sorting over each additional v-to-c message
vector takes around clock cycles, one v-to-c message
vector is available every clock cycles due to the speed
limitation of the path constructors. Hence, having copies
of the sorters, the most reliable nonzero-LLR v-to-c messages
for each of the check nodes in a layer can be found after
clock cycles. In Fig. 6, the numbers , 5 and 2 denote latencies
as multiples of . Once the sorted messages are available,
Path Constructor-I can start to derive the c-to-v messages
for the current layer. Since Path Constructor-I has copies
of the architecture in Fig. 4, the c-to-v messages for the variable
nodes in each block column of can be derived after
clock cycles. Hence, all c-to-v messages for a layer can be also
computed in clock cycles.
การแปล กรุณารอสักครู่..