Performance Analysis of Discrete Wavelet Multitone Transceiver for Narrowband PLC in Smart Grid

Smart Grid is an abstract idea, which involves the utilization of powerlines for sensing, measurement, control and communication for efficient utilization and distribution of energy, as well as automation of meter reading, load management and capillary control of Green Energy resources connected to the grid. Powerline Communication (PLC) has assumed a new role in the Smart Grid scenario, adopting the narrowband PLC (NB-PLC) for a low cost and low data rate communication for applications such as, automatic meter reading, dynamic management of load, etc. In this paper, we have proposed and simulated a discrete wavelet multitone (DWMT) transceiver in the presence of impulse noise for the NB-PLC channel applications in Smart Grid. The simulation results show that a DWMT transceiver outperforms a DFT-DMT with reference to the bit error rate (BER) performance

Call admission and routing in telecommunication networks.

by Kit-man Chan.Thesis (M.Phil.)--Chinese University of Hong Kong, 1994.Includes bibliographical references (leaves 82-86).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Overview of Integrated Service Digital Networks --- p.1Chapter 1.2 --- Multirate Loss Networks --- p.5Chapter 1.3 --- Previous Work --- p.7Chapter 1.4 --- Organization --- p.11Chapter 1.5 --- Publications --- p.12Chapter 2 --- Call Admission in Multirate Loss Networks --- p.13Chapter 2.1 --- Introduction --- p.13Chapter 2.2 --- Two Adaptive Routing Rules --- p.15Chapter 2.3 --- Call Admission Policies --- p.17Chapter 2.4 --- Analysis of Call Admission Policies --- p.25Chapter 2.4.1 --- "The CS, LO, GB and the EB Policies" --- p.25Chapter 2.4.2 --- The DP Policy --- p.29Chapter 2.5 --- Performance Comparisons --- p.32Chapter 2.6 --- Concluding Remarks --- p.35Chapter 3 --- Least Congestion Routing in Multirate Loss Networks --- p.41Chapter 3.1 --- Introduction --- p.41Chapter 3.2 --- The M2 and MTB Routings --- p.42Chapter 3.2.1 --- M2 Routing --- p.43Chapter 3.2.2 --- MTB Routing --- p.43Chapter 3.3 --- Bandwidth Sharing Policies and State Aggregation --- p.45Chapter 3.4 --- Analysis of M2 Routing --- p.47Chapter 3.5 --- Analysis of MTB Routing --- p.50Chapter 3.6 --- Numerical Results and Discussions --- p.53Chapter 3.7 --- Concluding Remarks --- p.56Chapter 4 --- The Least Congestion Routing in WDM Lightwave Networks --- p.60Chapter 4.1 --- Introduction --- p.60Chapter 4.2 --- Architecture and Some Design Issues --- p.62Chapter 4.3 --- The Routing Rule --- p.66Chapter 4.4 --- Analysis of the LC Routing Rule --- p.67Chapter 4.4.1 --- Fixed Point Model --- p.67Chapter 4.4.2 --- Without Direct-link Priority --- p.68Chapter 4.4.3 --- With Direct-link Priority --- p.72Chapter 4.5 --- Performance Comparisons --- p.73Chapter 4.6 --- Concluding Remarks --- p.75Chapter 5 --- Conclusions and Future Work --- p.79Chapter 5.1 --- Future Work --- p.8

Space-time-frequency block codes for MIMO-OFDM in next generation wireless systems

