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 r...
详细信息
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.
作者：
Kober, VitalyCICESE
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 effi...
详细信息
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.
作者：
Kober, VCICESE
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 subseque...
详细信息
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.
作者：
Kober, VCICESE
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 trans...
详细信息
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.
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 t...
详细信息
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.
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 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.
暂无评论