检索结果-内蒙古大学图书馆

Computing running discrete hartley transform and running discrete W transforms based on the adaptive LMS algorithm

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING 1997年第3期44卷 257-260页

作者： Xi, JT Chicharo, JF UNIV WOLLONGONG DEPT ELECT & COMP ENGNWOLLONGONGNSW 2522AUSTRALIA

The computation of block-based discrete orthogonal transforms using the adaptive least-mean-square (LMS) algorithm has been studied in literature. This brief extends this work by establishing the relationship between the running discrete Hartley transform (DHT), the discrete W transforms (DWT's), and the LMS algorithm. As a result a new parallel approach for computing the running DHT and DWT's is proposed.

关键词： Discrete Hartley transform Discrete W transform LMS algorithm running algorithm

来源：评论

学校读者我要写书评

暂无评论

Computing running discrete cosine/sine transforms based on the adaptive LMS algorithm

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 1998年第1期8卷 31-35页

作者： Xi, JT Chicharo, JF Univ Wollongong Dept Elect & Comp Engn Wollongong NSW 2522 Australia

Least mean square (LMS)-based computation of block-based discrete orthogonal transforms has been extensively studied in literature [1]-[5], This paper establishes the relationship between the running discrete cosine transform II (DCT-II), discrete sine transform II (DST-II), and the adaptive LMS algorithm, From this analysis a new parallel structure for computing the running DCT-II and DST-II is proposed.

关键词： discrete cosine transform LMS algorithm running algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for running type-I and type-III discrete sine transforms

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2004年第3期E87A卷 761-763页

作者： Kober, V CICESE Dept Comp Sci Div Phys Ensenada 22860 Baja California Mexico

Fast algorithms for computing the running type-I discrete sine transform (DST-I) and type-III discrete sine transform (DST-III) are proposed. The algorithms are based on a recursive relationship between three subsequent local discrete sine spectra. The computational complexity of the algorithms is compared with that of fast DST-I and DST-III algorithms. Fast inverse algorithms for signal processing in the running discrete sine transform domains are also proposed.

关键词： fast algorithm discrete sine transform running algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast algorithms for the computation of sliding discrete Hartley transforms

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2007年第6期55卷 2937-2944页

作者： Kober, Vitaly CICESE Div Appl Phys Dept Comp Sci Ensenada 22860 Baja California Mexico

Fast algorithms for computing generalized discrete Hartley transforms in a sliding window are proposed. The algorithms are based on second-order recursive relations between subsequent local transform spectra. New efficient inverse algorithms for signal processing in a sliding window are also presented. The computational complexity of the algorithms is compared with that of known fast discrete Hartley transforms and running recursive algorithms.

关键词： discrete Hartley transform (DHT) running algorithm sliding algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast algorithms for the computation of sliding discrete sinusoidal transforms

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2004年第6期52卷 1704-1710页

作者： Kober, V CICESE Div Appl Phys Dept Comp Sci Ensenada 22860 Baja California Mexico

Fast algorithms for computing various discrete cosine transforms and discrete sine transforms in a sliding window are proposed. The algorithms are based on a recursive relationship between three subsequent local transform spectra. Efficient inverse algorithms for signal processing in a sliding window are also presented. The computational complexity of the algorithms is compared with that of known fast discrete sinusoidal transforms and running recursive algorithms.

关键词： discrete cosine transform discrete sine transform running algorithm sliding algorithm

来源：评论

学校读者我要写书评

暂无评论

An Applied Research on the algorithm by which Gateway Device Plans the Message Path in the Wireless Network

An Applied Research on the Algorithm by which Gateway Device...

引用

作者： Xunfang LIU Shuguang WU Hunan City University Modern Education Technology Center Hunan University of Technology

In the traditional industrial wireless network, the algorithm to plan the massage path in property diagnosing will appear such situations as message jamming, interference and communication capability depression when routing node seeks for the massage *** article will show a algorithm by which gateway device plans the message path in the wireless network, and analyze the shortcomings the traditional routing node has when it runs the algorithm, as well as the law of the industrial wireless network communication *** fully consider the indexes of time lapse, energy consume, reliable transmission and load balancing, it simplifies the algorithm process of the message path, also shows the specific steps of the algorithm by which gateway device plans the message path. Finally, we conduct the comparative experiments emulation twice to compare it with AODV in the aspects of dropped packets number, throughput as well as the time *** experiment manifests that the algorithm in this thesis is more useful in the industrial wireless network path planning than AODV.

关键词： Routing Node running algorithm Gateway Device Communications Volume

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：