Verification of processors with high performance is becoming more and more time-consuming and even gradually turning into the bottleneck of the processor design. The Verification of Reconfiguralbe Multimedia Array Pro...
详细信息
Optimum partial transmit sequence method (OPTS), as one of the highest-performance PAPR reduction techniques, has very high computational complexity. Most sub-optimal schemes which are based on iterative PTS (IPTS), a...
详细信息
Quantitative complexity of network coding as well as its computation delay on a node is presented in this paper. First, quantitative complexity of four fundamental calculation operations were analyzed. Based on that, ...
详细信息
ISBN:
(纸本)9781424443376
Quantitative complexity of network coding as well as its computation delay on a node is presented in this paper. First, quantitative complexity of four fundamental calculation operations were analyzed. Based on that, quantitative complexity of encoding, decoding as well as independence detection for network coding were given theoretically. At last, the experimental results showed our quantitative results of computation delay have the same order to the delay of practical network coding on a node.
In this paper, we propose a novel load-balanced scheme - split aggregated flow (SAF) and design the buffering mechanism for two-stage self-routing switch. By grouping the signal lines with concentrators, the proposed ...
详细信息
ISBN:
(纸本)9781424443376
In this paper, we propose a novel load-balanced scheme - split aggregated flow (SAF) and design the buffering mechanism for two-stage self-routing switch. By grouping the signal lines with concentrators, the proposed scheme can obtain the statistical multiplex gain and reduce the complexity of computation. The mathematical analysis and simulations show that 100% throughput can be achieved for any admissible traffic pattern. Compared with other load-balancing schemes used crossbar as the basic fabric, this scheme has the distinctive advantages including the lowest complexity buffer of O(N), low queuing delay O(1), and free from the out-of-sequence problem. These properties make it practicably suitable for very large scale switching structures in Next Generation Network (NGN).
In OFDM system, because of sensitivity to carrier frequency offset, frequency offset must be compensated before DFT in the receiver. In this paper, we present a maximum likelihood estimation for carrier frequency offs...
详细信息
ISBN:
(纸本)9957486004
In OFDM system, because of sensitivity to carrier frequency offset, frequency offset must be compensated before DFT in the receiver. In this paper, we present a maximum likelihood estimation for carrier frequency offset, based on OFDM symbol has no virtual sub-carriers. The estimation are compose of two parts, blind estimation makes use of cyclic prefix for every symbol and data-aid estimation makes use of two consequent OFDM symbols which are similar or relative to each other. Data-aid estimation performs well and simulation result converges upon Cramer-Rao lower bound. Blind estimation performs inferior, but it can be used in tracking mode.
暂无评论