Search results for "Communication channel"
showing 10 items of 349 documents
Charge Noise in Organic Electrochemical Transistors
2017
Organic electrochemical transistors (OECTs) are increasingly studied as transducers in sensing applications. While much emphasis has been placed on analyzing and maximizing the OECT signal, noise has been mostly ignored, although it determines the resolution of the sensor. The major contribution to the noise in sensing devices is the 1/f noise, dominant at low frequency. In this work, we demonstrate that the 1/f noise in OECTs follows a charge-noise model, which reveals that the noise is due to charge fuctuations in proximity or within the bulk of the channel material. We present the noise scaling behavior with gate voltage, channel dimensions and polymer thickness. Our results suggest the …
On Equivalent Random Traffic method extension
2011
The key result of the paper is the Equivalent Random Traffic (ERT) method extension for estimation of the throughput for schemes with traffic splitting. The excellent accuracy (relative error is less than 1%) is shown in numerical example. A numerical algorithm is given — how to estimate the throughput for schemes at traffic splitting and merging. The paper also contains new Erlang-B formula algorithm for non-integer number of channels based on parabolic approximation.
Combined K-Best sphere decoder based on the channel matrix condition number
2008
It is known that sphere decoding (SD) methods can provide maximum-likelihood (ML) detection over Gaussian MIMO channels with lower complexity than the exhaustive search. Channel matrix condition number represents an important influence on the performance of usual detectors. Throughout this paper, two particular cases of a SD method called K-Best carry out a combined detection in order to reduce the computational complexity with predictable performance degradation. Algorithm selection is based on channel matrix condition number thresholding. K-Best is a suboptimal SD algorithm for finding the ML solution of a detection problem. It is based on a fixed complexity tree search, set by a paramete…
Power allocation in multi-channel cognitive radio networks with channel assembling
2011
Accepted version of a paper in the book: 2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). Published version available from the IEEE:http://dx.doi.org/10.1109/SPAWC.2011.5990485 Consider power allocation for Secondary User (SU) packet transmissions over multiple channels with variable Primary User (PU) arrival rates in cognitive radio networks. Two problems are studied in this paper: The first one is to minimize the collision probability with PUs and the second one is to maximize the data rate while keeping the collision probability bounded. It is shown that the optimal solution for the first problem is to allocate all power onto the bes…
Energy-Efficient Resource Allocationin for D2D Enabled Cellular Networks
2020
Energy-efficiency (EE) is critical for D2D enabled cellular networks due to limited battery capacity and severe co-channel interference. In this chapter, we address the EE optimization problem by adopting a stable matching approach. The NP-hard joint resource allocation problem is formulated as a one-to-one matching problem under two-sided preferences, which vary dynamically with channel states and interference levels. A game-theoretic approach is employed to analyze the interactions and correlations among user equipments (UEs), and an iterative power allocation algorithm is developed to establish mutual preferences based on nonlinear fractional programming. We then employ the Gale–Shapley …
Greedy versus Dynamic Channel Aggregation Strategy in CRNs: Markov Models and Performance Evaluation
2011
Part 1: - PE-CRN 2011 Workshop; International audience; In cognitive radio networks, channel aggregation techniques which aggregate several channels together as one channel have been proposed in many MAC protocols. In this paper, we consider elastic data traffic and spectrum adaptation for channel aggregation, and propose two new strategies named as Greedy and Dynamic respectively. The performance of channel aggregation represented by these strategies is evaluated using continuous time Markov chain models. Moreover, simulation results based on various traffic distributions are utilized in order to evaluate the validity and preciseness of the mathematical models.
Distributed Resource Allocation in Underlay Multicast D2D Communications
2021
Multicast device-to-device communications operating underlay with cellular networks is a spectral efficient technique for disseminating data to nearby receivers. However, due to the critical challenge of having an intelligent interference coordination between multicast groups along with the cellular network, it is necessary to judiciously perform resource allocation for the combined network. In this work, we present a framework for a joint channel and power allocation strategy to maximize the sum rate of the combined network while guaranteeing minimum rate to individual groups and cellular users. The objective function is augmented by an austerity function that penalizes excessive assignmen…
Reliable Multicast D2D Communication Over Multiple Channels in Underlay Cellular Networks
2020
Multicast device-to-device (D2D) communications operating underlay with cellular networks is a spectral efficient technique for disseminating data to the nearby receivers. However, due to critical challenges such as, mitigating mutual interference and unavailability of perfect channel state information (CSI), the resource allocation to multicast groups needs significant attention. In this work, we present a framework for joint channel assignment and power allocation strategy to maximize the sum rate of the combined network. The proposed framework allows access of multiple channels to the multicast groups, thus improving the achievable rate of the individual groups. Furthermore, fairness in …
Non-dominated “trade-off” solutions in television scheduling optimization
2014
The main approaches for the television scheduling design are commonly based on the ratings or revenues maximization objective, and thus, only a single optimal solution can be obtained, corresponding to the best result for the considered objective. Therefore, these approaches lead up to the alternative solutions loss which, even if less effective from the ratings or revenues maximization viewpoint, may be more suitable for the decision maker because of better compromise in relation to factors influencing the decision process. Specifically, such a compromise could be achieved through a suitable “trade-off” between these factors, with reference to the decision context in which the decision mak…
Designing Paper Machine Headbox Using GA
2003
Abstract A non-smooth biobjective optimization problem for designing the shape of a slice channel in a paper machine headbox is described. The conflicting goals defining the optimization problem are the ones determining important quality properties of produced paper: 1) basis weight should be even and 2) the wood fibers of paper should mainly be oriented to the machine direction across the width of the whole paper machine. The novelty of the considered approach is that maximum deviations are used instead of least squares when objective functions are formed. For the solution of this problem, a multiobjective genetic algorithm based on nondominated sorting is considered. The numerical results…