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.
We investigate the degrees of freedom (DoF) of coexisting 2 × 2 X channel and 2 × 2 interference channel with single antenna at each node. Asymptotic interference alignment approach is used to obtain the lower bound on the DoF: (n+1)5+3n5/(n+1)5+n5 based on symbol extension model. This bound will be tight when n tends to infinity, i.e., the limit 2 of lower bound on DoF will meet the upper bound.
The transmit signal with good performance is the precondition of the excellent multiple-input and multiple-output (MIMO) synthetic aperture radar (SAR). In order to obtain waveforms of MIMO SAR based on linear frequency modulation with higher tolerance of receiver noise, the improved non-dominated sorting genetic algorithm II (NSGA-II) with elite strategy is proposed. Application of orthogonal linear...
In this paper, we investigate the security issue of a two-hop amplify-and-forward MIMO wireless relay networks in the existence of a multi-antenna eavesdropper. The optimal scheme to achieve the secrecy capacity involves a non-convex optimization and is still an open problem. Aiming to find an efficient way to enhance the secrecy rate, we propose a suboptimal joint source and relay linear precoding...
For a general MIMO interference channel, we can determine the feasibility of linear interference alignment via minimizing the leakage interference. This paper gives a complete complexity characterization of the leakage interference minimization problem. It is shown that, when each transmitter (receiver) is equipped with at least three antennas and each receiver (transmitter) is equipped with at least...
How to achieve the closed-loop processing gain is an important issue for frequency division duplexing (FDD) based multi-input multi-output (MIMO) systems, since the channel state information (CSI) is not available by reciprocity as time division duplexing (TDD). Current technique mainly uses the codebook based precoding, where the receiver feeds back the precoding matrix index (PMI) of the codebooks...
In this paper, we propose a new interference alignment (IA) scheme designing jointly the linear transmitter and receiver for the 2 user MIMO X channel system, using minimum total mean square error criterion, subject to each transmitter power constraint. Considering the channel estimation errors, we further propose a robust design for the IA. Iterative method is used to obtain the optimal solutions...
Eliminating the interferences among antennas is the first issue for effectively utilizing the spatial degree of freedoms of multiple-input multiple-output (MIMO) systems. Singular value decomposition (SVD) method plays an important role for interference elimination through a joint transceiver way, where the singular vectors are often used for linear unitary precoding (UP). However, directly applying...
The technology of antenna selection for MIMO diversity systems can keep most of the diversity gain, yet needs no more RF chains. This paper develops a rapid antenna selection method for multiple-input multiple-output (MIMO) diversity systems which use maximum ratio transmit (MRT) at the transmitter and Maximum Ratio Combine (MRC) at the receiver. In this method, at each step, a new antenna is added...
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.