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 propose a space-time block coding framework based on linear precoding. The codes for P transmit antennas are formed by transmitting the information vector (with P independent information symbols) L times where each time it is rotated by a distinct precoding matrix. The framework generalizes conventional spatial multiplexing techniques and facilitates tradeoff between rate and diversity. We propose...
The low decoding complexity structure of Linear Dispersion Space Time Block Codes (LDSTBCs) with unitary weight matrices is analyzed. It is shown that given n = 2alpha, the maximum number of groups in which the information symbols can be separated and decoded independently is (2a + 2), and as we lower the number of different groups to (2k + 2), 0 les k les alpha, we get higher rate codes. We also...
In this paper we investigate the performance of linear interactive encoding and decoding (IED) for lossless source coding with decoder only side information. Assume that the source alphabet chi is a finite field and that the side information alphabet is finite. It is shown that there exist universal linear IED schemes which are asymptotically optimal for any stationary, ergodic source-side information...
In this paper, an idea of the cutting plane method is employed to improve the fractional distance of a given binary parity check matrix. The fractional distance is the minimum weight (with respect to lscr1-distance) of vertices of the fundamental polytope. The cutting polytope is defined based on redundant rows of the parity check matrix and it plays a key role to eliminate unnecessary fractional...
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.