📄 notes
字号:
results-------backtrack combinational logic length = 2 * block_part;bit_lines_length = min(2 * block_part, block_length) blk_len/blk_prt = intblock_length > 2 * block_part <========================> block_part = block_length. I could have left bit_line_length = 2 * block_part in this case and half of the bits would be valid (I had already implemented this special case so I left it).valid outputs = block_length bits every (block_length / block_part) or (block_length / block_part) / 2 invalid bit lines + (block_length / block_part) / 2 valid bit lines Note 1 : The above results may not be integers, meaning that there are output bit lines where some of their bits are invalid and the others valid Note 2 : In the special case where block_part = block_length change "invalid bit lines" to "2 * block_part". In effect the general expresion should have "backtrack combinational logic length" instead of "invalid bit lines".outputs order = inversed, meaning that the bit lines take the values of the MS bits of every block_length decoded bits first. (bit_lines are also printed inversed therefore 2 inverses to get the decoded output)example :decoded bits = 10101111block_part = 2block_length = 4result :bit_lines = 2out : xx, xx,
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -