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, an energy efficient adaptive modulation scheme is proposed for a wireless cognitive radio ad hoc network, where each node is equipped with cognitive radio and the network is an OFDMA system operating on time slots. In each slot, the users with new traffic demand will sense the spectrum and locate the available subcarrier set. Then they choose subcarriers with favorable channel condition...
By exploiting properties of the wireless medium, network coding may provide even larger throughput increases for wireless networks than possible for wired networks. In particular, simultaneously transmitted signals are seen as noisy linear combinations at the antennas of receivers. It is thus quite tempting to use the physical layer to directly perform network coding "on the air". However,...
Low density parity check codes are a popular class of linear block codes for forward error correction in communication channels. Recent years have seen a lot of work towards the hardware-oriented constructions for LDPC codes which have comparable error-correcting performance to random construction codes. This paper proposes a novel method called Iterative-filled (IF) to construct LDPC codes and a...
Li and Xia have recently investigated the design of space-time codes that achieve full spatial diversity for asynchronous cooperative communications. They show that certain of the binary space-time trellis codes derived from the Hammons-El Gamal stacking construction are delay tolerant and can be used in the multilevel code constructions by Lu and Kumar to produce delay tolerant space-time codes for...
Some communication applications, like multimedia, deliver data of different importance classes allowing unequal error protection (UEP) levels. In this paper, a multiple-input multiple-output (MIMO) system using orthogonal frequency division multiplexing (OFDM) is considered with a new UEP bit-loading algorithm based on the non-UEP algorithm by Chow, Cioffi, and Bingham. In the proposed bit-loading...
We designed and built a novel all-optical re-timing, re-amplifying, and re-shaping (3R) regeneration system based on terahertz optical asymmetric demultiplexers (TOADs) developed in our laboratory. The system is capable of parallel processing multiple wavelengths, a feature which will significantly improve the scalability of current wavelength division multiplexing (WDM) networks. Performance against...
This paper addresses adaptive channel estimation for time-varying mobile wireless channels with nonstationary statistics. We presents a reduced complexity adaptive channel estimator based on a set membership filtering approach known as the Optimal Bounding Ellipsoid (OBE) algorithm. To exploit time and frequency domain correlation properties of the channel in an efficient low-complexity way, we allow...
Correlative minimum shift keying (MSK), a second order polynomial modulation scheme known as tamed frequency modulation (TFM), is a constant envelope type of modulation with a perfect peak to average power ratio (PAPR), besides the property of low out of band power. We apply the linearized TFM to the single carrier transmission with frequency domain equalization (SC/FDE) concept. We then obtain a...
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...
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.