Cognitive Radio Networks (CRNs) is a promising innovation which empowers unlicensed users (secondary users) to fill spectrum gaps and modify its CR device parameters as expected to utilize free channels without creati...
详细信息
Multiparty cloud video conferencing architecture has been recently advocated to exploit rich computing and bandwidth resources in the cloud to effectively improve video conferencing performance. As a typical design in...
详细信息
We present a pseudo-deterministic NC algorithm for finding perfect matchings in bipartite graphs. Specifically, our algorithm is a randomized parallel algorithm which uses poly(n) processors, poly(log n) depth, poly(l...
详细信息
One of the main issues in wireless sensor networks (WSNs) is energy consumption. Normally, sensors are battery powered and in many applications it is impossible to recharge them. Proactive routing protocols are mainly...
详细信息
Dynamic networks are characterized by frequent topology changes due to the unpredictable appearance and disappearance of mobile devices and/or communication links. In this paper, we propose a correct-by-construction a...
详细信息
In the research of modern communication technology, researchers pay more attention to the new communication system and digital signal processing technology which can improve the data processing speed, data transmissio...
详细信息
In the research of modern communication technology, researchers pay more attention to the new communication system and digital signal processing technology which can improve the data processing speed, data transmission speed and transmission quality and system capacity. In this paper, the author makes an optimization method for signal processing parallel algorithm in communication system by using neural network model. With the introduction of neural network technology, the parallel algorithm of signal processing can be improved to a certain extent. Simulation results shows that dynamic adaptive decoding is more effective, and it is possible to dynamically correct the symbol offset in real time and dynamically search each pattern symbol, that to make maximizeuse of information.
Tag anticollision is critical to the performance of many radio frequency identification systems in industrial applications. Tree-based schemes are popular arbitration algorithms for tag collision, as they are scalable...
详细信息
Tag anticollision is critical to the performance of many radio frequency identification systems in industrial applications. Tree-based schemes are popular arbitration algorithms for tag collision, as they are scalable and easy to implement. In these schemes, collided tags are recursively divided into two groups until each group contains only one tag. However, we have determined that previous pure tree-based schemes do not fully utilize the information that can be collected;they allow only the responding tags to be involved in the splitting process. In this paper, we propose a novel pure tree-based method that we named parallel splitting with retrieve (PSR), which allows both the nonresponding and unidentified tags to also be involved in the splitting process. PSR consists of two mechanisms: parallel splitting (PS) and retrieve. The PS mechanism can reduce the total number of tag collisions and the retrieve mechanism can reduce the extra idle slots caused by PS. In comparison with conventional pure tree-based schemes, the proposed PSR algorithm achieves higher efficiency without the need to estimate the number of tags;simulation results indicate an efficiency level of 0.41. The PSR algorithm also has similar performance to state-of-the-art algorithms that do not need to estimate the number of tags, but it is simpler to implement and is thus preferred for resource constrained systems.
The Hamming code is a well-known error correction code and can correct a single error in an input vector of size n bits by adding log n parity checks. A new parallel implementation of the code is presented, using a hi...
详细信息
The Hamming code is a well-known error correction code and can correct a single error in an input vector of size n bits by adding log n parity checks. A new parallel implementation of the code is presented, using a hierarchical structure of n processors in log n layers. All the processors perform similar simple tasks, and need only a few bytes of internal memory.
In this paper, we focus on applying parallel processing techniques to HEVC encoder in order to significantly reduce the computational power requirements without disturbing its coding efficiency. So, we propose several...
详细信息
In this paper, we focus on applying parallel processing techniques to HEVC encoder in order to significantly reduce the computational power requirements without disturbing its coding efficiency. So, we propose several, synchronous and asynchronous, parallelization approaches working at a coarse grain parallelization level, based on the Group Of Pictures (GOP), which we call GOP-based level. GOP -based approaches encode simultaneously several groups of consecutive frames. Depending on how these GOPs are conformed and distributed it is critical to obtain good parallel performance. The results show that near ideal efficiencies are obtained using up to 10 cores. Furthermore, when the computational load is unbalanced, the asynchronous versions outperform the synchronous ones. The parallel algorithms developed in this work support all standard coding modes proposed by the reference software. (C) 2016 Civil-Comp Ltd. and Elseider Ltd. All rights reserved.
A parallel algorithm for prefix computation on N data elements mapped on a Multi Mesh (MM) network of N = n(4) processing elements is presented here. The time required by the proposed algorithm is significantly less t...
详细信息
A parallel algorithm for prefix computation on N data elements mapped on a Multi Mesh (MM) network of N = n(4) processing elements is presented here. The time required by the proposed algorithm is significantly less than that by any of the existing algorithms for prefix computation on mesh-like architectures due to the specific interconnection pattern used in the MM network. The proposed technique requires O(N-1/4) time for data communication and O(logN(1/4)) time for computation, when mapped on a MM network constituted by N-1/2 meshes, each of size N-1/4 x N-1/4. The data communication time in the proposed algorithm is less than the prefix sum algorithm proposed in extended Multi Mesh. To be precise, instead of (13N(1/4) - 5) tau communication time the proposed algorithm requires a data communication time of 7.5N(1/4) t only. Moreover, the proposed parallel algorithm does not need any extra inter block links as used in the extended Multi Mesh.
暂无评论