arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0707.1063cs.ITmath.IT
收藏

用低精度传感器对带限场进行高分辨率分布式采样

High-resolution distributed sampling of bandlimited fields with low-precision sensors

Animesh Kumar, Prakash Ishwar, Kannan Ramchandran

摘要:

在分布式的,通信受限的,处理环境中,采样的问题的离散时间序列的空间带宽有限的字段与有界的动态范围。需要一个中央单元,可以访问由固定精度传感器组成的密集网络收集的数据,在严格的节点间通信约束下运行,以最大的精度重建现场快照。确定性和随机场模型被认为是。对于随机场,结果是在几乎肯定意义下成立的。过采样率(传感器密度)和模数转换器(ADC)的精度之间有一个灵活的权衡,同时实现每奈奎斯特间隔每快照的位数的指数精度的可行性被证明。这揭示了一个潜在的“比特守恒”原理:每个快照的每个奈奎斯特间隔的比特预算(速率)可以以几乎任意的离散值方式沿着幅度轴(传感器精度)和空间(传感器密度)分布,同时保持相同的(指数)失真率特性。在有界区域上的场重构的可量化信息缩放定律也被导出:对于每个奈奎斯特间隔、$Θ(\log N)$奈奎斯特间隔和总网络比特率$R_{net} = Θ((\log N)^2)$(每个传感器比特率$Θ((\log N)/N)$)的N个一比特传感器,最大逐点失真变为零,如$D = O((\log N)^2/N)$或$D = O(R_{net} 2^{-β\sqrt{R_{net}}})$。这被证明是可能的,只有最近的邻居通信,分布式编码,和适当的插值算法。对于一个固定的,非零的目标失真,固定精度的传感器的数量和所需的网络速率总是有限的。

英文摘要:

The problem of sampling a discrete-time sequence of spatially bandlimited fields with a bounded dynamic range, in a distributed, communication-constrained, processing environment is addressed. A central unit, having access to the data gathered by a dense network of fixed-precision sensors, operating under stringent inter-node communication constraints, is required to reconstruct the field snapshots to maximum accuracy. Both deterministic and stochastic field models are considered. For stochastic fields, results are established in the almost-sure sense. The feasibility of having a flexible tradeoff between the oversampling rate (sensor density) and the analog-to-digital converter (ADC) precision, while achieving an exponential accuracy in the number of bits per Nyquist-interval per snapshot is demonstrated. This exposes an underlying ``conservation of bits'' principle: the bit-budget per Nyquist-interval per snapshot (the rate) can be distributed along the amplitude axis (sensor-precision) and space (sensor density) in an almost arbitrary discrete-valued manner, while retaining the same (exponential) distortion-rate characteristics. Achievable information scaling laws for field reconstruction over a bounded region are also derived: With N one-bit sensors per Nyquist-interval, $Θ(\log N)$ Nyquist-intervals, and total network bitrate $R_{net} = Θ((\log N)^2)$ (per-sensor bitrate $Θ((\log N)/N)$), the maximum pointwise distortion goes to zero as $D = O((\log N)^2/N)$ or $D = O(R_{net} 2^{-β\sqrt{R_{net}}})$. This is shown to be possible with only nearest-neighbor communication, distributed coding, and appropriate interpolation algorithms. For a fixed, nonzero target distortion, the number of fixed-precision sensors and the network rate needed is always finite.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