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, we propose to generalize the coding schemes first proposed by Kozic & al to high spectral efficient modulation schemes. To obtain high performing coding schemes, we use a high dimensional modulo-MAP mapping process similar to the low-density generator-matrix codes (LDGM) introduced by Kozic & al. The main difference with their work is that we use an encoding and decoding process...
A general method to develop Tanner graphs from tail-biting convolutional codes (CC) is proposed. Recursive systematic convolutional (RSC) and non-RSC codes are considered consistently and it is shown that the elimination of redundant states leads to a graph with low complexity. In addition the graphical representation is extended to derive the condition for which the tail-biting termination is valid...
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.