Intelligent Processing in Wireless Communications Using Particle Swarm Based Methods

There are a lot of optimization needs in the research and design of wireless communica- tion systems. Many of these optimization problems are Nondeterministic Polynomial (NP) hard problems and could not be solved well. Many of other non-NP-hard optimization problems are combinatorial and do not have satisfying solutions either. This dissertation presents a series of Particle Swarm Optimization (PSO) based search and optimization algorithms that solve open research and design problems in wireless communications. These problems are either avoided or solved approximately before. PSO is a bottom-up approach for optimization problems. It imposes no conditions on the underlying problem. Its simple formulation makes it easy to implement, apply, extend and hybridize. The algorithm uses simple operators like adders, and multipliers to travel through the search space and the process requires just five simple steps. PSO is also easy to control because it has limited number of parameters and is less sensitive to parameters than other swarm intelligence algorithms. It is not dependent on initial points and converges very fast. Four types of PSO based approaches are proposed targeting four different kinds of problems in wireless communications. First, we use binary PSO and continuous PSO together to find optimal compositions of Gaussian derivative pulses to form several UWB pulses that not only comply with the FCC spectrum mask, but also best exploit the avail- able spectrum and power. Second, three different PSO based algorithms are developed to solve the NLOS/LOS channel differentiation, NLOS range error mitigation and multilateration problems respectively. Third, a PSO based search method is proposed to find optimal orthogonal code sets to reduce the inter carrier interference effects in an frequency redundant OFDM system. Fourth, a PSO based phase optimization technique is proposed in reducing the PAPR of an frequency redundant OFDM system. The PSO based approaches are compared with other canonical solutions for these communication problems and showed superior performance in many aspects. which are confirmed by analysis and simulation results provided respectively. Open questions and future Open questions and future works for the dissertation are proposed to serve as a guide for the future research efforts

A Markov Random Field Based Approach to 3D Mosaicing and Registration Applied to Ultrasound Simulation

A novel Markov Random Field (MRF) based method for the mosaicing of 3D ultrasound volumes is presented in this dissertation. The motivation for this work is the production of training volumes for an affordable ultrasound simulator, which offers a low-cost/portable training solution for new users of diagnostic ultrasound, by providing the scanning experience essential for developing the necessary psycho-motor skills. It also has the potential for introducing ultrasound instruction into medical education curriculums. The interest in ultrasound training stems in part from the widespread adoption of point-of-care scanners, i.e. low cost portable ultrasound scanning systems in the medical community. This work develops a novel approach for producing 3D composite image volumes and validates the approach using clinically acquired fetal images from the obstetrics department at the University of Massachusetts Medical School (UMMS). Results using the Visible Human Female dataset as well as an abdominal trauma phantom are also presented. The process is broken down into five distinct steps, which include individual 3D volume acquisition, rigid registration, calculation of a mosaicing function, group-wise non-rigid registration, and finally blending. Each of these steps, common in medical image processing, has been investigated in the context of ultrasound mosaicing and has resulted in improved algorithms. Rigid and non-rigid registration methods are analyzed in a probabilistic framework and their sensitivity to ultrasound shadowing artifacts is studied. The group-wise non-rigid registration problem is initially formulated as a maximum likelihood estimation, where the joint probability density function is comprised of the partially overlapping ultrasound image volumes. This expression is simplified using a block-matching methodology and the resulting discrete registration energy is shown to be equivalent to a Markov Random Field. Graph based methods common in computer vision are then used for optimization, resulting in a set of transformations that bring the overlapping volumes into alignment. This optimization is parallelized using a fusion approach, where the registration problem is divided into 8 independent sub-problems whose solutions are fused together at the end of each iteration. This method provided a speedup factor of 3.91 over the single threaded approach with no noticeable reduction in accuracy during our simulations. Furthermore, the registration problem is simplified by introducing a mosaicing function, which partitions the composite volume into regions filled with data from unique partially overlapping source volumes. This mosaicing functions attempts to minimize intensity and gradient differences between adjacent sources in the composite volume. Experimental results to demonstrate the performance of the group-wise registration algorithm are also presented. This algorithm is initially tested on deformed abdominal image volumes generated using a finite element model of the Visible Human Female to show the accuracy of its calculated displacement fields. In addition, the algorithm is evaluated using real ultrasound data from an abdominal phantom. Finally, composite obstetrics image volumes are constructed using clinical scans of pregnant subjects, where fetal movement makes registration/mosaicing especially difficult. Our solution to blending, which is the final step of the mosaicing process, is also discussed. The trainee will have a better experience if the volume boundaries are visually seamless, and this usually requires some blending prior to stitching. Also, regions of the volume where no data was collected during scanning should have an ultrasound-like appearance before being displayed in the simulator. This ensures the trainee\u27s visual experience isn\u27t degraded by unrealistic images. A discrete Poisson approach has been adapted to accomplish these tasks. Following this, we will describe how a 4D fetal heart image volume can be constructed from swept 2D ultrasound. A 4D probe, such as the Philips X6-1 xMATRIX Array, would make this task simpler as it can acquire 3D ultrasound volumes of the fetal heart in real-time; However, probes such as these aren\u27t widespread yet. Once the theory has been introduced, we will describe the clinical component of this dissertation. For the purpose of acquiring actual clinical ultrasound data, from which training datasets were produced, 11 pregnant subjects were scanned by experienced sonographers at the UMMS following an approved IRB protocol. First, we will discuss the software/hardware configuration that was used to conduct these scans, which included some custom mechanical design. With the data collected using this arrangement we generated seamless 3D fetal mosaics, that is, the training datasets, loaded them into our ultrasound training simulator, and then subsequently had them evaluated by the sonographers at the UMMS for accuracy. These mosaics were constructed from the raw scan data using the techniques previously introduced. Specific training objectives were established based on the input from our collaborators in the obstetrics sonography group. Important fetal measurements are reviewed, which form the basis for training in obstetrics ultrasound. Finally clinical images demonstrating the sonographer making fetal measurements in practice, which were acquired directly by the Philips iU22 ultrasound machine from one of our 11 subjects, are compared with screenshots of corresponding images produced by our simulator

