Description: 用verilog 代码编写的179阶FIR数字滤波器，采用分布式算法实现-verilog code used to prepare the 179 band FIR digital filters, using Distributed Algorithms Platform: |
Size: 950 |
Author:a |
Hits:
Description: 用verilog 代码编写的179阶FIR数字滤波器，采用分布式算法实现-verilog code used to prepare the 179 band FIR digital filters, using Distributed Algorithms Platform: |
Size: 1024 |
Author:a |
Hits:
Description: 2007年最新的多种路径规划算法的仿真软件包。At the later releases more world models and sample planners will be distributed, for now only a few world models and controllers are uploaded within this package.
Press Start to start the simulation.
Enjoy :)
A better tutorial will be prepared soon about using the simulator and adding new algorithms etc.
-In 2007 a variety of the latest path planning algorithm for the simulation package. At the later releases more world models and sample planners will be distributed, for now only a few world models and controllers are uploaded within this package.Press Start to start the simulation. Enjoy:) A better tutorial will be prepared soon about using the simulator and adding new algorithms etc. Platform: |
Size: 461824 |
Author:闫林 |
Hits:
Description: MATLAB对11中调度算法进行比较，包括min-min、max-min、遗传算法等等。-MATLAB to 11 in comparison scheduling algorithm, including the min-min, max-min, genetic algorithms and so on. Platform: |
Size: 292864 |
Author:gourd |
Hits:
Description: 『下载说明』这里提供给大家的是《Distributed Algorithms》（分布式算法）英文版的PDF格式电子书下载。-』『 Download available to everyone here is Distributed Algorithms (Distributed algorithm) English version of the PDF format e-book download. Platform: |
Size: 1747968 |
Author:li |
Hits:
Description: 基于分布式算法的FPGA实现的FIR滤波器源码，VHDL语言编写的，下载工程文件后可直接在QuartusII7.0上运行。-Based on Distributed algorithms realize the FIR filter FPGA source code, VHDL language, download the project file can be run directly in QuartusII7.0. Platform: |
Size: 531456 |
Author:CH |
Hits:
Description: 并行计算领域最著名书籍之一DISTRIBUTED SYSTEMS PRINCIPLES AND PARADIGMS的课后题答案，包括很多算法的经典讲解，是入门并行体系结构的好参考资料-The field of parallel computing, one of the most famous books DISTRIBUTED SYSTEMS PRINCIPLES AND PARADIGMS answer questions after-school, including many classic on algorithms, Introduction to parallel architecture is a good reference Platform: |
Size: 168960 |
Author:薛佟佟 |
Hits:
Description: This course is about "distributed algorithms".Distributed algorithms include a wide range of parallel algorithms,which can be classified by a variety of attributes.-This course is about distributed algorithms . Distributed algorithms include a wide range of parallel algorithms, which can be classified by a variety of attributes. Platform: |
Size: 1747968 |
Author:aple |
Hits:
Description: 现代通信系统书籍仿真程序，不错的程序
供初学习者使用-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative
scheme that implements the idea of compress-and-forward. Through the exploitation of efficient
distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of
Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this
paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular
DSC technologies: the binning/syndrome approach and the parity approach. We show that the
latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain
performance advantages, and enables any (system) linear channel code to be readily exploited.
Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck
codes are demonstrated and practical algorithms for estimating the source-relay correlation
and for decoding the compound packets Platform: |
Size: 9216 |
Author:史志举 |
Hits:
Description: 现代通信系统书籍底八章仿真程序，很好的程序，初学习这很好的教材-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative
scheme that implements the idea of compress-and-forward. Through the exploitation of efficient
distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of
Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this
paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular
DSC technologies: the binning/syndrome approach and the parity approach. We show that the
latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain
performance advantages, and enables any (system) linear channel code to be readily exploited.
Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck
codes are demonstrated and practical algorithms for estimating the source-relay correlation
and for decoding the compound packets Platform: |
Size: 9216 |
Author:史志举 |
Hits:
Description: 现代通信原理第九章程序代码，不错的程序，初学习者很好的程序-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative
scheme that implements the idea of compress-and-forward. Through the exploitation of efficient
distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of
Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this
paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular
DSC technologies: the binning/syndrome approach and the parity approach. We show that the
latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain
performance advantages, and enables any (system) linear channel code to be readily exploited.
Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck
codes are demonstrated and practical algorithms for estimating the source-relay correlation
and for decoding the compound packets Platform: |
Size: 7168 |
Author:史志举 |
Hits:
Description: 现代通信原理第十章程序代码，不错的程序，初学习者很好的程序-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative
scheme that implements the idea of compress-and-forward. Through the exploitation of efficient
distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of
Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this
paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular
DSC technologies: the binning/syndrome approach and the parity approach. We show that the
latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain
performance advantages, and enables any (system) linear channel code to be readily exploited.
Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck
codes are demonstrated and practical algorithms for estimating the source-relay correlation
and for decoding the compound packets Platform: |
Size: 1021952 |
Author:史志举 |
Hits:
Description: 协作通信中的压缩转发技术是现在比较先进的技术，这个文件夹里的文章是学习这个技术的不错的文章-The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative
scheme that implements the idea of compress-and-forward. Through the exploitation of efficient
distributed source coding (DSC) technology, the authors of [1] demonstrate the effectiveness of
Slepian-Wolf cooperation in combating inter-user channel outage in wireless environment. In this
paper, we discuss the general framework of Slepian-Wolf cooperation using the two most popular
DSC technologies: the binning/syndrome approach and the parity approach. We show that the
latter is particularly useful in SW cooperation, since it is conceptually simpler, provides certain
performance advantages, and enables any (system) linear channel code to be readily exploited.
Examples using convolutional codes, low-density generator-matrix codes and low-density paritycheck
codes are demonstrated and practical algorithms for estimating the source-relay correlation
and for decoding the compound packets Platform: |
Size: 2814976 |
Author:史志举 |
Hits:
Description: 有一个停车场，有m个进口，n个出口，k个空车位。要求每一刻只能有一个进口有车进入。停车场内没有一个集中的管理者，采用分布式的算法实现。能够动态的增加一个进口节点。-There is a parking lot, there are m-imported, n outlet, k empty parking spaces. Requires that every moment there can be only one import a car to enter. Car park does not have a centralized manager, using distributed algorithms. Be able to dynamically add a node imports. Platform: |
Size: 28672 |
Author:秦佳佳 |
Hits:
Description: Our contribution here is to design efficient distributed algorithms
for the maximum flow problem. The idea behind our distributed
version of highest-label preflow-push algorithm is to disseminate label
values together with safety information every node. When the algorithm
terminates, the computed flow is stored distributedly in incident
nodes for all edges, that is, each node knows the values of flow which belong
to its adjacent edges. We compute maximum flow in O(n 2 log 3 n)
time with communication complexity O(n2(log 3 n + V~)), where n and
m are the number of nodes and edges respectively in a network graph.-Our contribution here is to design efficient distributed algorithms
for the maximum flow problem. The idea behind our distributed
version of highest-label preflow-push algorithm is to disseminate label
values together with safety information every node. When the algorithm
terminates, the computed flow is stored distributedly in incident
nodes for all edges, that is, each node knows the values of flow which belong
to its adjacent edges. We compute maximum flow in O(n 2 log 3 n)
time with communication complexity O(n2(log 3 n+ V~)), where n and
m are the number of nodes and edges respectively in a network graph. Platform: |
Size: 402432 |
Author:yangs |
Hits:
Description: text book for reliable distributed programming(Guerraoui and Rodrigues present an introductory description of fundamental reliable distributed programming abstractions as well as algorithms to implement these abstractions. The book can also be used as a complete reference on the basic elements required to build reliable distributed applications.) Platform: |
Size: 1909760 |
Author:chestnutme
|
Hits:
Search - DISTRIBUTED ALGORITHMS