84 research outputs found
Enhanced Channel Estimation Based On Basis Expansion Using Slepian Sequences for Time Varying OFDM Systems
The Channel estimation in OFDM has become very important to recover the accurate information from the received data as the next generation of wireless technology has very high data rate along with the very high speed mobile terminals as users. In addition the fast fading channels, ICI, multipath fading channels may completely destroy the data. Also it is required to use less complex method for estimation. We are proposing the method which compares the number of techniques and gives the results in BER Vs SNR graphs. The LS estimation technique is less complex as compared to MMSE estimation but gives fails in accuracy. Using Prolate function we can reduce the complexity in calculation of parameters. If compared with state of art approach where the complexity is O(N)3, the complexity using Prolate function is O(N)2.The function depends upon maximum delay and maximum Doppler frequency spread thus parameter calculation is reduced. The technique dose not calculate particular channel characteristics. Slepian sequences utilizes the bandwidth as the sharp pulses replace the regular rectangular pulses which causes spectral leakage and thus ICI. The simulation of BER Vs SNR using CP and UW with and without Prolate is proposed that increases spectral efficiency with reduced calculations replacing rectangular pulses by Slepian pulses which increase energy concentration by Sharpe pulses thus reduction in inter carrier interference caused by multipath fading.
DOI: 10.17762/ijritcc2321-8169.150513
Performance Analysis of Physical Layer Network Coding.
Network coding has emerged as an innovative approach to network operation that
can significantly enhance network throughput. The key goal of this thesis is to understand fundamental aspects of physical layer network coding, where network coding is performed at the physical layer.
As a simple but typical example of network coding, we consider a network scenario
where two users transmit messages through a common channel and the receiver reconstructs the exclusive-or of the two messages. For this channel, we investigate the error exponent which can provide guidelines for the design of e±cient communication systems using network coding. From a practical point of view, we examine the performance of channel codes for this problem. Assuming that each user transmits data using the same low-density parity-check (LDPC) code and each link is an additive white Gaussian noise
channel, we evaluate the noise thresholds of LDPC codes via density evolution methods.
Other important issues considered in this thesis are related to transmission over fading channels. First, we study the performance of LDPC codes over non-ergodic fading channels. In non-ergodic channels, reliable communication at a constant rate is impossible. Assuming that the fading coe±cient is randomly chosen but fixed during
transmission of an LDPC codeword, we derive the outage probability of LDPC-coded systems. We also propose an accurate frequency domain channel estimator based on the Slepian basis expansion. The proposed scheme operates with high accuracy requiring only the knowledge of the maximum delay spread of the channel. Finally, we investigate the capacity achieving input of non-coherent Rayleigh fading channels taking into account power constraints imposed by a non-linear power amplifier. We show that the optimal input is discrete with finite support which indicates that capacity can be computed using finite dimensional optimization.Ph.D.Electrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/64791/1/jinhokim_1.pd
Recommended from our members
A Cognitive Radio Compressive Sensing Framework
With the proliferation of wireless devices and services, allied with further significant predicted growth, there is an ever increasing demand for higher transmission rates. This is especially challenging given the limited availability of radio spectrum, and is further exacerbated by a rigid licensing regulatory regime. Spectrum however, is largely underutilized and this has prompted regulators to promote the concept of opportunistic spectrum access. This allows unlicensed secondary users to use bands which are licensed to primary users, but are currently unoccupied, so leading to more efficient spectrum utilization.
A potentially attractive solution to this spectrum underutilisation problem is cognitive radio (CR) technology, which enables the identification and usage of vacant bands by continuously sensing the radio environment, though CR enforces stringent timing requirements and high sampling rates. Compressive sensing (CS) has emerged as a novel sampling paradigm, which provides the theoretical basis to resolve some of these issues, especially for signals exhibiting sparsity in some domain. For CR-related signals however, existing CS architectures such as the random demodulator and compressive multiplexer have limitations in regard to the signal types used, spectrum estimation methods applied, spectral band classification and a dependence on Fourier domain based sparsity.
This thesis presents a new generic CS framework which addresses these issues by specifically embracing three original scientific contributions: i) seamless embedding of the concept of precolouring into existing CS architectures to enhance signal sparsity for CR-related digital modulation schemes; ii) integration of the multitaper spectral estimator to improve sparsity in CR narrowband modulation schemes; and iii) exploiting sparsity in an alternative, non-Fourier (Walsh-Hadamard) domain to expand the applicable CR-related modulation schemes.
Critical analysis reveals the new CS framework provides a consistently superior and robust solution for the recovery of an extensive set of currently employed CR-type signals encountered in wireless communication standards. Significantly, the generic and portable nature of the framework affords the opportunity for further extensions into other CS architectures and sparsity domains
Signal Reconstruction From Nonuniform Samples Using Prolate Spheroidal Wave Functions: Theory and Application
Nonuniform sampling occurs in many applications due to imperfect sensors, mismatchedclocks or event-triggered phenomena. Indeed, natural images, biomedical responses andsensor network transmission have bursty structure so in order to obtain samples that correspondto the information content of the signal, one needs to collect more samples when thesignal changes fast and fewer samples otherwise which creates nonuniformly distibuted samples.On the other hand, with the advancements in the integrated circuit technology, smallscale and ultra low-power devices are available for several applications ranging from invasivebiomedical implants to environmental monitoring. However the advancements in the devicetechnologies also require data acquisition methods to be changed from the uniform (clockbased, synchronous) to nonuniform (clockless, asynchronous) processing. An important advancementis in the data reconstruction theorems from sub-Nyquist rate samples which wasrecently introduced as compressive sensing and that redenes the uncertainty principle. Inthis dissertation, we considered the problem of signal reconstruction from nonuniform samples.Our method is based on the Prolate Spheroidal Wave Functions (PSWF) which can beused in the reconstruction of time-limited and essentially band-limited signals from missingsamples, in event-driven sampling and in the case of asynchronous sigma delta modulation.We provide an implementable, general reconstruction framework for the issues relatedto reduction in the number of samples and estimation of nonuniform sample times. We alsoprovide a reconstruction method for level crossing sampling with regularization. Another way is to use projection onto convex sets (POCS) method. In this method we combinea time-frequency approach with the POCS iterative method and use PSWF for the reconstructionwhen there are missing samples. Additionally, we realize time decoding modulationfor an asynchronous sigma delta modulator which has potential applications in low-powerbiomedical implants
A new subspace method for blind estimation of selective MIMO-STBC channels
In this paper, a new technique for the blind estimation of frequency and/or time-selective multiple-input multiple-output (MIMO) channels under space-time block coding (STBC) transmissions is presented. The proposed method relies on a basis expansion model (BEM) of the MIMO channel, which reduces the number of parameters to be estimated, and includes many practical STBC-based transmission scenarios, such as STBC-orthogonal frequency division multiplexing (OFDM), space-frequency block coding (SFBC), time-reversal STBC, and time-varying STBC encoded systems. Inspired by the unconstrained blind maximum likelihood (UML) decoder, the proposed criterion is a subspace method that efficiently exploits all the information provided by the STBC structure, as well as by the reduced-rank representation of the MIMO channel. The method, which is independent of the specific signal constellation, is able to blindly recover the MIMO channel within a small number of available blocks at the receiver side. In fact, for some particular cases of interest such as orthogonal STBC-OFDM schemes, the proposed technique blindly identifies the channel using just one data block. The complexity of the proposed approach reduces to the solution of a generalized eigenvalue (GEV) problem and its computational cost is linear in the number of sub-channels. An identifiability analysis and some numerical examples illustrating the performance of the proposed algorithm are also providedThis work was supported by the Spanish Government under projects TEC2007-68020-C04-02/TCM (MultiMIMO) and CONSOLIDER-INGENIO 2010 CSD2008-00010 (COMONSENS)
- …