In this thesis the use of space-frequency block codes (SFBC) and space-time-frequency block codes (STFBC) in wireless systems are investigated. A variety of SFBC and STFBC schemes are proposed for particular propagation scenarios and system settings where each has its own advantages and disadvantages. The objective is to pro-pose coding strategies with improved flexibility, feasibility and spectral efficiency,and reduce the decoding complexity in an MIMO-OFDM system. Firstly an efficient SFBC with improved system performance is proposed for MIMO-OFDM systems. The proposed SFBC incorporates the concept of matched rotation precoding (MRP) to achieve full transmit diversity and optimal system performance foran arbitrary numberoftransmitantennas,subcarrierinterval andsubcarriergrouping. The MRP is proposed to exploit the inherent rotation and repetition properties of SFBC, arising from the channel power delay profile, in order to fully capture both space and frequency diversity of SFBC in a MIMO-OFDM system. It is able to relax restrictions on subcarrier interval and subcarrier grouping, making it ideal for adaptive/time-varying systems or multiuser systems. The SFBC without an optimization process is unstable in terms of achievable system performance and diversity order, and also risks diversity loss within a specific propagation scenario. Such loss or risk is prominent while wireless propagation channel has a limited number of dominant paths, e.g. relatively close to transmitters or relatively flat topography. Hence in orderto improve the feasibility of SFBC in dynamic scenarios, the lower bound of the coding gain for MRP is derived. The SFBC with MRP is proposed for more practical scenarios when only partial channel power delay profile information is known at the transmit end, for example the wireless channel has dominant propagation paths. The proposed rate one MRP has a relatively simple optimization process that can be transformed into an explicit diagram and hence an optimal result can be derived intuitively without calculations. Next, a multi-rate transmission strategy is proposed for both SFBCand STFBC to balance the system performance and transmission rate. A variety of rate adaptive coding matrices are obtained by a simple truncation of the coding matrix, or by parameter optimization for coding matrices for a given transmission rate and constellation. Pro-posed strategy can easily and gradually adjust the achievable diversity order. As a result it is capable of achieving a relatively smooth balance between system performance and transmission rate in both SFBC and STFBC, without a significant change of coding structure or constellation size. Such tradeoff would be useful to maintain stable Quality of Service (QoS) for users by providing more scalability of achievable performance in a time-varying channel. Finally the decoding procedure of space-time block code (STBC), SFBCand STFBC is discussed. The decoding of all existing STBC/SFBC/STFBC is unified at first, in order to show a concise procedure and make fair comparisons. Then maximum likelihood decoding (MLD) and arbitrary sphere decoding (SD) can be adopted. To reduce the complexity of decoding further, a novel decoding method called compensation de-coding (CD) is presented for a given space-time-frequency coding scheme. By taking advantage of the simplicity of zero-forcing decoding (ZFD) we are able to calculate a compensation vector for the output of ZFD. After modification by utilizing the com-pensation vector, the BER performance can be improved significantly. The decoding procedure is relatively simple and is independent of the constellation size. The per-formance of the proposed decoding method is close to maximum-likelihood decoding for low to medium SNR. A low complexity detection scheme, classifier based decoding (CBD), is further proposed for MIMO systems incorporating spatial multiplexing. The CBD is a hybrid of an equalizer-based technique and an algorithmic search stage. Based on an error matrix and its probability density functions for different classes of error, a particular search region is selected for the algorithmic stage. As the probability of occurrence of error classes with larger search regions is small, overall complexity of the proposed technique remains low, whilst providing a significant improvement in the bit error rate performance

The Strict-Sense Nonblocking Multirate l

This paper considers the nonblocking conditions for a multirate logd(N,0,p) switching network at the connection level. The necessary and sufficient conditions for the discrete bandwidth model, as well as sufficient and, in particular cases, also necessary conditions for the continuous bandwidth model, were given. The results given for dn-1/2f0≥f1+1 in the discrete bandwidth model are the same as those proposed by Hwang et al. (2005); however, in this paper, these results were extended to other values of f0, f1, and d. In the continuous bandwidth model for B+b>1, the results given in this paper are also the same as those by Hwang et al. (2005); however, for B+b≤1, it was proved that a smaller number of vertically stacked logdN switching networks are needed

Study of the CAC mechanisms for telecommunications systems with adaptive links according to propagation conditions

This paper presents the framework and the activities of a PhD research work in progress supported by Alcatel Alenia Space in collaboration with TeSA and SUPAERO. It deals with Connection Admission Control (CAC) for Telecommunications Systems with adaptive links according to propagation conditions. Indeed, in high frequency bands communications, deep fadings may occur because of atmospheric propagation losses. The mitigation techniques used to counteract fades impacts the system capacity, therefore the CAC mechanism. The CAC which only uses current capacity information may lead to intolerable dropping of admitted connection, and thus breaches the QoS guarantees made upon connection acceptance. New CAC mechanisms shall be studied to take into account the capacity variation and the mitigation techniques (IFMT) developed to compensate the attenuation in Ka and above frequency range

State-Dependent Bandwidth Sharing Policies for Wireless Multirate Loss Networks

We consider a reference cell of fixed capacity in a wireless cellular network while concentrating on next-generation network architectures. The cell accommodates new and handover calls from different service-classes. Arriving calls follow a random or quasi-random process and compete for service in the cell under two bandwidth sharing policies: 1) a probabilistic threshold (PrTH) policy or 2) the multiple fractional channel reservation (MFCR) policy. In the PrTH policy, if the number of in-service calls (new or handover) of a service-class exceeds a threshold (difference between new and handover calls), then an arriving call of the same service-class is accepted in the cell with a predefined state-dependent probability. In the MFCR policy, a real number of channels is reserved to benefit calls of certain service-classes; thus, a service priority is introduced. The cell is modeled as a multirate loss system. Under the PrTH policy, call-level performance measures are determined via accurate convolution algorithms, while under the MFCR policy, via approximate but efficient models. Furthermore, we discuss the applicability of the proposed models in 4G/5G networks. The accuracy of the proposed models is verified through simulation. Comparison against other models reveals the necessity of the new models and policies