A Markov Random Field Based Approach to 3D Mosaicing and Registration Applied to Ultrasound Simulation

A novel Markov Random Field (MRF) based method for the mosaicing of 3D ultrasound volumes is presented in this dissertation. The motivation for this work is the production of training volumes for an affordable ultrasound simulator, which offers a low-cost/portable training solution for new users of diagnostic ultrasound, by providing the scanning experience essential for developing the necessary psycho-motor skills. It also has the potential for introducing ultrasound instruction into medical education curriculums. The interest in ultrasound training stems in part from the widespread adoption of point-of-care scanners, i.e. low cost portable ultrasound scanning systems in the medical community. This work develops a novel approach for producing 3D composite image volumes and validates the approach using clinically acquired fetal images from the obstetrics department at the University of Massachusetts Medical School (UMMS). Results using the Visible Human Female dataset as well as an abdominal trauma phantom are also presented. The process is broken down into five distinct steps, which include individual 3D volume acquisition, rigid registration, calculation of a mosaicing function, group-wise non-rigid registration, and finally blending. Each of these steps, common in medical image processing, has been investigated in the context of ultrasound mosaicing and has resulted in improved algorithms. Rigid and non-rigid registration methods are analyzed in a probabilistic framework and their sensitivity to ultrasound shadowing artifacts is studied. The group-wise non-rigid registration problem is initially formulated as a maximum likelihood estimation, where the joint probability density function is comprised of the partially overlapping ultrasound image volumes. This expression is simplified using a block-matching methodology and the resulting discrete registration energy is shown to be equivalent to a Markov Random Field. Graph based methods common in computer vision are then used for optimization, resulting in a set of transformations that bring the overlapping volumes into alignment. This optimization is parallelized using a fusion approach, where the registration problem is divided into 8 independent sub-problems whose solutions are fused together at the end of each iteration. This method provided a speedup factor of 3.91 over the single threaded approach with no noticeable reduction in accuracy during our simulations. Furthermore, the registration problem is simplified by introducing a mosaicing function, which partitions the composite volume into regions filled with data from unique partially overlapping source volumes. This mosaicing functions attempts to minimize intensity and gradient differences between adjacent sources in the composite volume. Experimental results to demonstrate the performance of the group-wise registration algorithm are also presented. This algorithm is initially tested on deformed abdominal image volumes generated using a finite element model of the Visible Human Female to show the accuracy of its calculated displacement fields. In addition, the algorithm is evaluated using real ultrasound data from an abdominal phantom. Finally, composite obstetrics image volumes are constructed using clinical scans of pregnant subjects, where fetal movement makes registration/mosaicing especially difficult. Our solution to blending, which is the final step of the mosaicing process, is also discussed. The trainee will have a better experience if the volume boundaries are visually seamless, and this usually requires some blending prior to stitching. Also, regions of the volume where no data was collected during scanning should have an ultrasound-like appearance before being displayed in the simulator. This ensures the trainee\u27s visual experience isn\u27t degraded by unrealistic images. A discrete Poisson approach has been adapted to accomplish these tasks. Following this, we will describe how a 4D fetal heart image volume can be constructed from swept 2D ultrasound. A 4D probe, such as the Philips X6-1 xMATRIX Array, would make this task simpler as it can acquire 3D ultrasound volumes of the fetal heart in real-time; However, probes such as these aren\u27t widespread yet. Once the theory has been introduced, we will describe the clinical component of this dissertation. For the purpose of acquiring actual clinical ultrasound data, from which training datasets were produced, 11 pregnant subjects were scanned by experienced sonographers at the UMMS following an approved IRB protocol. First, we will discuss the software/hardware configuration that was used to conduct these scans, which included some custom mechanical design. With the data collected using this arrangement we generated seamless 3D fetal mosaics, that is, the training datasets, loaded them into our ultrasound training simulator, and then subsequently had them evaluated by the sonographers at the UMMS for accuracy. These mosaics were constructed from the raw scan data using the techniques previously introduced. Specific training objectives were established based on the input from our collaborators in the obstetrics sonography group. Important fetal measurements are reviewed, which form the basis for training in obstetrics ultrasound. Finally clinical images demonstrating the sonographer making fetal measurements in practice, which were acquired directly by the Philips iU22 ultrasound machine from one of our 11 subjects, are compared with screenshots of corresponding images produced by our simulator

