摘要: The FFT structure can be modeled as a TREE. For example, below is a 1024 point FFT with mixed \(R 2^3\) and \(R 2^4\) 阅读全文
posted @ 2016-04-19 18:29 IC_Rainer 阅读(121) 评论(0) 推荐(0)
摘要: Sudoku solving algorithms are basically a message-passing algorithm like hard decision LDPC decoding. The grids are the variable node, which is a 81x9 阅读全文
posted @ 2015-11-22 23:03 IC_Rainer 阅读(128) 评论(0) 推荐(0)