No description available.

To let many users benefit from the high speed communication in an optical fiber, a way to share the channel is needed. One way to share the channel between the users is the multiple access technique of Code Division Multiple Access, CDMA. This technique is based on coding. By assigning the users different codewords, the receiver is able to distinguish the information sent from each user. One family of codes suitable to use in a fiber optic network is the constant weight Optical Orthogonal Codes, OOC. To influence the users interference tolerability it is possible to assign the users codewords of the same length but with different weights. By letting the users have codewords of different length it is possible to have different data rates in the system. These two versions of optical orthogonal codes, with variable length and weight, are investigated in this thesis for their cardinality. The variable weight and variable length codes were created by combining optical orthogonal codes with different parameters. I have found that for variable length OOC:s of weight 2 it seems to be possible to increase the cardinality of a code, but for codes with higer weights than that, it is better that all users are assigned codewords of the same length. But since an upper bound for the cardinality of these types of codes has not been found, it is not possible to verify if this conclusion is correct. For variable weight OOC:s it is found that it is only possible to increase the cardinality of small, not optimal, codes. For codes including many codewords it is rarely possible to include more codewords without breaking the conditions on cross correlation between the codewords.

In this thesis, we study foldings of orthogonal polygons into orthogonal polyhedra. The particular problem examined here is whether a paper cutout of an orthogonal polygon with fold lines indicated folds up into a simple orthogonal polyhedron. The folds are orthogonal and the direction of the fold (upward or downward) is also given. We present a polynomial time algorithm to solve this problem. Next we consider the same problem with the exception that the direction of the folds are not given. We prove that this problem is NP-complete. Once it has been determined that a polygon does fold into a polyhedron, we consider some restrictions on the actual folding process, modelling the case when the polyhedron is constructed from a stiff material such as sheet metal. We show an example of a polygon that cannot be folded into a polyhedron if folds can only be executed one at a time. Removing this restriction, we show another polygon that cannot be folded into a polyhedron using rigid material.

Recent years, Orthogonal Frequency Division Multiplexing (OFDM) system gets more and more attentions for its great benefit to the optical fiber communication system for improving the transmission performance. Not only better performance in long distance transmission but also high bit-rate is attractive feature of the OFDM system. The OFDM technology has been developed for the wireless communication system, and is now used in Asymmetric Digital Subscriber Line (ADSL), ETSI Digital Audio Broadcasting (DAB), Digital Video Broadcasting (DVB), High Definition Television (HDTV), Wireless Local Area Network (WLAN) and so on. The OFDM is extensively used in broadband wired and wireless communication systems, and it solves the problem of intersymbol interference (ISI) effectively. Actually, the OFDM is a kind of Multi-Carrier Modulation (MCM), and it is not a brand-new technology. The history of the OFDM can be traced back to 1966 when Chang of Bell Labs introduced the concept of the OFDM. In this thesis, I will briefly introduce the background of optical fiber communication system, then, explain my motivation and the structure of this thesis. Next, theoretical study has been conducted. For the simulation, I discuss the performance of the OFDM system related to the number of subcarriers and the erbium-doped fiber amplifier (EDFA) repeater output power. It revealed that small number of subcarriers had better transmission performance. In my study case, repeater output power of 0dBm was the optimum condition. In addition, experimental study has been conducted. For the experiment, the waveform required for the OFDM signal generation was calculated offline, and it was realized by the Arbitrary Waveform Generator (AWG). Finally, this thesis is concluded.

Long Term Evolution (LTE) developed by Third Generation Partnership Project (3GPP) is expected to be the standard of the Fourth-Generation (4G) of wireless communication system. LTE supports Frequency Division Duplex (FDD) and Time Division Duplex (TDD), and both of them are based on Orthogonal Frequency Division Multiplexing (OFDM) system in downlink. OFDM systems are sensitive to timing and frequency offset. Therefore, synchronization plays an important role in OFDM systems. In this thesis, we study synchronization problems of a LTE FDD baseband receiver. Particularly, we develop a complete procedure to deal with the synchronization problems. The basic design concept and procedure are as follows: The receiver estimates and compensates the timing and frequency offset by using the repetition property of the cyclic prefix. In the meanwhile, the receiver also detects cyclic prefix mode (or the length of the cyclic prefix). After the frequency offset has been compensated, the receiver then processes cell search. To this end, we multiply each subcarrier by the synchronization sequence provided by LTE specification and transform them into time domain. We then estimate the channel energy in time domain to detect the Cell Identity (Cell ID). Using computer simulations, we verify that the designed receiver performs well.

Due to the improvement of luminous efficiency, LED has been applied in general lighting nowadays. However, the efficacy and life of high power LED lamps are degraded for the problem of overheat temperature of the chips. In accordance with the above reason, the thermal management has been important in LED application. The thesis aims to analyze the thermal problem of high power LED lamp by FEM. In the beginning, we analyzed the temperature curves and thermal stress curves of chips by changing the thickness of AuSn solder in 4 structures. According to the results, the better thickness range and structures were chosen. In the second step, the effect of different sizes of a vapor chamber on the different thermal conductivities of lamp system was discussed. Finally, we orthogonalized all the designed parameters by Taguchi orthogonal array method, and then found the optimal design by comparing the results with the initial analyses. In this study, we proposed a solution to improve the quality characteristics of LED lamp by Taguchi method. So the effect of each control factors on the performance was able to be determined. For different features of demand, the present study is helpful to achieve the ideal design in manufacturing. Key words: FEM, high power LED lamps, Taguchi orthogonal array method

