The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose a cooperative relaying scheme combining space shift keying (SSK) and transmit antenna selection (TAS), and investigate its error performance. In this scheme, source TAS is performed based on the channel fading coefficients corresponding to source-destination, source-relay and relay-destination links. SSK is applied by using the selected antennas. Moreover, a single-antenna...
This work proposes an analytical method for calculating sensitivity index. The proposed method is based on one-at-a-time measurements and calculates the difference between output values and the base solution to define the impact caused by each parameter in the system. The results indicated that the analytical method provides adequate values for the sensitivity index even when the parameters have minor...
Prefix Scan (or simply scan) is an operator that computes all the partial sums of a vector. A scan operation results in a vector where each element is the sum of the preceding elements in the original vector up to the corresponding position. Scan is a key operation in many relevant problems like sorting, lexical analysis, string comparison, image filtering among others. Although there are libraries...
Universal Filtered Orthogonal Frequency Division Multiplexing (UF-OFDM) is considered one of the main wave-form candidates to overcome the challenges facing the next generation of mobile communication systems. Due to its spectral properties it can support relaxed synchronization, low-latency communications and flexible time transmission interval. Nevertheless, the available recent literature addresses...
In the communication problem UR (universal relation), Alice and Bob respectively receive x, y ∊{0,1\}^n with the promise that x≠ y. The last player to receive a message must output an index i such that x_i≠ y_i. We prove that the randomized one-way communication complexity of this problem in the public coin model is exactly \Theta(\min\{n,\log(1/δ)\log^2(\frac...
For any n-bit boolean function f, we show that the randomized communication complexity of the composed function f o g^n, where g is an index gadget, is characterized by the randomized decision tree complexity of f. In particular, this means that many query complexity separations involving randomized models (e.g., classical vs. quantum) automatically imply analogous separations in communication complexity.
Sparse code multiple access (SCMA) is a nonorthogonal multiple access scheme based on a multi-dimensional codebook with sparse codewords. The sparsity property of SCMA allows the receiver to take advantage of low-complexity message passing algorithm (MPA) detector with maximum likelihood (ML)-like performance. The use of multiple antennas at the SCMA receiver will improve the detection performance...
In recent years, numbers of non-orthogonal multiple access (NOMA) schemes have been proposed to support the great amounts of wireless connections. However, complex multi-user detection is needed in case that the user power differentiation is not available and simple successive interference cancellation cannot directly apply, which usually incurs unaffordable computational complexity. In this paper,...
As an alternative to classical multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM), MIMO-OFDM with index modulation (MIMO-OFDM-IM), which provides a flexible trade-off between spectral efficiency and error performance, has attracted considerable interest recently. However, in order to detect the active subcarrier indices and modulated symbols precisely, the receiver...
In this paper a Markov decision process (MDP) model for virtualized content delivery networks is proposed. We use stochastic optimization to assign cloud site resources to each user group. We propose how quality of experience (QoE) can be included in the modeling and optimization. We then present an optimal solution for a constraint-free version of the problem, and show the improvement in accumulated...
In this paper, the principle of density evolution (DE) combined with the normalized minimum-sum (NMS) decoding process is explored. It is demonstrated that with one properly chosen parameters for NMS algorithm, then almost the same behaviour of sum-product (SP) algorithm is achieved. As well, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation...
Progressive edge-growth (PEG) algorithm was proven to be a simple and effective approach to design good LDPC codes. However, the low-density parity-check (LDPC) constructed by PEG algorithm is of a single code rate. In this paper, we propose a modified PEG algorithm to construct multiple-rate LDPC codes, which is referred to as the multiple-rate PEG (MR-PEG) algorithm. The obtained LDPC codes with...
This paper presents a technique of adaptive digital predistortion (DPD) with a memory effect for linearization a high power amplifier (HPA). The proposed predistortion linearizer is based on Look-Up tables (LUTs) with linear interpolation and adaptive segmentation. Simulation results with a lab signal of 40W dual-band HPA with memory effect show that the proposed technique achieves a better performance...
With the rapid development of educational information, the market demand for early childhood education software is increasing. But the evaluations of early childhood education softwares have fallen behind the development of software products. In this paper, we take the United States Haugland / Shade as evaluation criteria to evaluate those Apps with great download amount and with better feedbacks...
This paper analyzes the performance of multicarrier index modulation (MCIM) with greedy detection (GD) in a dual hop, multiple decode and forward (DF) relay network. We propose a novel partial relay selection (PRS) technique combined with index modulation and its energy detection. For performance analysis, we derive novel closed form solutions for both the average pairwise error probability (PEP)...
We are interested in an easy combinatorial optimization problem having several applications in the real world, namely the matrix chain product problem that may be solved by a well known dynamic programming algorithm (DPA). Our contribution is two-fold. It first consists in the design of an approach based on the DPA for the determination of multiple optimal solutions i.e. optimal parenthesizations...
In this paper, we propose a novel lattice reduction (LR) algorithm for the low-complexity multiple-input multiple-output (MIMO) detection with near-maximum-likelihood (ML) performance. The proposed LR algorithm is designed considering both the hardware complexity and the power consumption. First, a modified column traverse strategy is proposed to reduce the worst-case complexity (hardware complexity)...
We discuss theoretical aspects of sparse representations for videos by linear splines over anisotropic tetrahedralizations. In previous work, we have proposed a locally adaptive algorithm, adaptive thinning, for sparse approximation of images. Moreover, we have analyzed the asymptotic behaviour of N-term image approximations by linear splines over anisotropic Delaunay triangulations. In this paper,...
Characterizing the smart growth of a landscape in terms of the change pattern evolved in the region has been the focus of study for quite some time. The characterization of the growth of a region is essential for officials and city planners for the sake of planning and management perseverance. This paper attempts to characterize the smart growth of a region through landscape metrics. The traditional...
We show an application of Moran's Index to process and analyze the waterbody-spread extracted from remotely sensed data. A method that is employed to quantify division-wise waterbody-spread, district-wise waterbody-spread and taluk-wise waterbody-spread spatial complexity is based on Moran's Index computation. The waterbody-spread data for each of the hierarchically partitioned geographical unit-wise...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.