<p>Uncertainty modeling in information fusion challenges decision-making systems, with Dempster-Shafer Evidence Theory (DSET) as a key solution. Although Dempster’s Rule of Combination (DRC), DSET’s core, faces exponential complexity (<InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(O(4^n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>O</mi> <mo stretchy="false">(</mo> <msup> <mn>4</mn> <mi>n</mi> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>) in CPU implementations, limiting scalability for high-dimensional frameworks. Heterogeneous computing improves efficiency, but FPGA-based methods still suffer from increased runtime with more elements in the framework. This study proposes a random signal-based DRC (RS DRC) using FPGA-accelerated parallel processing. When we fixing logical combination count <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathcal {N}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">N</mi> </math></EquationSource> </InlineEquation>, it reduces complexity from <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(O(4^n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>O</mi> <mo stretchy="false">(</mo> <msup> <mn>4</mn> <mi>n</mi> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> to linear <i>O</i>(<i>n</i>), resolving high-dimensional bottlenecks. Experiments show that with 1024 logical combinations, RS DRC fusion time stabilizes at 0.9811ms (true random numbers) and 0.0103ms (pseudo-random numbers) regardless of framework elements. Applied to UCI wine classification, it supports practical deployment of uncertain data processing in complex decision systems.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

RS DRC: the Dempster’s rule of combination with random signals adopted based on CPU-FPGA heterogeneous chips

  • Huaping He,
  • Jie Chen,
  • Heng Zhang

摘要

Uncertainty modeling in information fusion challenges decision-making systems, with Dempster-Shafer Evidence Theory (DSET) as a key solution. Although Dempster’s Rule of Combination (DRC), DSET’s core, faces exponential complexity ( \(O(4^n)\) O ( 4 n ) ) in CPU implementations, limiting scalability for high-dimensional frameworks. Heterogeneous computing improves efficiency, but FPGA-based methods still suffer from increased runtime with more elements in the framework. This study proposes a random signal-based DRC (RS DRC) using FPGA-accelerated parallel processing. When we fixing logical combination count \(\mathcal {N}\) N , it reduces complexity from \(O(4^n)\) O ( 4 n ) to linear O(n), resolving high-dimensional bottlenecks. Experiments show that with 1024 logical combinations, RS DRC fusion time stabilizes at 0.9811ms (true random numbers) and 0.0103ms (pseudo-random numbers) regardless of framework elements. Applied to UCI wine classification, it supports practical deployment of uncertain data processing in complex decision systems.