Implementation and Evaluation of an NoC Architecture for FPGAs

The Networks-on-Chip (NoC) approach for designing Systems-on-Chip (SoC) is currently emerging as an advanced concept for overcoming the scalability and efficiency problems of traditional bus-based systems. A great deal of theoretical research has been done in this area that provides good insight and shows promising results. There is a great need for research in hardware implementation of NoC-based systems to determine the feasibility of implementing various topologies and protocols, and also to accurately determine what design tradeoffs are involved in NoC implementation. This thesis addresses the challenges of implementing an NoC-based system on FPGAs for running real benchmark applications. The NoC used a mesh topology and circuit-switched communication protocol. An experimental framework was developed that allowed implementation of NoC-based system from a high level specification, using the Celoxica Handel-C hardware description language. Two test applications: charged couple device (CCD) and JPEG were developed in Handel-C to be used as our benchmark applications. Both benchmarks are computational expensive and require large quantities of data transfer that will test the NoC system. Implementation results show that the NoC-based system gives superior area utilization and speed performance compared to the bus-based system, running the same benchmarks

On well-posedness of piecewise affine bimodal dynamical systems

Çamlıbel, Mehmet Kanat (Dogus Author) -- Conference full title: 19th International Symposium on Mathematical Theory of Networks and Systems – MTNS 2010, 5–9 July, 2010, Budapest, Hungary.The theory of differential inclusions provides certain sufficient conditons for the uniqueness of Filippov solutions such as one-sided Lipschitzian property or maximal monotone condition. When applied to piecewise affine dynamical systems, these conditions impose rather strong conditions. In this paper, we provide less restrictive conditions for uniqueness of Filippov solutions for the bimodal piecewise affine systems

Study on transmission over Nakagami-m fading channel for multiple access scheme without orthogonal signal

In this paper, a downlink performance in non-orthogonal multiple access (NOMA) system is considered. With regard to different priority for two NOMA users, we exploit the closed-form expressions of outage probability over wireless fading channel following Nakagami-m fading. The fixed power allocation factor scheme is examined to reduce the complexity in computation regarding performance analysis. In our analysis, perfect successive interference cancellation (SIC) is applied in order to achieve perfect signal decoding operation. Simulation results show that the considered NOMA downlink scheme is affected by transmit SNR, power allocation factors, fading parameters

Enabling full-duplex in multiple access technique for 5G wireless networks over Rician fading channels

Nowadays, unmanned aerial vehicle (UAV) relays’assisted Internet of Things (IoT) systems provide facility in order to overcome the large scale fading between source and sink. The full-duplex scheme enables wireless network to provide higher spectrum efficient technology. This paper analyses performance of two users which are served by new emerging non-orthogonal multiple access (NOMA) technique. Exact outage probability of such two users are derived and checked via Monte-Carlo simulation. These analytical results provide guideline to design UAV in real application. This paper provides a comprehensive study to examine impact of interference, fixed power allocation factors to system performance

Outage and throughput performance of cognitive radio based power domain based multiple access

This paper considers power domain based multiple access (PDMA) in cognitive radio network to serve numerous users who intend to multiple access to core network. In particular, we investigate the effect of signal combination scheme equipped at PDMA end-users as existence of direct link and relay link. This system model using relay scheme provides performance improvement on the outage probability of two PDMA end-users. We first propose a simple scheme of fixed power allocation to PDMA users who exhibit performance gap and fairness. Inspired by PDMA strategy, we then find signal to noise ratio (SNR) to detect separated signal for each user. In addition, the exact expressions of outage probability are derived in assumption that receiver can cancel out the interference completely with successive interference cancellation (SIC). By exploiting theoretical and simulation results, both considered combination schemes (Maximal Ratio Combining (MRC) and Selection Combining (SC) can achieve improved performance of two PDMA users significantly

Bounded Guaranteed Algorithms for Concave Impurity Minimization Via Maximum Likelihood

Partitioning algorithms play a key role in many scientific and engineering disciplines. A partitioning algorithm divides a set into a number of disjoint subsets or partitions. Often, the quality of the resulted partitions is measured by the amount of impurity in each partition, the smaller impurity the higher quality of the partitions. In general, for a given impurity measure specified by a function of the partitions, finding the minimum impurity partitions is an NP-hard problem. Let $M$ be the number of $N$-dimensional elements in a set and $K$ be the number of desired partitions, then an exhaustive search over all the possible partitions to find a minimum partition has the complexity of $O(K^M)$ which quickly becomes impractical for many applications with modest values of $K$ and $M$. Thus, many approximate algorithms with polynomial time complexity have been proposed, but few provide bounded guarantee. In this paper, an upper bound and a lower bound for a class of impurity functions are constructed. Based on these bounds, we propose a low-complexity partitioning algorithm with bounded guarantee based on the maximum likelihood principle. The theoretical analyses on the bounded guarantee of the algorithms are given for two well-known impurity functions Gini index and entropy. When $K \geq N$, the proposed algorithm achieves state-of-the-art results in terms of lowest approximations and polynomial time complexity $O(NM)$. In addition, a heuristic greedy-merge algorithm having the time complexity of $O((N-K)N^2+NM)$ is proposed for $K<N$. Although the greedy-merge algorithm does not provide a bounded guarantee, its performance is comparable to that of the state-of-the-art methods. Our results also generalize some well-known information-theoretic bounds such as Fano's inequality and Boyd-Chiang's bound.Comment: 13 pages, 6 figure