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.
MIMO communication has been recognized as a potential solution for high speed underwater acoustic communication, which unfortunately encounters significant difficulties posed by simultaneous presence of multipath and Co-channel interference (CoI). Sparsity contained in the multipath structure of underwater acoustic channels offers an effective way for improving channel estimation quality and thus...
In this paper a diagonal cyclotomic space-time coding (DCSTC) transmission scheme for wireless cooperative relay networks is proposed. We consider the full-duplex cooperation which is more spectrally efficient than the half-duplex cooperation. By the combination of multidimensional complex constellation symbols rotation and Hadamard transform, the proposed scheme is capable of achieving full cooperative...
The Korkine—Zolotareff (KZ) reduced basis is considered as the best reduced basis for use in data decoding in multiple-input multiple-output (MIMO) communication systems. In this paper, we present an improved KZ algorithm for direct application in reducing a complex lattice basis. The enumeration algorithm, which is the dominant contributor to the main cost of the KZ algorithm, is also modified for...
Based on the well known Lenstra Lenstra Lovász (LLL) algorithm, we propose a possible swap LLL algorithm (P-SLLL) for lattice reduction aided (LRA) MIMO detection in this paper. The reduction process of the new algorithm is modified by searching for the next column swap through the whole basis, instead of the sequential implementation in the original LLL algorithm. Two different searching criteria...
We propose a variant of the well-known Lenstra, Lenstra, Lovász algorithm (LLL) for MIMO detection in this paper, which is called random selection LLL (RSLLL). Not like the original LLL algorithm which sequentially searches through the whole basis, the new algorithm takes a random selection of the next pair of columns for LLL reduction. The proposed algorithm is proved to finish within finite number...
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.