The automatic placement of multiple indoor antennas using Particle Swarm Optimisation

In this thesis, a Particle Swarm Optimization (PSO) method combined with a ray propagation method is presented as a means to optimally locate multiple antennas in an indoor environment. This novel approach uses Particle Swarm Optimisation combined with geometric partitioning. The PSO algorithm uses swarm intelligence to determine the optimal transmitter location within the building layout. It uses the Keenan-Motley indoor propagation model to determine the fitness of a location. If a transmitter placed at that optimum location, transmitting a maximum power is not enough to meet the coverage requirements of the entire indoor space, then the space is geometrically partitioned and the PSO initiated again independently in each partition. The method outputs the number of antennas, their effective isotropic radiated power (EIRP) and physical location required to meet the coverage requirements. An example scenario is presented for a real building at Loughborough University and is compared against a conventional planning technique used widely in practice

A Channel Ranking And Selection Scheme Based On Channel Occupancy And SNR For Cognitive Radio Systems

Wireless networks and information traffic have grown exponentially over the last decade. Consequently, an increase in demand for radio spectrum frequency bandwidth has resulted. Recent studies have shown that with the current fixed spectrum allocation (FSA), radio frequency band utilization ranges from 15% to 85%. Therefore, there are spectrum holes that are not utilized all the time by the licensed users, and, thus the radio spectrum is inefficiently exploited. To solve the problem of scarcity and inefficient utilization of the spectrum resources, dynamic spectrum access has been proposed as a solution to enable sharing and using available frequency channels. With dynamic spectrum allocation (DSA), unlicensed users can access and use licensed, available channels when primary users are not transmitting. Cognitive Radio technology is one of the next generation technologies that will allow efficient utilization of spectrum resources by enabling DSA. However, dynamic spectrum allocation by a cognitive radio system comes with the challenges of accurately detecting and selecting the best channel based on the channelâs availability and quality of service. Therefore, the spectrum sensing and analysis processes of a cognitive radio system are essential to make accurate decisions. Different spectrum sensing techniques and channel selection schemes have been proposed. However, these techniques only consider the spectrum occupancy rate for selecting the best channel, which can lead to erroneous decisions. Other communication parameters, such as the Signal-to-Noise Ratio (SNR) should also be taken into account. Therefore, the spectrum decision-making process of a cognitive radio system must use techniques that consider spectrum occupancy and channel quality metrics to rank channels and select the best option. This thesis aims to develop a utility function based on spectrum occupancy and SNR measurements to model and rank the sensed channels. An evolutionary algorithm-based SNR estimation technique was developed, which enables adaptively varying key parameters of the existing Eigenvalue-based blind SNR estimation technique. The performance of the improved technique is compared to the existing technique. Results show the evolutionary algorithm-based estimation performing better than the existing technique. The utility-based channel ranking technique was developed by first defining channel utility function that takes into account SNR and spectrum occupancy. Different mathematical functions were investigated to appropriately model the utility of SNR and spectrum occupancy rate. A ranking table is provided with the utility values of the sensed channels and compared with the usual occupancy rate based channel ranking. According to the results, utility-based channel ranking provides a better scope of making an informed decision by considering both channel occupancy rate and SNR. In addition, the efficiency of several noise cancellation techniques was investigated. These techniques can be employed to get rid of the impact of noise on the received or sensed signals during spectrum sensing process of a cognitive radio system. Performance evaluation of these techniques was done using simulations and the results show that the evolutionary algorithm-based noise cancellation techniques, particle swarm optimization and genetic algorithm perform better than the regular gradient descent based technique, which is the least-mean-square algorithm

