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.
Nonorthogonal multiuser coding is an essential technique for superimposed transmission and improving spectrum efficiency of future wireless communication networks. In this paper, a low-complexity nonorthogonal coding scheme, called multiuser repetition-aided irregular repeat-accumulate (IRA) code, is proposed for a multiple access channel (MAC), and the scheme can be applied to fifth-generation (5G)...
A very simple coding scheme, called multi-user repetition-aided irregular repeat-accumulate (IRA) code, is proposed to approach the multiple-access channel (MAC) capacity. The main idea is that not only parity checks, which are generated by an IRA encoder, but also repetitions are used in each user's codeword to reduce the coding and decoding complexities. Repetition is a simple way to construct a...
A K-user nonbinary parallel concatenated code (PCC) is proposed for a Gaussian MAC with symbol synchronization, equal-power, and equal-rate users. In a K-user q-ary PCC over finite field GF(q), each user employs a parallel concatenated code, with a rate-(1/r) q-ary repetition component code and M rate-1 q-ary accumulation component codes. Employing q-ary repetition code is to overcome the multi-user...
A low-complexity two-user turbo decoding scheme for two-way relay network is proposed. In the relay, the superimposed packets have to be decoded to the arithmetic summation of two source packets based on the sum trellis. In the sum trellis, there are some symmetrical states, especially when the sources use identical component codes. These symmetrical states provide same information to the turbo decoder...
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.