5,815 research outputs found

    Why Noise and Dispersion may Seriously Hamper Nonlinear Frequency-Division Multiplexing

    Full text link
    The performance of optical fiber systems based on nonlinear frequency-division multiplexing (NFDM) or on more conventional transmission techniques is compared through numerical simulations. Some critical issues affecting NFDM systems-namely, the strict requirements needed to avoid burst interaction due to signal dispersion and the unfavorable dependence of performance on burst length-are investigated, highlighting their potentially disruptive effect in terms of spectral efficiency. Two digital processing techniques are finally proposed to halve the guard time between NFDM symbol bursts and reduce the size of the processing window at the receiver, increasing spectral efficiency and reducing computational complexity.Comment: The manuscript has been submitted to Photonics Technology Letters for publicatio

    An efficient algorithm for the parallel solution of high-dimensional differential equations

    Full text link
    The study of high-dimensional differential equations is challenging and difficult due to the analytical and computational intractability. Here, we improve the speed of waveform relaxation (WR), a method to simulate high-dimensional differential-algebraic equations. This new method termed adaptive waveform relaxation (AWR) is tested on a communication network example. Further we propose different heuristics for computing graph partitions tailored to adaptive waveform relaxation. We find that AWR coupled with appropriate graph partitioning methods provides a speedup by a factor between 3 and 16

    PAPR Analysis for Dual-Polarization FBMC

    Full text link
    In a recent work we proposed a new radio access technique based on filter bank multi-carrier (FBMC) modulation using two orthogonal polarizations: dual-polarization FBMC (DP-FBMC). We showed that with good cross-polarization discrimination (XPD), DP-FBMC solves the intrinsic imaginary interference shortcoming of FBMC without extra processing. DP-FBMC also has other interesting advantages over cyclic prefix orthogonal frequency-division multiplexing (CP-OFDM) and FBMC such as more robustness in dispersive channels, and it is also more robust to receiver carrier frequency offset (CFO) and timing offset (TO). In this paper we analyze the peak to average power ratio (PAPR) of DP-FBMC and compare PAPR simulation results with that of conventional FBMC, for different prototype filters and overlapping factors. According to the analysis and results, with a proper choice of prototype filter, DP-FBMC has comparable PAPR to FBMC.Comment: This paper has been published in IEEE MILCOM Conference 2018. Some results has been changed from first versio

    Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability

    Full text link
    Efficient and faithful parallel simulation of large asynchronous systems is a challenging computational problem. It requires using the concept of local simulated times and a synchronization scheme. We study the scalability of massively parallel algorithms for discrete-event simulations which employ conservative synchronization to enforce causality. We do this by looking at the simulated time horizon as a complex evolving system, and we identify its universal characteristics. We find that the time horizon for the conservative parallel discrete-event simulation scheme exhibits Kardar-Parisi-Zhang-like kinetic roughening. This implies that the algorithm is asymptotically scalable in the sense that the average progress rate of the simulation approaches a non-zero constant. It also implies, however, that there are diverging memory requirements associated with such schemes.Comment: to appear in the Proceedings of the MRS, Fall 200

    A scheme for cancelling intercarrier interference using conjugate transmission in multicarrier communication systems

    Get PDF
    To mitigate intercarrier interference (ICI), a two-path algorithm is developed for multicarrier communication systems, including orthogonal frequency division multiplexing (OFDM) systems. The first path employs the regular OFDM algorithm. The second path uses the conjugate transmission of the first path. The combination of both paths forms a conjugate ICI cancellation scheme at the receiver. This conjugate cancellation (CC) scheme provides (1) a high signal to interference power ratio (SIR) in the presence of small frequency offsets (50 dB and 33 dB higher than that of the regular OFDM and linear self-cancellation algorithms [1], [2], respectively, at ΔfT = 0.1% of subcarrier frequency spacing); (2) better bit error rate (BER) performance in both additive white Gaussian noise (AWGN) and fading channels; (3) backward compatibility with the existing OFDM system; (4) no channel equalization is needed for reducing ICI, a simple low cost receiver without increasing system complexity. Although the two-path transmission reduces bandwidth efficiency, the disadvantage can be balanced by increasing signal alphabet sizes

    Multipath Parameter Estimation from OFDM Signals in Mobile Channels

    Full text link
    We study multipath parameter estimation from orthogonal frequency division multiplex signals transmitted over doubly dispersive mobile radio channels. We are interested in cases where the transmission is long enough to suffer time selectivity, but short enough such that the time variation can be accurately modeled as depending only on per-tap linear phase variations due to Doppler effects. We therefore concentrate on the estimation of the complex gain, delay and Doppler offset of each tap of the multipath channel impulse response. We show that the frequency domain channel coefficients for an entire packet can be expressed as the superimposition of two-dimensional complex sinusoids. The maximum likelihood estimate requires solution of a multidimensional non-linear least squares problem, which is computationally infeasible in practice. We therefore propose a low complexity suboptimal solution based on iterative successive and parallel cancellation. First, initial delay/Doppler estimates are obtained via successive cancellation. These estimates are then refined using an iterative parallel cancellation procedure. We demonstrate via Monte Carlo simulations that the root mean squared error statistics of our estimator are very close to the Cramer-Rao lower bound of a single two-dimensional sinusoid in Gaussian noise.Comment: Submitted to IEEE Transactions on Wireless Communications (26 pages, 9 figures and 3 tables
    corecore