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.
The authors propose a novel turbo detection scheme based on the factor graph (FG) serial-schedule belief propagation equalisation algorithm with low complexity for single-carrier faster-than-Nyquist (SC-FTN) and multi-carrier FTN (MC-FTN) signalling. In this work, the additive white Gaussian noise channel and multi-path fading channels are both considered. The iterative FG-based equalisation algorithm...
In this paper, a low-complexity turbo detection scheme based on a weighted factor graph (FG) serial-schedule (SS) belief propagation (BP) equalization method is proposed for Faster-than-Nyquist (FTN) signaling. The iterative equalization method is applied to mitigate the severe intersymbol interference (ISI) introduced by FTN signaling. In order to reduce the complexity of the equalization method,...
In order to achieve reliable communication, transmit diversity is commonly used in multiple antenna systems. Currently, to obtain transmit diversity, space-time code is usually used. In this paper, a new multiplicative transformation scheme is proposed for multiple antenna systems with non-binary low-density parity-check (LDPC) codes. It is shown that this scheme can provide transmit diversity. In...
An improved construction scheme of efficient extended irregular repeat-accumulate (eIRA) codes with easy check matrix encoding is proposed in this paper. At the dual diagonal parts of the right check matrices of the codes, the distances of the nodes are enlarged in their corresponding Tanner graphs by increasing the distances between the adjacent “1” of the matrices. Thus, the probabilities of small...
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.