This thesis presents a study of reduced-order models based on proper orthogonal decomposition applied to non-isothermal transport phenomena in °uidized beds. A numerical °ow solver called Multiphase Flow with Interphase eXchanges (MFIX) was used to generate a database of solution snapshots for proper orthogonal decomposi- tion (POD). Using POD, time independent basis functions were extracted from the data and the governing equations of the numerical solver were projected onto the basis functions to generate reduced-order models. A reduced-order model was constructed that simulates multi-phase isothermal and non-isothermal °ow. In the reduced-order models (ROMs) the large number of partial di®erential equations were replaced by a much smaller number of ordinary di®erential equations. These reduced-order models were applied to two reference cases, a time extrapolation case and a time-dependent period boundary condition case. Three additional acceleration techniques were devel- oped to further improve computational e±ciency of the POD based ROM: 1) Database splitting, 2) Freezing the matrix of the linear system and 3) Time step adjustment. Detailed numerical analysis of both the full-order model, MFIX and the POD-based ROM, including estimating the number of operations and the CPU time per iteration, was performed as part of this study. The results of this investigation show that the reduced-order models are capable of producing qualitatively accurate results with less than 5% error with a two-order of magnitude reduction of computational costs.

This thesis presents advances in reduced-order modeling based on proper orthogonal decomposition (POD) for single and two-phase flows. Reduced-order models (ROMs) are generated for two-phase gas-solid flows. A multiphase numerical flow solver, MFIX, is used to generate a database of solution snapshots for proper orthogonal decomposition. Time-independent basis functions are extracted using POD from the data, and the governing equations of the MFIX are projected onto the basis functions to generate the multiphase POD-based ROMs. Reduced-order models are constructed to simulate multiphase two-dimensional non-isothermal flow and isothermal flow particle kinetics and three-dimensional isothermal flow. These reduced-order models are applied to three reference cases. The results of this investigation show that the two-dimensional reduced-order models are capable of producing qualitatively accurate results with less than 5 percent error with at least an order of magnitude reduction of computational costs. The three-dimensional ROM shows improvements in computational costs. This thesis also presents an algorithm based on mathematical morphology used to extract discontinuities present in quasi-steady and unsteady flows for POD basis augmentation. Both MFIX and a Reynolds Average Navier-Stokes (RANS) flow solver, UNS3D, are used to generate solution databases for feature extraction. The algorithm is applied to bubbling uidized beds, transonic airfoils, and turbomachinery seals. The results of this investigation show that all of the important features are extracted without loss in accuracy.

Gas turbine engines are the main propulsion source for world wide aviation and are also used for power generation. Even though they rely mainly on fossil fuel and emit climate active gasses, their importance is not likely to decrease in the future. But more efficient ways of using finite resources and hence reducing emissions have to be found. Thus, the interest to improve engine efficiency is growing. Considering the efficiency of the underlying thermodynamic cycle, an increase can be achieved by raising the turbine inlet temperature or compression ratio. Due to the complex nature of the underlying flow physics, however, the aero-thermal processes are still not fully understood. For this reason, one needs to perform research at high spatial and temporal resolution, in turn creating the need for effective means of postprocessing the large amounts of data. This dissertation addresses both sides of the problem - using high-scale, high resolution simulations as well as effective post processing techniques. As an example for the latter, a temporal highly resolved data set from wall pressure measurements of a transonic compressor stage is analyzed using proper orthogonal decomposition. The underlying experiments were performed by collaborators at Technical University Darmstadt. To decompose signals into optimal orthogonal basis functions based on temporal correlations including temperature, a formal mathematical framework is developed. A method to rank the reduced order representations with respect to heat transfer effectiveness is presented. To test both methods, a Reynolds-averaged Navier-Stokes (RANS) simulation and large eddy simulation (LES) are performed on turbulent heat transfer in a square duct with one single row of pin fins. While the LES results show closer agreement to experiments, both simulations unveil flow parts that do not contribute to heat transfer augmentation and can be considered wasteful. From the most effective mode, a wall contour for the same domain is derived and applied. In the wall contoured domain, energy in wasteful modes decreased, heat transfer increased and the temperature fluctuations at the wall decreased. Another stagnating boundary layer flow is examined in a direct numerical simulation of a first stage stator vane. Elevated levels of free stream turbulence and integral length scale are generated to simulate the features of combustor exit flow. The horseshoe vortex dynamics cause an increase in endwall heat transfer upstream of the vane. The link between energy optimal orthogonal basis functions and flow structures is examined using this data and the reduced order heat transfer analysis shows high energy modes with comparatively low impact on turbulent heat transfer. The analysis further shows that there are multiple horseshoe vortices that oscillate upstream of the blade, vanish, regenerate and can also merge. There is a punctual correlation of intense vortex dynamics and peaks in the orthogonal temperature basis function. For all data considered, the link between the energy optimal orthogonal basis functions and flow structures is neither guaranteed to exist nor straightforward to establish. The orthogonal expansion locks onto flow parts with high fluctuating kinetic energy - which might or might not be the ones that are looked for. The heat transfer ranking eliminates this problem and is valid independently of how certain basis functions are interpreted.

To realize efficient parallel processing, which is one of effective methods that deal with computing intensive applications, the technology of solving the problems of task matching and scheduling becomes extremely important. In this thesis, an Ant Colony Optimization (ACO) approach is employed for allocating task graphs onto a heterogeneous computing system. The approach uses a new state transition rule to reduce the time needed for finding a satisfactory solution. And a local search procedure is designed to improve the obtained solution. Furthermore, by applying the Taguchi Method in the technology of Quality Engineering, and further utilizing the Orthogonal Array (OA) to reduce the number of experiments and find the optimal combination of parameters, which allows the Ant Colony Algorithm to find solutions more efficient. The proposed algorithm is compared with the genetic-algorithm-based approach and the dynamic priority scheduling (DPS) heuristic. Experimental results show that the ACO approach outperforms two computing approaches in solving the task matching and scheduling problem.