Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.最新文献

英文中文

Opportunistic Cooperations: A New Communication Approach for MANETs 机会合作:一种新的manet通信方法

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 2005-10-28 DOI: 10.1109/ACSSC.2005.1599921

R. de Moraes, H. Sadjadpour, J. Garcia-Luna-Aceves

Opportunistic Cooperations: A New Communication Approach for MANETs Renato M. de Moraes, Hamid R. Sadjadpour J.J. Garcia-Luna-Aceves Department of Electrical Engineering University of California at Santa Cruz (UCSC) Santa Cruz, CA 95064, USA Email: {renato,hamid}@soe.ucsc.edu Department of Computer Engineering at UCSC and Palo Alto Research Center 3333 Coyote Hill Road, Palo Alto, CA 94304, USA Email: jj@soe.ucsc.edu Abstract—We introduce a collaboration-driven approach to the sharing of the available bandwidth in wireless ad hoc networks, which we call opportunistic cooperation. Transmissions are divided in frequency and codes according to nodal locations, and succes- sive interference cancellation (SIC) is used at receivers to allow them to decode and use all transmissions from strong interfer- ing sources. We show that both the link’s Shannon capacity and the per source-destination throughput scale like O(n 2 ) (upper- bound) and Ω[f (n)] (lower-bound), for n nodes in the network, a path loss parameter α > 2, and 1 ≤ f (n) < n 2 . I. I NTRODUCTION Communication protocols used in wireless ad hoc networks today are meant to support reliable communication among senders and receivers that are competing with one another for the use of the shared bandwidth. This “competition-driven” view of bandwidth sharing has had profound implications on network architectures and methods used to access the channel and disseminate information. Gupta and Kumar [1] showed that, in a wireless connected network with static nodes, the throughput for each node degrades as the number of nodes in- creases under the competition-driven view of networking. That p is, it scales as Θ(1/ n log(n)), 1 where n is the number of nodes in the network. Grossglauser and Tse [2] analyzed a two-hop, single-relay forwarding scheme for MANETs in which a source passes a packet to a relay that in turn delivers it to the destination when the two nodes are close to each other. This and many subse- quent studies on how to make MANETs scale by using mobil- ity [2], [3], [4], consider each transmission as competing with all the other concurrent transmissions in the network. However, because a relay cooperates with a source by storing the source’s packet until it is close enough to the intended destination, the throughput of MANETs can be increased. 2 Recently, Toumpis and Goldsmith [5] have shown that the capacity regions for ad hoc networks are significantly increased when multiple access schemes are combined with spatial reuse (i.e., multiple simultaneous transmissions), multihop routing (i.e., packet relaying), and SIC, even without performing power This work was supported in part by CAPES/Brazil, by the US Army Re- search Office under grants W911NF-04-1-0224 and W911NF-05-1-0246, by the Basking Chair of Computer Engineering, and by UCOP CLC under grant SC-05-33. 1 Ω, Θ and O are the standard order bounds. log(·) is the natural logarithm. 2 In [2], the per source-destination throughput scales

