1,528 research outputs found

    Performance Analysis and Enhancement of Multiband OFDM for UWB Communications

    Full text link
    In this paper, we analyze the frequency-hopping orthogonal frequency-division multiplexing (OFDM) system known as Multiband OFDM for high-rate wireless personal area networks (WPANs) based on ultra-wideband (UWB) transmission. Besides considering the standard, we also propose and study system performance enhancements through the application of Turbo and Repeat-Accumulate (RA) codes, as well as OFDM bit-loading. Our methodology consists of (a) a study of the channel model developed under IEEE 802.15 for UWB from a frequency-domain perspective suited for OFDM transmission, (b) development and quantification of appropriate information-theoretic performance measures, (c) comparison of these measures with simulation results for the Multiband OFDM standard proposal as well as our proposed extensions, and (d) the consideration of the influence of practical, imperfect channel estimation on the performance. We find that the current Multiband OFDM standard sufficiently exploits the frequency selectivity of the UWB channel, and that the system performs in the vicinity of the channel cutoff rate. Turbo codes and a reduced-complexity clustered bit-loading algorithm improve the system power efficiency by over 6 dB at a data rate of 480 Mbps.Comment: 32 pages, 10 figures, 1 table. Submitted to the IEEE Transactions on Wireless Communications (Sep. 28, 2005). Minor revisions based on reviewers' comments (June 23, 2006

    A new low-cost discrete bit loading using greedy power allocation

    Get PDF
    In this paper we consider a low cost bit loading based on the greedy power allocation (GPA). Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are suggested, which perform GPA on subsets of subchannels only. We demonstrate how these schemes can reduce complexity. Two of the proposed algorithms can achieve near optimal performance by including a transfer of residual power between subsets at the expense of a very small extra cost. By simulations, we show that the two near optimal schemes perform best in two separate and distinct SNR regions

    PLC for the smart grid: state-of-the-art and challenges

    Get PDF
    This paper aims to review systems and applications for power line communications (PLC) in the context of the smart grid. We discuss the main applications and summarise state-of-the-art PLC systems and standards. We report efforts and challenges in channel and noise modelling, as well as in state-of-the-art transmission technology approaches

    Robustness maximization of parallel multichannel systems

    Get PDF
    Bit error rate (BER) minimization and SNR-gap maximization, two robustness optimization problems, are solved, under average power and bit-rate constraints, according to the waterfilling policy. Under peak-power constraint the solutions differ and this paper gives bit-loading solutions of both robustness optimization problems over independent parallel channels. The study is based on analytical approach with generalized Lagrangian relaxation tool and on greedy-type algorithm approach. Tight BER expressions are used for square and rectangular quadrature amplitude modulations. Integer bit solution of analytical continuous bit-rates is performed with a new generalized secant method. The asymptotic convergence of both robustness optimizations is proved for both analytical and algorithmic approaches. We also prove that, in conventional margin maximization problem, the equivalence between SNR-gap maximization and power minimization does not hold with peak-power limitation. Based on a defined dissimilarity measure, bit-loading solutions are compared over power line communication channel for multicarrier systems. Simulation results confirm the asymptotic convergence of both allocation policies. In non asymptotic regime the allocation policies can be interchanged depending on the robustness measure and the operating point of the communication system. The low computational effort of the suboptimal solution based on analytical approach leads to a good trade-off between performance and complexity.Comment: 27 pages, 8 figures, submitted to IEEE Trans. Inform. Theor

    Achievable Throughput Optimization in OFDM Systems in the Presence of Interference and its Application to Power Line Networks

    No full text
    International audienceThe aim of this paper is to study the bit-loading and power allocation problem in the presence of interference (Inter-carrier Interference (ICI) and Inter-Symbol Interference (ISI)) in Orthogonal Frequency Division Multiplexing (OFDM) systems. ISI and ICI significantly degrade the performance of OFDM systems and make the resource management optimized without the assumption of interference less efficient. To solve this problem, an initial solution based on the greedy approach is proposed in this paper. Then, several reduced complexity approaches, which yield a little degradation compared to the initial solution, have been developed. Simulation results presented in the context of Power Line Communication (PLC) show that the performance of proposed algorithms is tight with their upper bound. Moreover, these algorithms efficiently improve the system performance as compared to the constant power water-filling allocation algorithm as well as maximum power allocation algorithm

    Resource allocation technique for powerline network using a modified shuffled frog-leaping algorithm

    Get PDF
    Resource allocation (RA) techniques should be made efficient and optimized in order to enhance the QoS (power & bit, capacity, scalability) of high-speed networking data applications. This research attempts to further increase the efficiency towards near-optimal performance. RA’s problem involves assignment of subcarriers, power and bit amounts for each user efficiently. Several studies conducted by the Federal Communication Commission have proven that conventional RA approaches are becoming insufficient for rapid demand in networking resulted in spectrum underutilization, low capacity and convergence, also low performance of bit error rate, delay of channel feedback, weak scalability as well as computational complexity make real-time solutions intractable. Mainly due to sophisticated, restrictive constraints, multi-objectives, unfairness, channel noise, also unrealistic when assume perfect channel state is available. The main goal of this work is to develop a conceptual framework and mathematical model for resource allocation using Shuffled Frog-Leap Algorithm (SFLA). Thus, a modified SFLA is introduced and integrated in Orthogonal Frequency Division Multiplexing (OFDM) system. Then SFLA generated random population of solutions (power, bit), the fitness of each solution is calculated and improved for each subcarrier and user. The solution is numerically validated and verified by simulation-based powerline channel. The system performance was compared to similar research works in terms of the system’s capacity, scalability, allocated rate/power, and convergence. The resources allocated are constantly optimized and the capacity obtained is constantly higher as compared to Root-finding, Linear, and Hybrid evolutionary algorithms. The proposed algorithm managed to offer fastest convergence given that the number of iterations required to get to the 0.001% error of the global optimum is 75 compared to 92 in the conventional techniques. Finally, joint allocation models for selection of optima resource values are introduced; adaptive power and bit allocators in OFDM system-based Powerline and using modified SFLA-based TLBO and PSO are propose

    Intersymbol and Intercarrier Interference in OFDM Transmissions through Highly Dispersive Channels

    Get PDF
    This work quantifies, for the first time, intersymbol and intercarrier interferences induced by very dispersive channels in OFDM systems. The resulting achievable data rate for \wam{suboptimal} OFDM transmissions is derived based on the computation of signal-to-interference-plus-noise ratio for arbitrary length finite duration channel impulse responses. Simulation results point to significant differences between data rates obtained via conventional formulations, for which interferences are supposed to be limited to two or three blocks, versus the data rates considering the actual channel dispersion
    • 

    corecore