An antenna array is overloaded when the number of cochannel signals in its operating environment exceeds the number of elements. Conventional space-time array processing for narrow-band signals fails in overloaded environments. Overloaded array processing (OLAP) is most difficult when signals impinging on the array are near equal power, have tight excess bandwidth, and are of identical signal type. Despite the failure of conventional beamforming in such environments, OLAP becomes possible when a receiver exploits additional signal properties such as the finite-alphabet property and signal excess-bandwidth. This thesis proposes three approaches to signal extraction in overloaded environments, each providing a different tradeoff in performance and complexity. The first receiver architecture extracts signals from an overloaded environment through the use of MMSE interference rejection filtering embedded in a successive interference cancellation (SIC) architecture. The second receiver architecture enhances signal extraction performance by embedding a stronger interference rejection receiver, the reduced-state maximum aposteriori probability (RS-MAP) algorithm in a similar SIC architecture. The third receiver fine-tunes the performance of spatially reduced search joint detection (SRSJD) with the application of an energy focusing transform (EFT), a complexity reducing front-end linear pre-processor. A new type of EFT, the Energy Focusing Unitary Relaxed Transform (EFURT) is developed. This transform facilitates a continuous tradeoff between noise-enhancement and error-propagation in an SRSJD framework. EFURT is used to study the role of this tradeoff for SRSJD receivers in a variety of signal environments. It is found that for the environments studied in this thesis, SRSJD enjoys an aggressive reduction in interference at the expense of possible noise-enhancement. / Ph. D.

n/a

In airborne communication systems such as airborne cell-extender repeaters the receiver faces the challenge of demodulating the signal of interest (SOI) in the presence of excessive amounts of Co-Channel Interference (CCI) from a large number of sources. This results in the overloaded environment where the number of near-equal power co-channel interferers exceeds the number of antenna array elements. This thesis first analyzes the interference environment experienced by an airborne cellular repeater flying at high altitudes. Link budget analysis using a two-ray propagation model shows that the antenna array mounted on an airborne receiver has to recover the SOI out of hundreds of co-channel interfering signals. This necessitates use of complex overloaded array signal processing techniques. An extensive literature survey on narrowband signal extraction algorithms shows that joint detection schemes, coupled with antenna arrays, provide a solution for narrowband overloaded array problem where as traditional beamforming techniques fail. Simulation results in this thesis investigates three "promising" overloaded array processing algorithms, Multi-User Decision Feedback Equalizer (MU-DFE), Iterative Least Squares with Projection (ILSP), and Iterative Least Squares with Enumeration (ILSE). ILSE is a non-linear joint maximum-likelihood detector, is shown to demodulate many more signals than elements even when the users are closely spaced and the channel is blindly estimated. Multi-user time delay estimation is one of the most important aspects of channel estimation for overloaded array processing. The final chapter of the thesis proposes a low-complexity data-aided time-delay estimation structure for embedding in a Per Survivor Processing (PSP) trellis for overloaded array processing. An extensive analysis proves that the multi-user delay estimation is separable, which leads to the proposed multi-user algorithm that estimates the user delays with a bank of simple data-aided synchronization loops to reduce the complexity. This thesis shows simulation results for the single-user case where the low-complexity Delay Locked Loop (DLL) structure, working at a low oversampling rate of 2 samples per symbol, estimates and compensates for any integer or non-integer sample delay within ±Tsym(symbol period). Two extensions to this technique are proposed to provide efficient multi-user delay estimation. The first multi-user structure employs a bank of DLLs, which compensate for the timing offset of each user simultaneously. This multi-user algorithm is suitable for CDMA-type applications, where each user has a distinct PN-code with good auto- and cross-correlation properties. We show that for spreading gain of 31, the presence of an interpolator enables us to reduce the oversampling factor from 4 to 2 samples per chip. Thus, the requirements of the A/D converter are relaxed without sacrificing system performance. Furthermore, we show that the proposed scheme meets the requirements of multi-user interference cancellation techniques for residual worst-case timing errors, i.e., residual timing error < 0.2 Tc, as reported in [200]. Finally, the thesis recommends a similar multi-user structure for narrowband TDMA-type system, which is based on bank of DLLs with whitening pre-filters at the front end of each branch. / Master of Science

An antenna array is overloaded when the number of cochannel signals in its operating environment exceeds the number of elements. Conventional space-time array processing for narrow-band signals fails in overloaded environments. Overloaded array processing (OAP) is most difficult when signals impinging on the array are near equal power, have tight excess bandwidth, and are of identical signal type. In this thesis, we first demonstrate how OAP is theoretically possible with the joint maximum likelihood (JML) receiver. However, for even a modest number of interfering signals, the JML receiverà ­s computational complexity quickly exceeds the real-time ability of any computer. This thesis proposes an iterative joint detection technique, Spatially Reduced Search Joint Detection, (SRSJD), which approximates the JML receiver while reducing its computational complexity by several orders of magnitude. This complexity reduction is achieved by first exploiting spatial separation between interfering signals with a linear pre-processing stage, and second, performing iterative joint detection with a (possibly) tail-biting and time"-varying trellis. The algorithm is sub-optimal but is demonstrated to well approximate the optimum receiver in modest signal to interference ratios. SRSJD is shown to demodulate over 2M zero excess bandwidth synchronous QPSK signals with an M element array. Also, this thesis investigates a temporal processing technique similar to SRSJD, Temporally Reduced Search Joint Detection (TRSJD), that separates co-channel, asynchronous, partial response signals. The technique is demonstrated to separate two near equal power QPSK signals with r= .35 root raised-cosine pulse shapes." / Master of Science

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第20741号 / 情博第655号 / 新制||情||113(附属図書館) / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 原田 博司, 教授 守倉 正博, 教授 大木 英司 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

