In wireless communication, MIMO (multiple input multiple output) is one of the promising technologies which improves the range and performance of transmission without increasing the bandwidth, while providing high rates. High speed hardware MIMO decoders are one of the keys to apply this technology in applications. In order to support the high data rates, the underlying hardware must have significant processing capabilities. FPGA improves the speed of signal processing using parallelism and reconfigurability advantages. The objective of this thesis is to develop an efficient hardware architectural model for the universal lattice decoder and prototype it on FPGA. The original algorithm is modified to ensure the high data rate via taking the advantage of FPGA features. The simulation results of software, hardware are verified and the BER performance of both the algorithms is estimated. The system prototype of the decoder with 4-transmit and 4-receive antennas using a 4-PAM (Pulse amplitude modulation) supports 6.32 Mbit/s data rate for parallelpipeline implementation on FPGA platform, which is about two orders of magnitude faster than its DSP implementation.

Liu, Xin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 61-63). / Abstracts in English and Chinese. / Abstract --- p.1 / Acknowledgments --- p.4 / Chapter 0 --- Introduction --- p.5 / Chapter 1 --- Basics of self-affine tiles --- p.8 / Chapter 1.1 --- Self-affine sets --- p.8 / Chapter 1.2 --- Self-affine tiles --- p.11 / Chapter 1.3 --- Structure of tiling sets --- p.15 / Chapter 1.4 --- Integral self-affine tiles --- p.20 / Chapter 1.4.1 --- Lebesgue measure of integral self-affine tile --- p.22 / Chapter 1.4.2 --- Classification of digit set --- p.24 / Chapter 2 --- Connectedness of self-affine tiles --- p.28 / Chapter 2.1 --- Connectedness --- p.28 / Chapter 2.2 --- Disk-likeness --- p.33 / Chapter 3 --- Tiles with rotations and reflections --- p.39 / Chapter 3.1 --- Tiles --- p.39 / Chapter 3.2 --- Integral tiles --- p.54 / Bibliography --- p.60

Object localization refers to the detection, matching and segmentation of objects in images. The localization model presented in this paper relies on deformable templates to match objects based on shape alone. The shape structure is captured by a prototype template consisting of hand-drawn edges and contours representing the object to be localized. A multistage, multiresolution algorithm is utilized to reduce the computational intensity of the search. The first stage reduces the physical search space dimensions using correlation to determine the regions of interest where a match it likely to occur. The second stage finds approximate matches between the template and target image at progressively finer resolutions, by attracting the template to salient image features using Edge Potential Fields. The third stage entails the use of evolutionary optimization to determine control point placement for a Local Weighted Mean warp, which deforms the template to fit the object boundaries. Results are presented for a number of applications, showing the successful localization of various objects. The algorithm’s invariance to rotation, scale, translation and moderate shape variation of the target objects is clearly illustrated.

The term upscaling and determination of pseudo curves, or effective parameters, used on a coarse-scale simulation grid are related to the complex and extensive problems associated with reservoir studies. The primary strategy mainly focuses on having a good physical and practical understanding of the particular processes in question, and an appreciation of reservoir model sensitivities. Thus the building of the reservoir simulation models can be optimally determined.By concentrating on the modelling and upscaling gas injection for Enhanced Oil Recovery (EOR) process, which includes Interfacial Tension (IFT) and the amicability effect, a new effective and efficient algorithm of upscaling will be investigated and determined by using several upscaled parameters. The sensitivities of these determined coarse scale parameters (i.e. porosity, absolute and relative permeability and capillary pressure), will also be studied through a history matching of the existing field.

In best-first top-down induction of decision trees, the best split is added in each step (e.g. the split that maximally reduces the Gini index). This is in contrast to the standard depth-first traversal of a tree. The resulting tree will be the same, just how it is built is different. The objective of this project is to investigate whether it is possible to determine an appropriate tree size on practical datasets by combining best-first decision tree growth with cross-validation-based selection of the number of expansions that are performed. Pre-pruning, post-pruning, CART-pruning can be performed this way to compare.

<p>VDL mode 4 is a digital data link operating in the VHF band, its mainly use is for the aviation industry.VDL4 can as an example provide with positioning data, speed information of aircrafts or vehicles equipped with a VDL4 transponder. A connection between the groundsystem and the airborne system is called a point to point connection, which can be used for various applications. This data link needs to be transferred between groundstations during flights in order maintain the connection, which is called handoff.</p><p>The handoff process needs to be quick enough to not drop the link and at the same time a low rate of handoffs is desirable. The data link is regarded as a narrow resource and link management data for handoff is considered as overhead.</p><p>This thesis studies how to make the handoff procedure optimal with respect to involved aspects. Previous research of handoff algorithms and models of the VHF-channel are treated. Standardized parameters and procedures in VDL4 and are explored in order to find an optimal solution for the handoff procedure in VDL4.</p><p>The studied topics are analyzed and it is concluded to suggest an algorithm based on an adaptive hysteresis including signal quality and positioning data provided in VDL4. Standardized parameters which could be useful in the handoff procedure are commented, since the VDL4 standards are under development.</p>

