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, a class of quasi-orthogonal space-time block codes (Q-STBC) is proposed for systems with 2 antennas and 3 time slots, where the orthogonal Alamouti code can not be applied due to the “odd symbol” problem inherited in the 3GPP frame structure. The proposed codes can achieve rate one and full diversity with lower complexity maximum likelihood detection. The design takes into consideration...
Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. The aim of LP decoding is to develop an algorithm which has error-correcting performance similar to that of the Sum-Product (SP) decoding algorithm, while at the same time it should be amenable to mathematical analysis. The LP decoding algorithm has...
In this paper, we propose a light-weight provably-secure authentication protocol called the NLHB protocol, which is a variant of the HB protocol. The HB protocol uses the complexity of decoding linear codes for security against passive attacks. In contrast, security for the NLHB protocol is proved by reducing the provably hard problem of decoding a class of nonlinear codes to passive attacks. We demonstrate...
In this paper, we construct rate compatible low density parity-check (RC-LDPC) codes from a new perspective. In traditional methods, the columns of parity-check matrix, each of which corresponds to a bit of a codeword, are deleted or added to obtain codes at various rates. Different from them, only the rows of parity-check matrix are operated in our method. Since the number of columns remains unchanged,...
Multiple antenna systems are promising approaches to increase the data rate of wireless communication systems. There, modulated symbols are multiplexed on multiple transmission antennas. Typically an outer error correcting code is used additionally to ensure a desired quality of service for a given data rate. An appropriate communications performance can be achieved by iterative decoding, where probabilistic...
Non-binary LDPC codes are now recognized as a potential competitor to binary coded solutions, especially when the codeword length is small or moderate. More and more works are reported with good performance/complexity tradeoffs, which make non-binary solutions interesting for practical applications, such as 4G-wireless systems or DVB-like systems. In this paper, we show that proposing non-binary LDPC...
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...
Motivated by the application of streaming multimedia to heterogeneous clients, in this paper we examine the problem of distributing layered content in a network. The source content is represented by multiple description layers that provide incremental refinement; a layer is useful only when all previous layers have been received. For such layered content, a distribution method based on linear network...
The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or, equivalently, the parity-check matrix representing the code. In this correspondence, we introduce the notion of dead-end sets to explicitly demonstrate this dependency. The choice of the parity-check matrix...
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.