MITIGATION OF MICROGRID INTERACTIONS ON PROTECTION SYSTEMS IN UTILITY NETWORKS

This thesis presents novel schemes and techniques to overcome the difficulties associated with the integration of distributed generation (DG) and microgrids in the context of existing short circuit characteristics and protection infrastructure adequacy. One such inadequacy is associated with the loss of coordination (LOC) in existing protection infrastructure, with disruption to an expected sequence between utility reclosers and fuses. This thesis aims to offer solutions to these issues, allowing for DG sources and microgrids to be integrated into utility distribution networks without significant effect on existing protection infrastructure. The integration of DG units into radial distribution networks can result in LOC between upstream reclosers and downstream fuses. To overcome this issue a novel reclosing scheme is proposed whereby a control unit, variable load bank and dedicated recloser are integrated at the point of common coupling (PCC) between the DG unit and the network. This scheme works by receiving a control signal from the distribution network head-end recloser via a communication channel to signal the detection of a fault. Post fault detection, in conjunction with the DG current exceeding pre-specified pick up levels, the control unit disconnects the DG unit from the network to a transfer impedance. This transfer allows the DG unit to continue to supply the transfer impedance at the pre-fault load sharing condition, without the requirement for a shut down. This causes the DG unit to maintain its pre-fault speed and frequency, resulting in a fast reconnection time once the system fault is cleared by the existing protection infrastructure. The scheme is also compared to another potential method, namely fault current limiters (FCLs). To address the possibility of communication failure in the novel reclosing scheme, a fault detection technique is proposed based on measurements of the rate of change of current output by DG sources. The rate of change of current (ROCOC) is measured over a specified time window to generate a fault detection signal when the ROCOC exceeds specified pickup values. A hybrid adaptive overcurrent and differential protection scheme is proposed to protect microgrids that operate in both grid and islanded modes. Differential relays are utilized for feeder backbones and buses while adaptive overcurrent relays are concurrently used for load points. The hybrid approach is to reduce both infrastructure upgrade requirements and setting computation complexity, whilst also addressing the potential lack of coordination when differing protection mechanisms are merged. The proposed scheme is validated through multiple time-domain simulations while the microgrid is in both grid and islanded modes of operation. A smart protection scheme is then proposed to predict and mitigate the short circuit contribution of a microgrid to a utility fault at a magnitude below the LOC limit. The scheme utilizes polynomial regression analysis (PRA) and particle swarm optimization (PSO) in conjunction with a directional element of a relay to allow for partial continual microgrid connection during utility faults. The directional element specifies the direction of short circuit current flow, only allowing the scheme’s operation when the microgrid current is flowing to the utility. The PRA and PSO utilize wind speed, irradiance and operating conditions of synchronous machine based (SM-based) generators to determine the short circuit contributions to utility faults from plants and units within the microgrid. The predictions are used to minimize generation source disconnection to reduce the microgrid short circuit contribution to below the LOC limit dictated by the utility network allowing for the original utility coordination to be maintained. Finally, a case study is offered to demonstrate the capacity of every approach to mitigate microgrid short circuit contributions while restoring pre-fault operating conditions shortly after fault clearance by utility protection infrastructure. In this thesis, all case studies have been conducted using realistic distribution network and microgrid designs and settings, ensuring the efficacy of the proposed approaches. Time-domain simulations are carried out on these test benchmark models within the EMTP-RV software environment for validation purposes

Mehrdimensionale Kanalschätzung für MIMO-OFDM