The main objective of this thesis focuses on the design of an adaptive algorithm for admission control and content-aware load balancing for Web traffic. In order to set the context of this work, several reviews are included to introduce the reader in the background concepts of Web load balancing, admission control and the Internet traffic characteristics that may affect the good performance of a Web site. The admission control and load balancing algorithm described in this thesis manages the distribution of traffic to a Web cluster based on QoS requirements. The goal of the proposed scheduling algorithm is to avoid situations in which the system provides a lower performance than desired due to servers' congestion. This is achieved through the implementation of forecasting calculations. Obviously, the increase of the computational cost of the algorithm results in some overhead. This is the reason for designing an adaptive time slot scheduling that sets the execution times of the algorithm depending on the burstiness that is arriving to the system. Therefore, the predictive scheduling algorithm proposed includes an adaptive overhead control.Once defined the scheduling of the algorithm, we design the admission control module based on throughput predictions. The results obtained by several throughput predictors are compared and one of them is selected to be included in our algorithm. The utilisation level that the Web servers will have in the near future is also forecasted and reserved for each service depending on the Service Level Agreement (SLA). Our load balancing strategy is based on a classical policy. Hence, a comparison of several classical load balancing policies is also included in order to know which of them better fits our algorithm. A simulation model has been designed to obtain the results presented in this thesis.

Analytical chemistry is a field with a vast variety of applications. A robust companion in the field is liquid chromatography, the method used in this thesis, which is an established workhorse and a versatile tool in many different disciplines. It can be used for identification and quantification of interesting compounds generally present in low concentrations, called analytical scale chromatography. It can also be used for isolation and purification of high value compounds, called preparative chromatography. The latter is usually conducted in large scale with high concentrations. With high concentrations it is also possible to determine something called adsorption isotherms. Determination of adsorption isotherms is a useful tool for quite a wide variety of reasons. It can be used for characterisation of chromatographic separation systems, and then gives information on the retention mechanism as well as provides the possibility to study column-column and batch-batch reproducibility. If a protein is immobilised on a solid support, adsorption isotherms can be used for pharmacological characterisation of drug-protein interactions. Moreover, they can be used for the study of unexpected chromatographic phenomena. If the adsorption isotherm is known it is also possible to simulate chromatograms, and subsequently optimise the separation process numerically. The gain of a numerically optimised separation process is higher purity or yield of valuable compounds such as pharmaceuticals or antioxidants, as well as reducing the solvent usage. Taken all together, it saves time, money and the environment. However, the process of the adsorption isotherm determination requires a number of careful experimental considerations and preparations, and these are the main focus of the thesis. Important steps along the way include the choice of separation system and of suitable analytes, preparation of mobile phases and sample solutions, calibration, determination of injection profiles and column void, and of course the adsorption isotherm determination method itself. It is also important to keep track of parameters such as temperature and pH. These issues are discussed in this thesis. At the end, a description of useful methods for processing of the raw adsorption isotherm data is presented, as well as a brief passage on methods for numerical optimisation.

Studien fokuserar på att identifiera utmaningar och lösningar för hantering av hyresgästernas avfallhos fastighetsägaren, Rikshem. Arbetet att identifiera och undersöka Rikshems utmaningar medavfallshantering på nationell nivå baserades på intervjuer med olika medarbetare i bolaget samtundersökning av kostnader och andra interna dokument. Tre utmaningar identifierades: felsortering,översopor samt nedskräpning och dumpning av grovavfall. Orsakerna och konsekvenserna till dessautmaningar sammanställdes. Intervjuerna med andra fastighetsägare bekräftades utmaningarna somåterkommande hos fastighetsägare i vissa av deras områden. I syfte att lösa dessa problem identifierades olika lösningar från intervjuerna och delades upp ipraktiska och strategiska lösningar med hjälp av tematisk analys. Lösningarna undersöktes senareutifrån Rikshem hållbarhetskompass. De strategiska lösningarna som att ta fram mål och vision samtsammanställa kostnader rekommenderades att utföras på bolagsnivå. De praktiska lösningarnainkluderar bland annat olika former av miljöhus, tekniska lösningar i form av TV-skärmar, sensoreroch kärlpress, alternativ för grovsoprum, personlig service och nudging. Dessa lösningar måstedäremot undersökas vidare då de utförs utifrån varje områdes enskilda förutsättningar och behov. / The study focuses on identifying challenges and solutions for managing tenants' waste living inRikshem’s houses. The work to identify and investigate Rikshem's challenges with waste managementat the national level was based on interviews with various employees in the company as well as anexamination of other internal documents. Three challenges were identified: incorrect sorting,overloaded waste containers and dumping of bulky waste. The causes and consequences of thesechallenges were compiled. The interviews with other property owners confirmed that these challengesrecur with other property owners. In order to solve these problems, different solutions from the interviews were identified and dividedinto practical and strategic solutions using thematic analysis. The solutions were later examined basedon Rikshem's sustainability compass. The strategic solutions such as developing goals and vision andcompiling costs were recommended to be carried out at a company level. The practical solutionsinclude various forms of environmental houses, technical solutions in the form of TV screens, sensorsand container-press, alternatives for bulky waste rooms, personal service and nudging. Thesesolutions, on the other hand, must be further investigated as they would be carried out on the basis ofeach area's individual conditions and needs.Keyword