Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Most distributed source coding schemes involve the application of a channel code to the signal and transmission of the resulting syndromes. For low-complexity encoding with superior compression performance, graph-based channel codes such as LDPC codes are used to generate the syndromes. The encoder performs simple XOR operations, while the decoder uses belief propagation (BP) decoding to recover the signal of interest using the syndromes and some correlated side information.  consider parallelization of BP decoding on general-purpose multi-core CPUs. The motivation is to make BP decoding fast enough for realtime applications.  consider three different BP decoding algorithms: Sum-Product BP, Min-Sum BP and Algorithm E. The speedup obtained by parallelizing these algorithms is examined along with the tradeoff against decoding performance. Parallelization is achieved by dividing the received syndrome vectors among different cores, and by using vector operations to simultaneously process multiple check nodes in each core. While Min-Sum BP has intermediate decoding complexity, a “vectorized” version of Min-Sum BP performs nearly as fast as the much simpler Algorithm E with significantly fer decoding errors. Our experiments indicate that, for the best compromise beten speed and performance, the decoder should use Min-Sum BP when the side information is of good quality and Sum-Product BP otherwise.
['Svetislav Momcilovic', 'Yige Wang', 'Shantanu Rane', 'Anthony Vetro']
I am writing a research paper on a idea Toward realtime side information decoding on multi-core processors
[{"from": "human", "value": "I am writing a research paper on a idea Toward realtime side information decoding on multi-core processors"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Most distributed source coding schemes involve the application of a channel code to the signal and transmission of the resulting syndromes. For low-complexity encoding with superior compression performance, graph-based channel codes such as LDPC codes are used to generate the syndromes. The encoder performs simple XOR operations, while the decoder uses belief propagation (BP) decoding to recover the signal of interest using the syndromes and some correlated side information.  consider parallelization of BP decoding on general-purpose multi-core CPUs. The motivation is to make BP decoding fast enough for realtime applications.  consider three different BP decoding algorithms: Sum-Product BP, Min-Sum BP and Algorithm E. The speedup obtained by parallelizing these algorithms is examined along with the tradeoff against decoding performance. Parallelization is achieved by dividing the received syndrome vectors among different cores, and by using vector operations to simultaneously process multiple check nodes in each core. While Min-Sum BP has intermediate decoding complexity, a \u201cvectorized\u201d version of Min-Sum BP performs nearly as fast as the much simpler Algorithm E with significantly fer decoding errors. Our experiments indicate that, for the best compromise beten speed and performance, the decoder should use Min-Sum BP when the side information is of good quality and Sum-Product BP otherwise."}]