Natural gas plants can have multiple owners for raw natural gas streams and processing facilities as well as for multiple products. Therefore, a proper cost allocation method is necessary for taxation of the profits from natural gas and crude oil as well as for cost sharing among gas producers. However, cost allocation methods most often used in accounting, such as the sales value method and the physical units method, may produce unacceptable or even illogical results when applied to natural gas processes. Wright and Hall (1998) proposed a new approach called the design benefit method (DBM), based upon engineering principles, and Wright et al. (2001) illustrated the potential of the DBM for reliable cost allocation for natural gas processes by applying it to a natural gas process. In the present research, a rigorous modeling technique for the DBM has been developed based upon a Taylor series approximation. Also, we have investigated a cost allocation framework that determines the virtual flows, models the equipment, and evaluates cost allocation for applying the design benefit method to other scenarios, particularly those found in the petroleum and gas industries. By implementing these individual procedures on a computer, the proposed framework easily can be developed as a software package, and its application can be extended to large-scale processes. To implement the proposed cost allocation framework, we have investigated an optimization methodology specifically geared toward economic optimization problems encountered in natural gas plants. Optimization framework can provide co-producers who share raw natural gas streams and processing plants not only with optimal operating conditions but also with valuable information that can help evaluate their contracts. This information can be a reasonable source for deciding new contracts for co-producers. For the optimization framework, we have developed a genetic-quadratic search algorithm (GQSA) consisting of a general genetic algorithm and a quadratic search that is a suitable technique for solving optimization problems including process flowsheet optimization. The GQSA inherits the advantages of both genetic algorithms and quadratic search techniques, and it can find the global optimum with high probability for discontinuous as well as non-convex optimization problems much faster than general genetic algorithms.

This thesis proposes an algorithm to enhance the convergence speed of genetic algorithm by modifying the function flow of a simple GA. Additional operators, such as asexual reproduction, competition, and livability, are added before the survival operation. After adding these three operators to the genetic algorithm, the convergence speed can be increased. Experiments indicate that simulations with the proposed algorithm have a 47% improvement in convergence speed on the traveling salesman problem. As for the graph coloring problem, the proposed algorithm also has a 10% improvement. Also, since these operators are additional parts to the original GA, the algorithm can be further improved by enhancing the operators, such as selection, crossover, and mutation.

In Cryptography, computing a^xb^y mod n is the most important and the most time-consuming calculation The problem can be solved by classical binary method. Later research is based on this basis to increase computational efficiency. Furthermore, Binary signed-digit representation recoding algorithm, the Sparse Form, the DJM recoding method, and the Joint Sparse Form can be used to decrease the number of multiplication by aligning more non-zero bits. Another method is to pre-compute and store the part of the results to decrease the number of computations by shifting bits. Joint Sparse Form recording method is not a table driven algorithm in converting source codes into joint sparse form. In this paper, we first proposed a table driven algorithm for joint sparse form to simply recording concept. This algorithm can be constructed a finite state machine to denote the recording procedure. According to this finite state machine, we show that the average joint Hamming weight among joint sparse form is 0.5n when n approaches infinity. Finally, we show that the average joint Hamming weights of SS1 method and DS1 method among joint sparse form are 0.469n and 0.438n by using a similar method, respectively.

As the number of vehicles increases rapidly, traffic congestion has become a serious problem in a city. Over the past years, a considerable number of studies have been made on traffic light setting. The traffic light setting problem is to investigate how to set the given traffic lights such that the total waiting time of vehicles on the roads is minimized. In this thesis, we use a graph model to represent the traffic network. On this model, some characteristics of the setting problem can be presented and analyzed. We first devise a branch and bound algorithm for obtaining the optimal solution of the traffic light setting problem. In addition, the genetic algorithm (GA), the particle swarm optimization (PSO) and the ant colony optimization (ACO) algorithm are also adopted to get the near optimal solution. Then, to extend this model, we add the assumption that each vehicle can change its direction. By comparing the results of various algorithms, we can study the impact of these algorithms on the traffic light setting problem. In our experiments, we also transform the map of Kaohsiung city into our graph model and test each algorithm on this graph.