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.
Molecular communication is the most promising approach for the communication in nanonetwork. However, the reliability of existing system degrades rapidly when the distance between transmitter and receiver increases. In this paper, we propose and evaluate a cooperative molecular communication solution that uses signal repeating to improve system reliability. The system has low complexity. Simulation...
We examine secret communication over interference channels, starting with a model in which communication is semi-secret in that secrecy may depend on other transmitters to follow an agreed-upon signaling strategy. We compare this to robustly-secret communication, in which each user must allow for other users to deviate unilaterally from an agreed-upon strategy to enable better overhearing, as long...
3D contactless technology based on capacitive coupling represents a promising solution for high-speed and low power signaling in vertically integrated chips. AC coupled interconnects do not suffer from mechanical stress, and the parasitic load is much reduced when compared to standard DC solutions, such as wire bonding and micro bumps. Communication system based on wireless interconnection scheme...
In this paper, a low-complexity power-efficient iterative detection scheme for differentially encoded MPSK transmission over AWGN and Rayleigh fading channels is presented. As the main contribution, a novel APP coherent demodulator, which well suits for iterative processing, is derived under the optimal bit-based MAP criterion. The implementation of iteration is not trellis-based, and needn’t reconstruct...
In this paper, we consider three different H-ARQ methods supported in IEEE 802.16 physical layer. One advantage of IEEE 802.16e system is providing useful feed-back information thus we can exploit it to modify the basic H-ARQ algorithm. Here, the comparison of the Chase combining and incremental redundancy mechanism was shown and discussed. The amending of the hybrid of the two schemes was also proposed...
In this paper we derive optimal power allocation scheme that minimizes bit error rate (BER) while satisfying the average power constraint and peak to average power ratio (PAPR) constraint (which translates to minimizing the PAPR). The power allocation is done in space and time for multiple-input single-output (MISO) systems over Rayleigh flat fading channels assuming perfect channel state information...
This paper studies efficient complex valued matrix manipulations for multi-user STBC-MIMO decoding. A novel method called Alamouti blockwise analytical matrix inversion (ABAMI) is proposed for the inversion of large complex matrices that are based on Alamouti sub-blocks. Another method using a variant of Givens rotation is proposed for fast QR decomposition of this kind of matrices. Our solutions...
Unequal error protection is the key to future transport of multimedia data. The paper presents an overview of some new approaches realizing UEP properties in physical transport, especially multicarrier modulation, or with LDPC and turbo codes. For multicarrier modulation, a UEP bit-loading method is described allowing for an arbitrary number of classes, arbitrary SNR margins between the classes and...
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.