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.
This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) algorithm for Multiple-Input Multiple-Output systems with Non-Orthogonal Multiple Access (MIMO-NOMA), in which a base station with antennas serves sources simultaneously. Both and are very large numbers and we consider the cases that $N_u>N_r$. The GMPID is based on a fully connected...
This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) method over a pairwise graph for a massive Multiuser Multiple-Input Multiple-Output (MU-MIMO) system, in which a base station with M antennas serves K Gaussian sources simultaneously. Both K and M are large numbers and we consider the cases that K < M in this paper. The GMPID is a message passing algorithm...
We show that given n and k, for q sufficiently large, there always exists an [n, k]q MDS code that has a generator matrix G satisfying the following two conditions: (C1) Sparsest: each row of G has Hamming weight n − k + 1; (C2) Balanced: Hamming weights of the columns of G differ from each other by at most one.
In a distributed MIMO system (D-MIMO), multiple base stations work in cooperation manner to enhance system throughput by suppressing inter-cell and inter-user interference. In this paper, we propose two practical distributed algorithms that are based on block diagonalization technique. The proposed schemes eliminate the need of iterative computations, and hence can be implemented without information...
In this paper, we propose a decomposition method called Generalized Multi-Unitary Decomposition (GMUD) which is useful in multi-user MIMO precoding. This decomposition transforms a complex matrix H isin Cmtimesn into H = PiRQiH, where R is a special matrix whose first row contains only a non-zero user defined value at the left-most position, Pi and Qi are a pair of unitary matrices. The major attraction...
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.