机会主义合作:一种新的MANETs通信方法Renato M. de Moraes, Hamid R. Sadjadpour J.J. Garcia-Luna-Aceves加州大学圣克鲁兹分校(UCSC)电子工程系Santa Cruz, CA 95064, USA电子邮件:{Renato, Hamid}@soe.ucsc.edu加州大学圣克鲁兹分校计算机工程系和帕洛阿尔托研究中心3333 Coyote Hill Road, CA 94304, USA电子邮件:jj@soe.ucsc.edu摘要-我们引入了一种协作驱动的方法来共享无线自组织网络中的可用带宽，我们称之为机会合作。传输根据节点位置按频率和编码进行划分，并在接收器上使用连续干扰消除(SIC)，以允许它们解码并使用来自强干扰源的所有传输。我们证明了链路的Shannon容量和每个源-目的地吞吐量规模如O(n 2)(上界)和Ω[f (n)](下界)，对于网络中的n个节点，路径损失参数α > 2，且1≤f (n) < n 2。今天在无线自组织网络中使用的通信协议旨在支持彼此竞争共享带宽的发送方和接收方之间的可靠通信。这种“竞争驱动”的带宽共享观点对网络架构和用于访问信道和传播信息的方法产生了深远的影响。Gupta和Kumar[1]表明，在具有静态节点的无线连接网络中，在竞争驱动的网络视图下，每个节点的吞吐量随着节点数量的增加而降低。p等于Θ(1/ n log(n))其中n是网络中的节点数。Grossglauser和Tse[2]分析了一种用于manet的两跳单中继转发方案，其中源将数据包传递给中继，当两个节点彼此靠近时，中继再将其传递到目的地。这一研究以及随后许多关于如何利用移动性使manet规模化的研究[2]，[3]，[4]都将每次传输视为与网络中所有其他并发传输的竞争。然而，由于中继通过存储源的数据包来与源合作，直到它足够接近预定的目的地，因此可以增加manet的吞吐量。2最近，Toumpis和Goldsmith[5]表明，当多个接入方案与空间重用(即多个同时传输)、多跳路由(即数据包中继)和SIC相结合时，自组织网络的容量区域显着增加，即使没有执行电源。这项工作得到了CAPES/Brazil的部分支持，由美国陆军研究办公室在W911NF-04-1-0224和W911NF-05-1-0246的资助下，由Basking主席的计算机工程。由UCOP CLC授权SC-05-33。1 Ω， Θ和O是标准阶界。Log(·)是自然对数。2在[2]中，每个源-目的吞吐量的规模为Θ(1)。控制。此外，最近引入了实现简单、复杂度低的SIC电路[6]，码分多址(CDMA)[7]和全球定位系统(GPS)[8]技术已经集成到单个IC芯片中[9]。在本文中，我们提出了一种在manet中实现协同带宽共享的综合方法，并提出了我们称之为机会合作的方法。我们表明，通过机会合作，节点访问可用信道并在MANET上转发信息，从而使并发传输在目的地或中继上变得有用。因此，发送方和接收方相互合作，而不是相互竞争。因此，可以获得更好的网络性能。第二节总结了最近用于分析无线网络容量的基本网络模型[1]，[2]，[3]，[4]，[10]。第三部分描述了机会主义合作的实施。第四节给出了链路的香农容量、每个源-目的吞吐量和带宽需求。第五部分对全文进行总结。2术语“单元”表示位于网络中已定义区域内的节点集。一个节点的接收范围定义为半径，从该节点开始测量，它包含同一单元的所有其他节点。与给定节点相关联的集群是该节点的接收器范围所到达的单元集。我们的假设与之前的工作[1]，[2]，[10]一致。此外，本文还认为节点具有SIC能力。我们解决的建模问题是一个MANET，其中n个移动节点在一个单位正方形区域内移动。为了简化我们的分析，我们假设细胞具有正方形形状，每个细胞的面积等于a(n) = φn，其中φ∈(0,1)是网络的细胞面积参数。我们认为通信只发生在那些足够近的节点之间(即。 (在同一单元中)，因此由更远的节点引起的干扰较低，从而实现可靠的通信。换句话说，由于简单路径传播模型的假设，接收器选择最近的节点，因为它们以各自的顺序呈现最佳信道，即接收器利用3。这里使用术语“机会主义”表示在通信会话期间，一个单元中彼此合作的节点数量是一个随机变量。

{"title":"Opportunistic Cooperations: A New Communication Approach for MANETs","authors":"R. de Moraes, H. Sadjadpour, J. Garcia-Luna-Aceves","doi":"10.1109/ACSSC.2005.1599921","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599921","url":null,"abstract":"Opportunistic Cooperations: A New Communication Approach for MANETs Renato M. de Moraes, Hamid R. Sadjadpour J.J. Garcia-Luna-Aceves Department of Electrical Engineering University of California at Santa Cruz (UCSC) Santa Cruz, CA 95064, USA Email: {renato,hamid}@soe.ucsc.edu Department of Computer Engineering at UCSC and Palo Alto Research Center 3333 Coyote Hill Road, Palo Alto, CA 94304, USA Email: jj@soe.ucsc.edu Abstract—We introduce a collaboration-driven approach to the sharing of the available bandwidth in wireless ad hoc networks, which we call opportunistic cooperation. Transmissions are divided in frequency and codes according to nodal locations, and succes- sive interference cancellation (SIC) is used at receivers to allow them to decode and use all transmissions from strong interfer- ing sources. We show that both the link’s Shannon capacity and the per source-destination throughput scale like O(n 2 ) (upper- bound) and Ω[f (n)] (lower-bound), for n nodes in the network, a path loss parameter α > 2, and 1 ≤ f (n) < n 2 . I. I NTRODUCTION Communication protocols used in wireless ad hoc networks today are meant to support reliable communication among senders and receivers that are competing with one another for the use of the shared bandwidth. This “competition-driven” view of bandwidth sharing has had profound implications on network architectures and methods used to access the channel and disseminate information. Gupta and Kumar [1] showed that, in a wireless connected network with static nodes, the throughput for each node degrades as the number of nodes in- creases under the competition-driven view of networking. That p is, it scales as Θ(1/ n log(n)), 1 where n is the number of nodes in the network. Grossglauser and Tse [2] analyzed a two-hop, single-relay forwarding scheme for MANETs in which a source passes a packet to a relay that in turn delivers it to the destination when the two nodes are close to each other. This and many subse- quent studies on how to make MANETs scale by using mobil- ity [2], [3], [4], consider each transmission as competing with all the other concurrent transmissions in the network. However, because a relay cooperates with a source by storing the source’s packet until it is close enough to the intended destination, the throughput of MANETs can be increased. 2 Recently, Toumpis and Goldsmith [5] have shown that the capacity regions for ad hoc networks are significantly increased when multiple access schemes are combined with spatial reuse (i.e., multiple simultaneous transmissions), multihop routing (i.e., packet relaying), and SIC, even without performing power This work was supported in part by CAPES/Brazil, by the US Army Re- search Office under grants W911NF-04-1-0224 and W911NF-05-1-0246, by the Basking Chair of Computer Engineering, and by UCOP CLC under grant SC-05-33. 1 Ω, Θ and O are the standard order bounds. log(·) is the natural logarithm. 2 In [2], the per source-destination throughput scales","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122444021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Extensions of the Signal Richness Preservation Problem in LTI Systems LTI系统中信号丰富度保持问题的扩展

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 2005-10-01 DOI: 10.1109/acssc.2005.1599694

B. Su, P. P. Vaidyanathan

The idea of signal richness has recently been studied in considerable details, and the conditions on linear time invariant (LTI) systems to preserve such richness have been established. In this paper, the concept of richness is extended to practically useful classes such as bounded signals. The class of LTI systems studied for the richness preservation problem are generalized to cases including rectangular systems and infinite impulse response (IIR) systems. Structured proofs of the newly found necessary and sufficient conditions are also presented

近年来，人们对信号丰富度的概念进行了相当详细的研究，并建立了线性时不变系统保持这种丰富度的条件。本文将丰富度的概念推广到有界信号等实际有用的类。将研究丰富度保存问题的LTI系统推广到矩形系统和无限脉冲响应系统。并给出了新发现的充分必要条件的结构化证明

引用次数: 0

A New UMTS TDD Burst Structure With a Semi-Blind Equalisation Scheme 一种新的半盲均衡UMTS TDD突发结构

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 2005-10-01 DOI: 10.1109/ACSSC.2005.1599781

M. Hadef, S. Bendoukha, S. Weiss, M. Rupp

In this paper, we propose a new homogeneous burst structure for the time-division duplex (TDD) component of the universal mobile telecommunication system (UMTS). The midamble period is removed and replaced by a data field to enhance the system's spectrum efficiency. Alternatively, a pilot signal is loaded into one of these bursts over each time slot, in order to ensure a continuous channel tracking by means of a pilot-assisted adaptation. Computer simulations are used to assess the performance of the adaptation strategy over the proposed time burst

本文针对通用移动通信系统(UMTS)的时分双工(TDD)部分提出了一种新的同质突发结构。为了提高系统的频谱效率，中间周期被去除并用数据场代替。或者，一个导频信号被加载到这些脉冲中的一个在每个时隙，以确保一个连续的通道跟踪通过导频辅助适应的手段。利用计算机模拟来评估该自适应策略在所提出的时间突发中的性能

引用次数: 0

Affine Projection Algorithm for Blind Multiuser Equalisation of Downlink DS-CDMA System 下行DS-CDMA盲多用户均衡的仿射投影算法

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 2005-10-01 DOI: 10.1109/ACSSC.2005.1599864

M. Hadef, S. Bendoukha, S. Weiss, M. Rupp

In this paper, we derive an affine projection algorithm (APA) for blind multiuser equalisation, suitable for downlink DS-CDMA systems. Adaptation is performed by minimising a cost function based on the constant modulus (CM) criterion for all users. Computer simulations are used to assess the performance of the algorithm

本文提出了一种适用于下行DS-CDMA系统的盲多用户均衡仿射投影算法。适应是通过最小化基于恒模(CM)标准的所有用户的成本函数来执行的。利用计算机仿真来评估算法的性能

引用次数: 2

A Non-Expansive Convolution for Nonlinear-Phase Paraunitary Filter Banks and Its Application to Image Coding 非线性相位准酉滤波器组的非扩展卷积及其在图像编码中的应用

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 2005-07-01 DOI: 10.1109/ACSSC.2005.1599700

Y. Tanaka, A. Ochi, M. Ikehara

This paper proposes a new non-expansive convolution for nonlinear-phase paraunitary filter banks (NLPPUFBs). First, we present that any NLPPUFBs can be implemented by connecting several block transforms. Next, we show a signal extension method at the analysis bank by exploiting the characteristics of that structure. Furthermore, we prove that the signal can be reconstructed at the synthesis bank without any redundant signals. Finally, we apply the proposed extension to image coding to validate our method

本文提出了一种新的非线性相位准酉滤波器组(nlppufb)的非扩展卷积。首先，我们提出任何nlppufb都可以通过连接多个块变换来实现。接下来，我们通过利用该结构的特征，在分析库中展示了一种信号扩展方法。进一步证明了在没有冗余信号的情况下，可以在合成库重构信号。最后，我们将所提出的扩展应用于图像编码来验证我们的方法

引用次数: 4

Multi-sensor tracking of a vehicle on a grid-II 网格上车辆的多传感器跟踪ii

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 2004-11-07 DOI: 10.1109/ACSSC.2005.1599814

D.D. Sworder, J. E. Boyd, R. Hutchins, Robert J. Elliott

A hybrid model integrates a family of local representations to create a global description of a system operating in a heterogeneous environment. The common hybrid models have been developed for aerial applications and are not well suited for ground motions restricted to a road grid. This paper extends the work presented at last year's conference and presents a provisional version of the Gaussian wavelet estimator, modified to accept road map information. It is shown by example that map-enhancement improves the accuracy of the location estimates and boosts the quality of the calculated uncertainty region

混合模型集成了一系列局部表示，以创建在异构环境中运行的系统的全局描述。常见的混合模型是为空中应用而开发的，不太适合限于道路网格的地面运动。本文扩展了去年会议上提出的工作，并提出了一个临时版本的高斯小波估计器，修改后可以接受路线图信息。算例表明，地图增强提高了位置估计的精度，提高了计算不确定区域的质量

引用次数: 2

Tracking with Sleepy Sensors 用睡眠传感器跟踪

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 1900-01-01 DOI: 10.1109/ACSSC.2005.1600026

V. Veeravalli, J. Fuemmeler, A. Visvanathan

We study the problem of tracking an object that is moving randomly through a dense network of wireless sensors. We assume that each sensor has a limited range for detecting the presence of the object, and that the network is sufficiently dense so that the sensors cover the area of interest. In order to conserve energy the sensors may be put into a sleep mode with a timer that determines the sleep duration. We assume that a sensor that is asleep cannot be communicated with or woken up. Thus the sleep duration needs to be determined at the time the sensor goes to sleep based on all the information available to the sensor. The objective is to track the location of the object to within the accuracy of the range of the sensor. However, having sleeping sensors in the network could result in tracking errors, and hence there is a tradeoff between the energy savings and the tracking error that results from the sleeping actions at the sensors. We consider the design of sleeping policies that optimize this tradeoff.

我们研究了在密集的无线传感器网络中跟踪随机移动的物体的问题。我们假设每个传感器都有一个有限的范围来检测物体的存在，并且网络足够密集，以便传感器覆盖感兴趣的区域。为了节省能量，传感器可以被设置为带有定时器的睡眠模式，定时器决定睡眠持续时间。我们假设处于睡眠状态的传感器无法与之通信或被唤醒。因此，睡眠持续时间需要在传感器进入睡眠状态时根据传感器可用的所有信息确定。目标是跟踪物体的位置到传感器范围的精度范围内。然而，在网络中使用休眠传感器可能会导致跟踪错误，因此在节省能源和传感器上的休眠动作导致的跟踪错误之间存在权衡。我们考虑设计睡眠策略来优化这种权衡。

引用次数: 1

Micro-Coded Programmable Solution for a Class of OFDM Applications 一类OFDM应用的微编码可编程解决方案

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 1900-01-01 DOI: 10.1109/ACSSC.2005.1599980

M. Hennedy, A. Shalash

In modern communications systems, there is a growing need for programmability, yet cost pressures push towards full ASIC solutions. Our paper describes a common platform capable of implementing different OFDM-based computational requirements. This engine can compute Radix-2, and Radix-4 DFT and IDFT, Pre- twiddling and post twiddling, complex gain scaling and shift scaling. A novel technique for automatic overflow protection will be described, which reduces internal quantization effects. The complexity is much lower than that of a general purpose DSP and the gate count is comparable to full hardware implementation, yet the engine provides performance comparable to full hardware and programmability through the execution of microcode.

在现代通信系统中，对可编程性的需求日益增长，但成本压力推动了完整的ASIC解决方案。本文描述了一个能够实现不同ofdm计算需求的通用平台。该引擎可以计算Radix-2和Radix-4的DFT和IDFT，前旋转和后旋转，复增益缩放和移位缩放。本文将介绍一种新的自动溢流保护技术，该技术可以减少内部量化效应。其复杂性远低于通用DSP，门数与全硬件实现相当，但该引擎通过执行微码提供与全硬件相当的性能和可编程性。

引用次数: 0

Low Power and Low Leakage Implementation of RNS FIR Filters RNS FIR滤波器的低功耗低漏实现

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 1900-01-01 DOI: 10.1109/ACSSC.2005.1600042

G. Cardarilli, A. D. Re, A. Nannarelli

The CMOS technology scaling is leading to the integration of ever more complex systems on silicon. On the other hand, the shrinking of the devices and the reduction of the supply voltage have significantly increased the static power dissipation, that in power budgets of nanometer technologies, cannot be neglected any longer. In this work, we take advantage of the properties of the Residue Number System (RNS) to implement FIR filters with reduced static and dynamic power consumption. The results show that the RNS filters offer a reduction of 50% in static power dissipation and a total power reduction of 40% with respect to the corresponding conventional filters. I. INTRODUCTION The objective of the work described in (1) was the com- parison of the power consumption of Finite Impulse Response (FIR) filters implemented in the traditional two's complement system (TCS) and in the Residue Number System (RNS). The work in (1) took into account the dynamic power dissipation, which was by far the dominant portion of the energy consumed a few years ago. With the technology scaling, and the increased transistor's leakage due to sub-threshold currents, also the static power dissipation starts to play an important role in today's power budgets. Moreover, the increasing smaller CMOS transistors allow the hardware implementation of extra functions that be- fore were executed in software, and the migration of complex system to portable devices. Because of the implementation of digital filters in ultra low power processors, such as the one used in tiny systems with limited available power, it is important the static power due to leakage is characterized and, possibly, reduced. To have an idea of the impact of the device's leakage on power dissipation, we implemented a multiplier, which is the basic block of a FIR filter, in a 0.18 µm ,a 0.12 µm and in a 90 nm library. We used the same timing constraint, the delay of 25 inverters with fanout of 4 (a standard measure of delay across different technologies) in their respective libraries. The results, shown in Table I, indicate that the power dissipation due to leakage Pstat increases both in absolute value and as the percentage of the overall power dissipation P TO T. By comparing the 0.18 µm and the 90 nm multipliers, we notice that P TO T has decreased of about 70% (mostly due to the scaling of VDD), but the static part Pstat has increased 14 times and its contribution to the total 40 times. Moreover, for the 90 nm implementation, if the multiplier is used as often as 1% of the processor usage time the static power dissipation becomes dominant. Therefore, the design of systems in nanometer technologies must take into account methodologies to reduce the static power dissipation. In this work, we show that filters implemented in RNS, not only are convenient in terms of dynamic power dissipation (at the same operation rate), but also that the RNS is very effective in the reduction of the static power. In implementing

CMOS技术的规模化正导致越来越复杂的系统集成在硅上。另一方面，器件体积的缩小和电源电压的降低显著增加了静态功耗，这在纳米技术的功耗预算中已不能再被忽视。在这项工作中，我们利用剩余数系统(RNS)的特性来实现FIR滤波器，同时降低了静态和动态功耗。结果表明，相对于相应的传统滤波器，RNS滤波器的静态功耗降低50%，总功耗降低40%。(1)中描述的工作的目的是比较在传统的二补系统(TCS)和剩余数系统(RNS)中实现的有限脉冲响应(FIR)滤波器的功耗。(1)中的工作考虑了动态功耗，这在几年前是能耗的主要部分。随着技术的发展，以及由于亚阈值电流导致晶体管泄漏的增加，静态功耗也开始在当今的功耗预算中发挥重要作用。此外，越来越小的CMOS晶体管允许硬件实现以前在软件中执行的额外功能，并将复杂系统迁移到便携式设备。由于在超低功耗处理器中实现数字滤波器，例如在可用功率有限的微型系统中使用的处理器，因此对泄漏引起的静态功率进行表征并可能降低是很重要的。为了了解器件泄漏对功耗的影响，我们在0.18µm、0.12µm和90 nm的库中实现了一个乘法器，这是FIR滤波器的基本模块。我们在各自的库中使用了相同的时序约束，25个变频器的延迟为4(不同技术之间延迟的标准度量)。结果如表1所示，表明泄漏Pstat引起的功耗在绝对值和总功耗P to T的百分比上都有所增加。通过比较0.18µm和90 nm乘子，我们注意到P to T下降了约70%(主要是由于VDD的缩放)，但静态部分Pstat增加了14倍，其对总功耗的贡献增加了40倍。此外，对于90nm实现，如果乘法器的使用频率高达处理器使用时间的1%，则静态功耗将占主导地位。因此，在纳米技术中设计系统必须考虑降低静态功耗的方法。在这项工作中，我们证明了在RNS中实现的滤波器，不仅在动态功耗方面方便(在相同的运行率下)，而且RNS在降低静态功耗方面也非常有效。在实现这些低功耗单元时，我们利用最先进的设计自动化工具(2)来处理具有双阈值晶体管的标准单元库(3)。背景:近年来，在应用特定数字信号处理(DSP)系统的实现中使用替代数字系统已经获得了显著的重要性，因为它们的功耗低于它们的互补对应。

{"title":"Low Power and Low Leakage Implementation of RNS FIR Filters","authors":"G. Cardarilli, A. D. Re, A. Nannarelli","doi":"10.1109/ACSSC.2005.1600042","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600042","url":null,"abstract":"The CMOS technology scaling is leading to the integration of ever more complex systems on silicon. On the other hand, the shrinking of the devices and the reduction of the supply voltage have significantly increased the static power dissipation, that in power budgets of nanometer technologies, cannot be neglected any longer. In this work, we take advantage of the properties of the Residue Number System (RNS) to implement FIR filters with reduced static and dynamic power consumption. The results show that the RNS filters offer a reduction of 50% in static power dissipation and a total power reduction of 40% with respect to the corresponding conventional filters. I. INTRODUCTION The objective of the work described in (1) was the com- parison of the power consumption of Finite Impulse Response (FIR) filters implemented in the traditional two's complement system (TCS) and in the Residue Number System (RNS). The work in (1) took into account the dynamic power dissipation, which was by far the dominant portion of the energy consumed a few years ago. With the technology scaling, and the increased transistor's leakage due to sub-threshold currents, also the static power dissipation starts to play an important role in today's power budgets. Moreover, the increasing smaller CMOS transistors allow the hardware implementation of extra functions that be- fore were executed in software, and the migration of complex system to portable devices. Because of the implementation of digital filters in ultra low power processors, such as the one used in tiny systems with limited available power, it is important the static power due to leakage is characterized and, possibly, reduced. To have an idea of the impact of the device's leakage on power dissipation, we implemented a multiplier, which is the basic block of a FIR filter, in a 0.18 µm ,a 0.12 µm and in a 90 nm library. We used the same timing constraint, the delay of 25 inverters with fanout of 4 (a standard measure of delay across different technologies) in their respective libraries. The results, shown in Table I, indicate that the power dissipation due to leakage Pstat increases both in absolute value and as the percentage of the overall power dissipation P TO T. By comparing the 0.18 µm and the 90 nm multipliers, we notice that P TO T has decreased of about 70% (mostly due to the scaling of VDD), but the static part Pstat has increased 14 times and its contribution to the total 40 times. Moreover, for the 90 nm implementation, if the multiplier is used as often as 1% of the processor usage time the static power dissipation becomes dominant. Therefore, the design of systems in nanometer technologies must take into account methodologies to reduce the static power dissipation. In this work, we show that filters implemented in RNS, not only are convenient in terms of dynamic power dissipation (at the same operation rate), but also that the RNS is very effective in the reduction of the static power. In implementing","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"58 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 31

Stochastic Sub-space Identification Methods for Bridges 桥梁的随机子空间识别方法

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Pub Date : 1900-01-01 DOI: 10.1109/ACSSC.2005.1599941

V. DeBrunner, L. DeBrunner, P. Wang, J. D. Baldwin, A. Medda, H. Thai

System identification of structures has drawn wide attention because of its potential applicability in many areas, such as structural vibration control [1] and vibration based health monitoring. Because structures such as bridges are most often excited with unmeasured ambient inputs, their identification requires a stochastic partial realization solution. In this paper, we explore this approach. We find that a vibrating structure can be modeled as a stochastic state space model whose modal (structural) parameters can be extracted from the identified system matrices. We study three experimental cases: a simulation study of a finite element beam model bridge, a simply supported steel beam, and data we collected at our test site at Walnut Creek Bridge on I-35 between Dallas, TX and Oklahoma City, OK. We find that our method can effectively identify the modal frequencies of the structures, and thus, the method can potentially provide useful data for the structural health monitoring of bridges.

结构系统识别因其在结构振动控制[1]、基于振动的健康监测等诸多领域的潜在适用性而受到广泛关注。由于桥梁等结构通常受到未测量环境输入的激励，因此它们的识别需要随机部分实现解决方案。在本文中，我们探讨了这种方法。我们发现振动结构可以建模为随机状态空间模型，其模态(结构)参数可以从识别的系统矩阵中提取。我们研究了三个实验案例:有限元梁模型桥的模拟研究，简支钢梁的模拟研究，以及我们在德克萨斯州达拉斯和俄克拉荷马城之间的I-35号核桃溪桥的试验场收集的数据。结果表明，该方法可以有效地识别结构的模态频率，为桥梁结构健康监测提供了有用的数据。

引用次数: 2

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