Advancements of MultiRate Signal processing for Wireless Communication Networks: Current State Of the Art

With the hasty growth of internet contact and voice and information centric communications, many contact technologies have been urbanized to meet the stringent insist of high speed information transmission and viaduct the wide bandwidth gap among ever-increasing high-data-rate core system and bandwidth-hungry end-user complex. To make efficient consumption of the limited bandwidth of obtainable access routes and cope with the difficult channel environment, several standards have been projected for a variety of broadband access scheme over different access situation (twisted pairs, coaxial cables, optical fibers, and unchanging or mobile wireless admittance). These access situations may create dissimilar channel impairments and utter unique sets of signal dispensation algorithms and techniques to combat precise impairments. In the intended and implementation sphere of those systems, many research issues arise. In this paper we present advancements of multi-rate indication processing methodologies that are aggravated by this design trend. The thesis covers the contemporary confirmation of the current literature on intrusion suppression using multi-rate indication in wireless communiquE9; networks

DOCSIS 3.1 cable modem and upstream channel simulation in MATLAB

The cable television (CATV) industry has grown significantly since its inception in the late 1940’s. Originally, a CATV network was comprised of several homes that were connected to community antennae via a network of coaxial cables. The only signal processing done was by an analogue amplifier, and transmission only occurred in one direction (i.e. from the antennae/head-end to the subscribers). However, as CATV grew in popularity, demand for services such as pay-per-view television increased, which lead to supporting transmission in the upstream direction (i.e. from subscriber to the head-end). This greatly increased the signal processing to include frequency diplexers. CATV service providers began to expand the bandwidth of their networks in the late 90’s by switching from analogue to digital technology. In an effort to regulate the manufacturing of new digital equipment and ensure interoperability of products from different manufacturers, several cable service providers formed a non-for-profit consortium to develop a data-over-cable service interface specification (DOCSIS). The consortium, which is named CableLabs, released the first DOCSIS standard in 1997. The DOCSIS standard has been upgraded over the years to keep up with increased consumer demand for large bandwidths and faster transmission speeds, particularly in the upstream direction. The latest version of the DOCSIS standard, DOCSIS 3.1, utilizes orthogonal frequency-division multiple access (OFDMA) technology to provide upstream transmission speeds of up to 1 Gbps. As cable service providers begin the process of upgrading their upstream receivers to comply with the new DOCSIS 3.1 standard, they require a means of testing the various functions that an upstream receiver may employ. It is convenient for service providers to employ cable modem (CM) plus channel emulator to perform these tests in-house during the product development stage. Constructing the emulator in digital technology is an attractive option for testing. This thesis approaches digital emulation by developing a digital model of the CMs and upstream channel in a DOCSIS 3.1 network. The first step in building the emulator is to simulate its operations in MATLAB, specifically upstream transmission over the network. The MATLAB model is capable of simulating transmission from multiple CMs, each of which transmits using a specific “transmission mode.” The three transmission modes described in the DOCSIS 3.1 standard are included in the model. These modes are “traffic mode,” which is used during regular data transmission; “fine ranging mode,” which is used to perform fine timing and power offset corrections; and “probing” mode, which is presumably used for estimating the frequency response of the channel, but also is used to further correct the timing and power offsets. The MATLAB model is also capable of simulating the channel impairments a signal may encounter when traversing the upstream channel. Impairments that are specific to individual CMs include integer and fractional timing offsets, micro-reflections, carrier phase offset (CPO), fractional carrier frequency offset (CFO), and network gain/attenuation. Impairments common to all CMs include carrier hum modulation, AM/FM ingress noise, and additive white Gaussian noise (AWGN). It is the hope that the MATLAB scripts that make up the simulation be translated to Verilog HDL to implement the emulator on a field-programmable gate array (FPGA) in the near future. In the event that an FPGA implementation is pursued, research was conducted into designing efficient fractional delay filters (FDFs), which are essential in the simulation of micro-reflections. After performing an FPGA implementation cost analysis between various FDF designs, it was determined that a Kaiser-windowed sinc function FDF with roll-off parameter β = 3.88 was the most cost-efficient choice, requiring at total of 24 multipliers when implemented using an optimized structure