DIGITAL wireless communication started in the 1990s with the wide-spread deployment of GSM. Since then, wireless systems evolved dramatically. Current wireless standards approach the goal of an omnipresent communication system, which fulfils the wish to communicate with anyone, anywhere at anytime. Nowadays, the acceptance of smartphones and/or tablets is huge and the mobile internet is the core application. Given the current growth, the estimated data traffic in wireless networks in 2020 might be 1000 times higher than that of 2010, exceeding 127 exabyte. Unfortunately, the available radio spectrum is scarce and hence, needs to be utilized efficiently. Key technologies, such as multiple-input multiple-output (MIMO), orthogonal frequency-division multiplexing (OFDM) as well as various MIMO precoding techniques increase the theoretically achievable channel capacity considerably and are used in the majority of wireless standards. On the one hand, MIMO-OFDM promises substantial diversity and/or capacity gains. On the other hand, the complexity of optimum maximum-likelihood detection grows exponentially and is thus, not sustainable. Additionally, the required signaling overhead increases with the number of antennas and thereby reduces the bandwidth efficiency. Iterative receivers which jointly carry out channel estimation and data detection are a potential enabler to reduce the pilot overhead and approach optimum capacity at often reduced complexity. In this thesis, a graph-based receiver is developed, which iteratively performs joint data detection and channel estimation. The proposed multi-dimensional factor graph introduces transfer nodes that exploit correlation of adjacent channel coefficients in an arbitrary number of dimensions (e.g. time, frequency, and space). This establishes a simple and flexible receiver structure that facilitates soft channel estimation and data detection in multi-dimensional dispersive channels, and supports arbitrary modulation and channel coding schemes. However, the factor graph exhibits suboptimal cycles. In order to reach the maximum performance, the message exchange schedule, the process of combining messages, and the initialization are adapted. Unlike conventional approaches, which merge nodes of the factor graph to avoid cycles, the proposed message combining methods mitigate the impairing effects of short cycles and retain a low computational complexity. Furthermore, a novel detection algorithm is presented, which combines tree-based MIMO detection with a Gaussian detector. The resulting detector, termed Gaussian tree search detection, integrates well within the factor graph framework and reduces further the overall complexity of the receiver. Additionally, particle swarm optimization (PSO) is investigated for the purpose of initial channel estimation. The bio-inspired algorithm is particularly interesting because of its fast convergence to a reasonable MSE and its versatile adaptation to a variety of optimization problems. It is especially suited for initialization since no a priori information is required. A cooperative approach to PSO is proposed for large-scale antenna implementations as well as a multi-objective PSO for time-varying frequency-selective channels. The performance of the multi-dimensional graph-based soft iterative receiver is evaluated by means of Monte Carlo simulations. The achieved results are compared to the performance of an iterative state-of-the-art receiver. It is shown that a similar or better performance is achieved at a lower complexity. An appealing feature of iterative semi-blind channel estimation is that the supported pilot spacings may exceed the limits given the by Nyquist-Shannon sampling theorem. In this thesis, a relation between pilot spacing and channel code is formulated. Depending on the chosen channel code and code rate, the maximum spacing approaches the proposed “coded sampling bound”.Die digitale drahtlose Kommunikation begann in den 1990er Jahren mit der zunehmenden Verbreitung von GSM. Seitdem haben sich Mobilfunksysteme drastisch weiterentwickelt. Aktuelle Mobilfunkstandards nähern sich dem Ziel eines omnipräsenten Kommunikationssystems an und erfüllen damit den Wunsch mit jedem Menschen zu jeder Zeit an jedem Ort kommunizieren zu können. Heutzutage ist die Akzeptanz von Smartphones und Tablets immens und das mobile Internet ist die zentrale Anwendung. Ausgehend von dem momentanen Wachstum wird das Datenaufkommen in Mobilfunk-Netzwerken im Jahr 2020, im Vergleich zum Jahr 2010, um den Faktor 1000 gestiegen sein und 100 Exabyte überschreiten. Unglücklicherweise ist die verfügbare Bandbreite beschränkt und muss daher effizient genutzt werden. Schlüsseltechnologien, wie z.B. Mehrantennensysteme (multiple-input multiple-output, MIMO), orthogonale Frequenzmultiplexverfahren (orthogonal frequency-division multiplexing, OFDM) sowie weitere MIMO Codierverfahren, vergrößern die theoretisch erreichbare Kanalkapazität und kommen bereits in der Mehrheit der Mobil-funkstandards zum Einsatz. Auf der einen Seite verspricht MIMO-OFDM erhebliche Diversitäts- und/oder Kapazitätsgewinne. Auf der anderen Seite steigt die Komplexität der optimalen Maximum-Likelihood Detektion exponientiell und ist infolgedessen nicht haltbar. Zusätzlich wächst der benötigte Mehraufwand für die Kanalschätzung mit der Anzahl der verwendeten Antennen und reduziert dadurch die Bandbreiteneffizienz. Iterative Empfänger, die Datendetektion und Kanalschätzung im Verbund ausführen, sind potentielle Wegbereiter um den Mehraufwand des Trainings zu reduzieren und sich gleichzeitig der maximalen Kapazität mit geringerem Aufwand anzunähern. Im Rahmen dieser Arbeit wird ein graphenbasierter Empfänger für iterative Datendetektion und Kanalschätzung entwickelt. Der vorgeschlagene multidimensionale Faktor Graph führt sogenannte Transferknoten ein, die die Korrelation benachbarter Kanalkoeffizienten in beliebigen Dimensionen, z.B. Zeit, Frequenz und Raum, ausnutzen. Hierdurch wird eine einfache und flexible Empfängerstruktur realisiert mit deren Hilfe weiche Kanalschätzung und Datendetektion in mehrdimensionalen, dispersiven Kanälen mit beliebiger Modulation und Codierung durchgeführt werden kann. Allerdings weist der Faktorgraph suboptimale Schleifen auf. Um die maximale Performance zu erreichen, wurde neben dem Ablauf des Nachrichtenaustausches und des Vorgangs zur Kombination von Nachrichten auch die Initialisierung speziell angepasst. Im Gegensatz zu herkömmlichen Methoden, bei denen mehrere Knoten zur Vermeidung von Schleifen zusammengefasst werden, verringern die vorgeschlagenen Methoden die leistungsmindernde Effekte von Schleifen, erhalten aber zugleich die geringe Komplexität des Empfängers. Zusätzlich wird ein neuartiger Detektionsalgorithmus vorgestellt, der baumbasierte Detektionsalgorithmen mit dem sogenannten Gauss-Detektor verknüpft. Der resultierende baumbasierte Gauss-Detektor (Gaussian tree search detector) lässt sich ideal in das graphenbasierte Framework einbinden und verringert weiter die Gesamtkomplexität des Empfängers. Zusätzlich wird Particle Swarm Optimization (PSO) zum Zweck der initialen Kanalschätzung untersucht. Der biologisch inspirierte Algorithmus ist insbesonders wegen seiner schnellen Konvergenz zu einem akzeptablen MSE und seiner vielseitigen Abstimmungsmöglichkeiten auf eine Vielzahl von Optimierungsproblemen interessant. Da PSO keine a priori Informationen benötigt, ist er speziell für die Initialisierung geeignet. Sowohl ein kooperativer Ansatz für PSO für Antennensysteme mit extrem vielen Antennen als auch ein multi-objective PSO für Kanäle, die in Zeit und Frequenz dispersiv sind, werden evaluiert. Die Leistungsfähigkeit des multidimensionalen graphenbasierten iterativen Empfängers wird mit Hilfe von Monte Carlo Simulationen untersucht. Die Simulationsergebnisse werden mit denen eines dem Stand der Technik entsprechenden Empfängers verglichen. Es wird gezeigt, dass ähnliche oder bessere Ergebnisse mit geringerem Aufwand erreicht werden. Eine weitere ansprechende Eigenschaft von iterativen semi-blinden Kanalschätzern ist, dass der mögliche Abstand von Trainingssymbolen die Grenzen des Nyquist-Shannon Abtasttheorem überschreiten kann. Im Rahmen dieser Arbeit wird eine Beziehung zwischen dem Trainingsabstand und dem Kanalcode formuliert. In Abhängigkeit des gewählten Kanalcodes und der Coderate folgt der maximale Trainingsabstand der vorgeschlagenen “coded sampling bound”

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field

A Review of Methodological Approaches for the Design and Optimization of Wind Farms

This article presents a review of the state of the art of the Wind Farm Design and Optimization (WFDO) problem. The WFDO problem refers to a set of advanced planning actions needed to extremize the performance of wind farms, which may be composed of a few individual Wind Turbines (WTs) up to thousands of WTs. The WFDO problem has been investigated in different scenarios, with substantial differences in main objectives, modelling assumptions, constraints, and numerical solution methods. The aim of this paper is: (1) to present an exhaustive survey of the literature covering the full span of the subject, an analysis of the state-of-the-art models describing the performance of wind farms as well as its extensions, and the numerical approaches used to solve the problem; (2) to provide an overview of the available knowledge and recent progress in the application of such strategies to real onshore and offshore wind farms; and (3) to propose a comprehensive agenda for future research