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 performance of cognitive spectrum sharing systems with opportunistic relay selection over Nakagami-m fading is analyzed in the presence of multiple primary users (PUs). In particular, we derive an exact closed-form expression for the outage probability (OP) of the considered cognitive relay systems under the joint impact of maximal transmit power Pt at secondary transmitter and peak interference...
We introduce a family of sparse random linear network codes with outer-code. Due to the bold role of the incomplete gamma function in their design, we call these codes “Gamma codes”. We show that Gamma codes outperform all the existing linear-complexity network coding solutions in terms of reception overhead, while keeping the encoding and decoding complexity linear in the block length.
In this paper we study the problem of transmitting different quality of service (QoS) data classes on a broadcast erasure channel where each data class is intended for a group of users depending on their erasure rate. For real-time applications such as multimedia, data block length is typically small. Over a small data block length, the behavior of the erasure channel may significantly differ from...
Based on a new vision of the inactivation decoding process, we set a new degree distribution design criterion for the LT part of Raptor codes. Under an infinite block length assumption, a family of degree distributions that satisfy the new design criterion is analytically derived. The finite length performance of this family is investigated by using computer simulations and is shown to outperform...
In this paper, an extension of raptor codes is introduced which keeps all the desirable properties of raptor codes, including the linear complexity of encoding and decoding per information bit, unchanged. The new design, however, improves the performance in terms of the reception rate. Our simulations show a 10% reduction in the needed overhead at the benchmark block length of 64,520 bits and with...
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.