首页 > 最新文献

Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)最新文献

英文 中文
Frame Expansion Based Peak to Average Power Ratio Reduction in MIMO OFDM Systems 基于帧扩展的MIMO OFDM系统峰值/平均功率比降低
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387518
Guoguang Chen, R. Ansari
The integration of Orthogonal Frequency Division Multiplexing (OFDM) into Multiple Input Multiple Output (MIMO) systems is regarded as a promising technology to provide high performance in fourth generation (4G) broadband wireless communication systems. However, the inherent drawback of large Peak-to-Average Power Ratio (PAPR) for OFDM carries over to MIMO systems. This paper examines the use of Erasure Pattern Selection (EPS) developed for Single Input Single Output (SISO) systems for the task of reducing PAPR in MIMO-OFDM systems. A MIMO-EPS scheme is proposed for minimizing the peak power value over all antennas, which is shown to produce a PAPR reduction gain around 1.5dB for 2 transmit antennas compared with the conventional MIMO-OFDM. The scheme is analyzed to show its significant performance advantages and lower computational complexity compared with an existing SeLective Mapping (SLM) scheme.
将正交频分复用(OFDM)集成到多输入多输出(MIMO)系统中被认为是一种有前途的技术,可以在第四代(4G)宽带无线通信系统中提供高性能。然而,OFDM系统固有的大峰值平均功率比(PAPR)的缺点会延续到MIMO系统中。本文研究了用于单输入单输出(SISO)系统的擦除模式选择(EPS)的使用,以降低MIMO-OFDM系统中的PAPR。提出了一种最小化所有天线峰值功率的MIMO-EPS方案,与传统MIMO-OFDM相比,该方案在2个发射天线中产生约1.5dB的PAPR降低增益。分析表明,与现有的选择性映射(SLM)方案相比,该方案具有显著的性能优势和较低的计算复杂度。
{"title":"Frame Expansion Based Peak to Average Power Ratio Reduction in MIMO OFDM Systems","authors":"Guoguang Chen, R. Ansari","doi":"10.1109/SIPS.2007.4387518","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387518","url":null,"abstract":"The integration of Orthogonal Frequency Division Multiplexing (OFDM) into Multiple Input Multiple Output (MIMO) systems is regarded as a promising technology to provide high performance in fourth generation (4G) broadband wireless communication systems. However, the inherent drawback of large Peak-to-Average Power Ratio (PAPR) for OFDM carries over to MIMO systems. This paper examines the use of Erasure Pattern Selection (EPS) developed for Single Input Single Output (SISO) systems for the task of reducing PAPR in MIMO-OFDM systems. A MIMO-EPS scheme is proposed for minimizing the peak power value over all antennas, which is shown to produce a PAPR reduction gain around 1.5dB for 2 transmit antennas compared with the conventional MIMO-OFDM. The scheme is analyzed to show its significant performance advantages and lower computational complexity compared with an existing SeLective Mapping (SLM) scheme.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"3 1","pages":"61-66"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88911824","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}
引用次数: 2
New Framework for Encoder Optimization of Scalable Video Coding 可扩展视频编码的编码器优化新框架
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387603
Zhengguo Li, W. Yao, S. Rahardja, S. Xie
In this paper, a new framework is proposed for the encoder optimization of scalable video coding (SVC). It is used to provide guidelines for the design of rate control and fast mode decision at the base layer and base layer selection at enhancement layer for the SVC. It is also pointed out that the coding technology of inter-layer prediction with two base layers is desired for the combined coarse granular scalability and spatial scalability such that the coding efficiency losses at layers with higher resolution are about 10% when compared to the corresponding single-layer video coding.
本文提出了一种新的可扩展视频编码(SVC)编码器优化框架。它为SVC的基层速率控制和快速模式决策设计以及增强层基层选择提供指导。本文还指出,为了实现粗粒度可扩展性和空间可扩展性的结合,需要采用双层基层间预测的编码技术,使高分辨率层的编码效率比相应的单层视频编码损失约10%。
{"title":"New Framework for Encoder Optimization of Scalable Video Coding","authors":"Zhengguo Li, W. Yao, S. Rahardja, S. Xie","doi":"10.1109/SIPS.2007.4387603","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387603","url":null,"abstract":"In this paper, a new framework is proposed for the encoder optimization of scalable video coding (SVC). It is used to provide guidelines for the design of rate control and fast mode decision at the base layer and base layer selection at enhancement layer for the SVC. It is also pointed out that the coding technology of inter-layer prediction with two base layers is desired for the combined coarse granular scalability and spatial scalability such that the coding efficiency losses at layers with higher resolution are about 10% when compared to the corresponding single-layer video coding.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"67 1","pages":"527-532"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78247708","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}
引用次数: 7
Visual Hand Gesture Segmentation Using Signer Model for Real-Time Human-Computer Interaction Application Signer模型视觉手势分割在实时人机交互中的应用
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387611
T. Tsai, Chung-Yuan Lin
The task of automatic gesture segmentation is highly challenging due to the computational burden, the presence of unpredictable body motion and ambiguous nongesture hand motion. In this paper, a new approach is developed using Hausdorff based model tracking technique for the application of real-time human-computer interaction. This paper proposed a Three Phases Model Tracking approach, which consists of two main stages; one is motion history analysis, which classifies dynamic gesture into preparation, retraction and nucleus state based on temporal relationship. The other is model tracking, which tracks signer model and object model with different constraint based on the classified state. Finally, gesture model is extracted based on matching object model and signer model and the hand gesture region is segmented from the gesture model. Experiments are performed to test the robustness of gesture segmentation under various hand scale and complex background. The segmentation error rate and computational complexity are also analyzed to demonstrate that the proposed Three Phases Model Tracking approach can be applicable to real-time human-computer interaction system.
由于计算量大、不可预测的身体运动和模糊的非手势手势运动的存在,自动手势分割是一项极具挑战性的任务。本文提出了一种基于Hausdorff模型跟踪技术的实时人机交互应用新方法。本文提出了一种三阶段模型跟踪方法,该方法主要包括两个阶段;一是运动历史分析,基于时间关系将动态手势分为准备、收缩和核态。另一种是模型跟踪,根据分类状态跟踪具有不同约束条件的签名者模型和对象模型。最后,基于匹配对象模型和签名人模型提取手势模型,并从手势模型中分割出手势区域。通过实验验证了该方法在不同手尺度和复杂背景下的鲁棒性。分析了该方法的分割错误率和计算复杂度,证明了该方法可以应用于实时人机交互系统。
{"title":"Visual Hand Gesture Segmentation Using Signer Model for Real-Time Human-Computer Interaction Application","authors":"T. Tsai, Chung-Yuan Lin","doi":"10.1109/SIPS.2007.4387611","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387611","url":null,"abstract":"The task of automatic gesture segmentation is highly challenging due to the computational burden, the presence of unpredictable body motion and ambiguous nongesture hand motion. In this paper, a new approach is developed using Hausdorff based model tracking technique for the application of real-time human-computer interaction. This paper proposed a Three Phases Model Tracking approach, which consists of two main stages; one is motion history analysis, which classifies dynamic gesture into preparation, retraction and nucleus state based on temporal relationship. The other is model tracking, which tracks signer model and object model with different constraint based on the classified state. Finally, gesture model is extracted based on matching object model and signer model and the hand gesture region is segmented from the gesture model. Experiments are performed to test the robustness of gesture segmentation under various hand scale and complex background. The segmentation error rate and computational complexity are also analyzed to demonstrate that the proposed Three Phases Model Tracking approach can be applicable to real-time human-computer interaction system.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"14 1","pages":"567-572"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91104258","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}
引用次数: 0
Performance Optimization of a Multimedia Player on a Mobile CPU Platform 基于移动CPU平台的多媒体播放器性能优化
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387538
Hoseok Chang, Youngjoon Lee, Wonyong Sung
We conducted a mobile platform specific software and system optimization for an open-source multimedia player, MPlayer. The target system is based on the Intel XScale PXA270 CPU. The optimization process consists of 4 steps: utilizing the color conversion hardware, adopting SIMD optimization, increasing the external memory access speed, and exploiting the internal memory. At each optimization step, we measured the execution time, cache miss characteristics, and power consumption. The experimental results with a QVGA-sized MPEG4 movie clip show that hardware based color conversion and SIMD optimization bring about 19.2% and 27.6% of execution time reduction, respectively, while increasing the external memory access speed and utilizing the internal memory result in 35.9% additional execution time reduction. The results show that it is important to break the memory bus bottleneck by using faster data bus settings and exploiting internal SRAM.
我们针对开源多媒体播放器MPlayer进行了移动平台专用软件和系统优化。目标系统基于Intel XScale PXA270 CPU。优化过程包括4个步骤:利用颜色转换硬件、采用SIMD优化、提高外部存储器访问速度、利用内部存储器。在每个优化步骤中,我们测量了执行时间、缓存丢失特征和功耗。基于qvga大小的MPEG4电影剪辑的实验结果表明,基于硬件的颜色转换和SIMD优化分别减少了19.2%和27.6%的执行时间,而提高外部存储器访问速度和利用内部存储器可额外减少35.9%的执行时间。结果表明,采用更快的数据总线设置和利用内部SRAM来打破内存总线瓶颈是非常重要的。
{"title":"Performance Optimization of a Multimedia Player on a Mobile CPU Platform","authors":"Hoseok Chang, Youngjoon Lee, Wonyong Sung","doi":"10.1109/SIPS.2007.4387538","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387538","url":null,"abstract":"We conducted a mobile platform specific software and system optimization for an open-source multimedia player, MPlayer. The target system is based on the Intel XScale PXA270 CPU. The optimization process consists of 4 steps: utilizing the color conversion hardware, adopting SIMD optimization, increasing the external memory access speed, and exploiting the internal memory. At each optimization step, we measured the execution time, cache miss characteristics, and power consumption. The experimental results with a QVGA-sized MPEG4 movie clip show that hardware based color conversion and SIMD optimization bring about 19.2% and 27.6% of execution time reduction, respectively, while increasing the external memory access speed and utilizing the internal memory result in 35.9% additional execution time reduction. The results show that it is important to break the memory bus bottleneck by using faster data bus settings and exploiting internal SRAM.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"21 1","pages":"163-168"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82654277","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}
引用次数: 5
Adaptive Noise Subspace Estimation Algorithm with an Optimal Diagonal-Matrix Step-Size 具有最优对角矩阵步长的自适应噪声子空间估计算法
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387614
Lu Yang, S. Attallah
In this paper, we propose a new optimal diagonal-matrix step-size for the fast data projection method (FDPM) algorithm. The proposed step-sizes control the decoupled subspace vectors individually as compared to conventional methods where all the subspace vectors are multiplied by the same step-size value (scalar case). Simulation results show that FDPM with this optimal diagonal-matrix step-size outperforms the original algorithm as it offers faster convergence rate, smaller steady state error and smaller orthogonality error simultaneously. The proposed method can easily be applied to other subspace algorithms as well.
本文提出了一种新的快速数据投影法(FDPM)算法的最优对角矩阵步长。与传统方法(所有子空间向量乘以相同的步长值(标量情况))相比,所提出的步长分别控制解耦的子空间向量。仿真结果表明,采用最优对角矩阵步长的FDPM算法具有更快的收敛速度、更小的稳态误差和更小的正交误差,优于原算法。该方法也可以很容易地应用于其他子空间算法。
{"title":"Adaptive Noise Subspace Estimation Algorithm with an Optimal Diagonal-Matrix Step-Size","authors":"Lu Yang, S. Attallah","doi":"10.1109/SIPS.2007.4387614","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387614","url":null,"abstract":"In this paper, we propose a new optimal diagonal-matrix step-size for the fast data projection method (FDPM) algorithm. The proposed step-sizes control the decoupled subspace vectors individually as compared to conventional methods where all the subspace vectors are multiplied by the same step-size value (scalar case). Simulation results show that FDPM with this optimal diagonal-matrix step-size outperforms the original algorithm as it offers faster convergence rate, smaller steady state error and smaller orthogonality error simultaneously. The proposed method can easily be applied to other subspace algorithms as well.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"2 1","pages":"584-588"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87419263","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}
引用次数: 0
Variation-Tolerant Motion Estimation Architecture 容差运动估计体系结构
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387531
G. Varatkar, Naresh R Shanbhag
In this paper, we study the trade-off between energy-efficiency and variation-tolerance of an error-resilient motion estimation architecture. Error-resiliency is incorporated via algorithmic noise-tolerance (ANT) where an input subsampled replica (ISR) of the main sum-of-absolute-difference(MSAD) block is employed for detecting and correcting errors in the MSAD block. This architecture is referred to as ISR-ANT. In the presence of process variations, the average peak signal-to-noise ratio (PSNR) of ISR-ANT architecture increases by up to 1.8dB over that of the conventional architecture in 130nm IBM process technology. Furthermore, the PSNR variation is also reduced by 7× over that of the conventional architecture at the slow corner while achieving a power reduction of 33%.
在本文中,我们研究了一种误差弹性运动估计体系结构的能量效率和变化容忍度之间的权衡。错误弹性是通过算法噪声容忍(ANT)来实现的,其中使用主绝对差和(MSAD)块的输入下采样副本(ISR)来检测和纠正MSAD块中的错误。这种体系结构被称为ISR-ANT。在存在工艺变化的情况下,ISR-ANT架构的平均峰值信噪比(PSNR)在130nm IBM制程技术中比传统架构提高了1.8dB。此外,在慢角处的PSNR变化也比传统架构减少了7倍,同时实现了33%的功耗降低。
{"title":"Variation-Tolerant Motion Estimation Architecture","authors":"G. Varatkar, Naresh R Shanbhag","doi":"10.1109/SIPS.2007.4387531","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387531","url":null,"abstract":"In this paper, we study the trade-off between energy-efficiency and variation-tolerance of an error-resilient motion estimation architecture. Error-resiliency is incorporated via algorithmic noise-tolerance (ANT) where an input subsampled replica (ISR) of the main sum-of-absolute-difference(MSAD) block is employed for detecting and correcting errors in the MSAD block. This architecture is referred to as ISR-ANT. In the presence of process variations, the average peak signal-to-noise ratio (PSNR) of ISR-ANT architecture increases by up to 1.8dB over that of the conventional architecture in 130nm IBM process technology. Furthermore, the PSNR variation is also reduced by 7× over that of the conventional architecture at the slow corner while achieving a power reduction of 33%.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"2 1","pages":"126-131"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83682100","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}
引用次数: 5
Effect of Number Representation on the Achievable Minimum Number of Operations in Multiple Constant Multiplications 数表示对多重常数乘法可实现的最小运算次数的影响
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387585
L. Aksoy, Ece Olcay Günes, E. Costa, P. Flores, J. Monteiro
In this work, we analyze the effect of representing constants under binary, CSD, and MSD representations on the minimum number of operations required in a multiple constant multiplications problem. To this end, we resort to a recently proposed algorithm that computes the exact minimum solution. To extend the applicability of this algorithm to much larger instances, we propose problem reduction and model simplification techniques that significantly reduce the search space. We have conducted experiments on a rich set of instances including randomly generated and FIR filter instances. The results show that, contrary to common belief, the binary representation clearly yields better solutions than CSD, and even provides slightly better solutions than MSD. Moreover, the superiority of the binary solutions increases as the number and bit-width of the constants increase.
在这项工作中,我们分析了在二进制,CSD和MSD表示下表示常数对多常数乘法问题中所需的最小操作数的影响。为此,我们采用了最近提出的计算精确最小解的算法。为了将该算法的适用性扩展到更大的实例,我们提出了问题简化和模型简化技术,这些技术可以显着减少搜索空间。我们在一组丰富的实例上进行了实验,包括随机生成的和FIR滤波器实例。结果表明,与通常的看法相反,二进制表示明显比CSD产生更好的解,甚至比MSD提供略好的解。此外,二进制解的优越性随着常数个数和位宽的增加而增加。
{"title":"Effect of Number Representation on the Achievable Minimum Number of Operations in Multiple Constant Multiplications","authors":"L. Aksoy, Ece Olcay Günes, E. Costa, P. Flores, J. Monteiro","doi":"10.1109/SIPS.2007.4387585","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387585","url":null,"abstract":"In this work, we analyze the effect of representing constants under binary, CSD, and MSD representations on the minimum number of operations required in a multiple constant multiplications problem. To this end, we resort to a recently proposed algorithm that computes the exact minimum solution. To extend the applicability of this algorithm to much larger instances, we propose problem reduction and model simplification techniques that significantly reduce the search space. We have conducted experiments on a rich set of instances including randomly generated and FIR filter instances. The results show that, contrary to common belief, the binary representation clearly yields better solutions than CSD, and even provides slightly better solutions than MSD. Moreover, the superiority of the binary solutions increases as the number and bit-width of the constants increase.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"14 1","pages":"424-429"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86340555","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}
引用次数: 12
A New Inter-View Prediction Method for Multi-View Video Coding 一种新的多视点视频编码间视点预测方法
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387568
Zhu Gang, Yang Ping, Yun He
Multi-view Video Coding (MVC) is a fundamental encoding technique for FTV (free-viewpoint television), 3DTV (3D television) and surveillance. Efficient MVC requires coding algorithms exploiting temporal as well as inter-view dependencies between cameras. Assisted by the camera parameters the inter-view dependencies can be properly utilized. We propose in this paper a new inter-view prediction method based on camera parameters. The comparative test results based on the JSVM software platform are shown.
多视点视频编码(MVC)是一种用于自由视点电视(FTV)、3D电视(3DTV)和监控的基本编码技术。高效的MVC要求编码算法利用摄像机之间的时间依赖性和视图间依赖性。在相机参数的辅助下,可以适当地利用视图间的依赖关系。本文提出了一种新的基于摄像机参数的视界预测方法。给出了基于JSVM软件平台的对比试验结果。
{"title":"A New Inter-View Prediction Method for Multi-View Video Coding","authors":"Zhu Gang, Yang Ping, Yun He","doi":"10.1109/SIPS.2007.4387568","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387568","url":null,"abstract":"Multi-view Video Coding (MVC) is a fundamental encoding technique for FTV (free-viewpoint television), 3DTV (3D television) and surveillance. Efficient MVC requires coding algorithms exploiting temporal as well as inter-view dependencies between cameras. Assisted by the camera parameters the inter-view dependencies can be properly utilized. We propose in this paper a new inter-view prediction method based on camera parameters. The comparative test results based on the JSVM software platform are shown.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"2016 1","pages":"337-340"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86583465","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}
引用次数: 1
An Effective Algorithm for Guiding Mobile Nodes in Wireless Sensor Networks 一种有效的无线传感器网络中移动节点引导算法
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387558
G. Song, W. Zhuang, Zhigang Wei, Aiguo Song
In order to better control the mobile nodes in wireless sensor networks, an effective navigation algorithm is proposed in this paper. The static nodes are used as beacons. The methods of topology credits and TDOA (time difference of arrival) are adopted. Credits of nodes are used to create topology of the networks. Meanwhile, the TDOA method is used to calculate the distance of neighbor nodes to determine the next turning angle. Simulation and experimental results show that the proposed algorithm is effective in navigating the mobile nodes precisely to the region of interest. The comparison between the proposed algorithm and the VFF (virtual force field) method shows that the former has better performance in guiding mobile nodes in wireless sensor networks.
为了更好地控制无线传感器网络中的移动节点,本文提出了一种有效的导航算法。静态节点用作信标。采用了拓扑积分法和到达时差法。节点的积分用于创建网络的拓扑结构。同时,利用TDOA方法计算相邻节点的距离,确定下一个转弯角度。仿真和实验结果表明,该算法能够有效地将移动节点精确导航到感兴趣的区域。将该算法与虚拟力场方法进行了比较,结果表明虚拟力场方法在无线传感器网络中具有更好的引导移动节点的性能。
{"title":"An Effective Algorithm for Guiding Mobile Nodes in Wireless Sensor Networks","authors":"G. Song, W. Zhuang, Zhigang Wei, Aiguo Song","doi":"10.1109/SIPS.2007.4387558","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387558","url":null,"abstract":"In order to better control the mobile nodes in wireless sensor networks, an effective navigation algorithm is proposed in this paper. The static nodes are used as beacons. The methods of topology credits and TDOA (time difference of arrival) are adopted. Credits of nodes are used to create topology of the networks. Meanwhile, the TDOA method is used to calculate the distance of neighbor nodes to determine the next turning angle. Simulation and experimental results show that the proposed algorithm is effective in navigating the mobile nodes precisely to the region of interest. The comparison between the proposed algorithm and the VFF (virtual force field) method shows that the former has better performance in guiding mobile nodes in wireless sensor networks.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"123 1","pages":"279-282"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75743010","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}
引用次数: 4
Synthesis of DSP Architectures Using Libraries of Coarse-Grain Configurations 基于粗粒度配置库的DSP体系结构综合
Pub Date : 2007-11-21 DOI: 10.1109/SIPS.2007.4387594
P. Salmela, Chung-Ching Shen, S. Bhattacharyya, J. Takala
The implementation of real-time signal processing applications calls for parallelism to avoid unpractical clock frequencies and to lower power consumption. In this paper, a method for exploring the design space of parallel elementary computing resources is proposed. The method can be used to find a suitable set of computing resources for processors applying instruction level parallelism (ILP) or pure hardware designs. The extensive size of the design space is coped with coarse level modeling and evaluation. The method presents the system as a union of multisets of computing resources. This formulation provides a general framework for efficient, multi-objective optimization in terms of relevant cost metrics, including processing latency, area, and power consumption. We demonstrate this framework by developing a multiobjective evolutionary algorithm based on it, and applying this algorithm to a rake receiver application.
实时信号处理应用的实现需要并行性,以避免不实用的时钟频率和降低功耗。提出了一种探索并行基本计算资源设计空间的方法。该方法可用于为应用指令级并行(ILP)或纯硬件设计的处理器找到一组合适的计算资源。设计空间的庞大规模是通过粗糙的建模和评估来解决的。该方法将系统描述为多组计算资源的联合。该公式为相关成本指标(包括处理延迟、面积和功耗)方面的高效多目标优化提供了一个通用框架。我们通过开发基于该框架的多目标进化算法来演示该框架,并将该算法应用于rake接收器应用程序。
{"title":"Synthesis of DSP Architectures Using Libraries of Coarse-Grain Configurations","authors":"P. Salmela, Chung-Ching Shen, S. Bhattacharyya, J. Takala","doi":"10.1109/SIPS.2007.4387594","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387594","url":null,"abstract":"The implementation of real-time signal processing applications calls for parallelism to avoid unpractical clock frequencies and to lower power consumption. In this paper, a method for exploring the design space of parallel elementary computing resources is proposed. The method can be used to find a suitable set of computing resources for processors applying instruction level parallelism (ILP) or pure hardware designs. The extensive size of the design space is coped with coarse level modeling and evaluation. The method presents the system as a union of multisets of computing resources. This formulation provides a general framework for efficient, multi-objective optimization in terms of relevant cost metrics, including processing latency, area, and power consumption. We demonstrate this framework by developing a multiobjective evolutionary algorithm based on it, and applying this algorithm to a rake receiver application.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"48 1","pages":"475-480"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79562005","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
期刊
Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)
全部 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1