23 research outputs found

    Maximally Flexible Assignment of Orthogonal Variable Spreading Factor Codes for Multi-Rate Traffic

    Get PDF
    In universal terrestrial radio access (UTRA) systems, orthogonal variable spreading factor (OVSF) codes are used to support different transmission rates for different users. In this paper, we first define the flexibility index to measure the capability of an assignable code set in supporting multirate traffic classes. Based on this index, two single-code assignment schemes, nonrearrangeable and rearrangeable compact assignments, are proposed. Both schemes can offer maximal flexibility for the resulting code tree after each code assignment. We then present an analytical model and derive the call blocking probability, system throughput and fairness index. Analytical and simulation results show that the proposed schemes are efficient, stable and fair

    Efficient scheduling algorithms for quality-of-service guarantees in the Internet

    Get PDF
    Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.Includes bibliographical references (p. 167-172).The unifying theme of this thesis is the design of packet schedulers to provide quality-of- service (QoS) guarantees for various networking problem settings. There is a dual emphasis on both theoretical justification and simulation evaluation. We have worked on several widely different problem settings - optical networks, input-queued crossbar switches, and CDMA wireless networks - and we found that the same set of scheduling techniques can be applied successfully in all these cases to provide per-flow bandwidth, delay and max-min fairness guarantees. We formulated the abstract scheduling problems as a sum of two aspects. First, the particular problem setting imposes constraints which dictate what kinds of transmission patterns are allowed by the physical hardware resources, i.e., what are the feasible solutions. Second, the users require some form of QoS guarantees, which translate into optimality criteria judging the feasible solutions. The abstract problem is how to design an algorithm that finds an optimal (or near-optimal) solution among the feasible ones. Our schedulers are based on a credit scheme. Specifically, flows receive credits at their guaranteed rate, and the arrival stream is compared to the credit stream acting as a reference. From this comparison, we derive various parameters such as the amount of unspent credits of a flow and the waiting time of a packet since its corresponding credit arrived. We then design algorithms which prioritize flows based on these parameters. We demonstrate, both by rigorous theoretical proofs and by simulations, that these parameters can be bounded. By bounding these parameters, our schedulers provide various per-flow QoS guarantees on average rate, packet delay, queue length and fairness.by Anthony Chi-Kong Kam.Ph.D

    Final report on the evaluation of RRM/CRRM algorithms

    Get PDF
    Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

    Gestão comum de recursos rádio em redes sem fios de próxima geração

    Get PDF
    Mestrado em Electrónica e TelecomunicaçõesA tecnologia de sinais de rádio frequência sobre fibra óptica involve o uso de links ópticos para transportar os sinais desde a unidade central de processamento até aos sites remotos (e vice-versa). A centralização do processamento dos sinais de rádio frequência permite a partilha de equipamentos, alocação dinâmica de recursos e uma manutenção mais simplificada do sistema. Embora o conceito de gestão comum dos recursos rádio tenha despertado grande interesse na comunidade científica em termos da melhor utilização desses recursos e de novos modelos de negócio, a verdade é que a sua implementação não tem sido fácil. A interligação entre diferentes componentes de rede, normalmente localizados em locais diferentes, introduz um grande atraso nas comunicações; por outro lado as implementações proprietárias e a escassez de informação global não satisfazem os requisitos de um ambiente extremamente dinâmico, como é o ambiente wireless. Uma topologia centralizada permite ultrapassar estas contrariedades, disponibilizando uma interligação eficiente entre as entidades locais e comuns de gestão de recursos rádio. Nesta dissertação é apresentada uma nova arquitectura de gestão comum de recursos rádio, baseada no conceito de interligação entre diferentes tecnologias de acesso. Esta arquitectura faz a gestão dos recursos rádio de forma centralizada, onde os sinais rádio chegam sem qualquer pré-processamento. Essa arquitectura é avaliada com a implementação de um algoritmo simples de balanceamento da carga que segue a politica de minimização da interferência e aumento da capacidade. As simulações com duas tecnologias de acesso, quando consideradas separas ou em agregado, mostraram um aumento do débito de pelo menos 51% para o mesmo valor de interferência enquanto que o erro de simbolo decresce pelo menos 20%.Radio over fibre technology involves the use of optical fibre links to distribute radio frequency signals from a central location to remote sites (and viceversa). The centralisation of radio frequency signals processing functions enables equipment sharing, dynamic allocation of resources, and simplified system operation and maintenance. Despite the unquestionable interest concept of common radio resource management from the point of view of resource usage and novel business models, its implementation has not been easy. The interworking between the different local radio resource management entities, usually located on different places will not satisfy the requirements of the wireless dynamic behaviour due to increase of delay in communication process, less information availability and proprietary implementations. A centralised topology can overcome the drawbacks of former wireless systems architecture interconnection by providing an efficient common radio communication flow with the local radio resource management entities. In this thesis a novel common radio resource management architecture is presented based on the concept of inter-working between different technologies. This is a centralised architecture where the radio frequency signals are delivered to the central location through the optical links. The new architecture is evaluated with a common policy that minimises interference while the overall system capacity is increased. The policy is implemented through the load balancing algorithm. The simulations of two radio access technologies when separately and jointly considered show that when the load balancing algorithm is applied the available throughput increases in at least 51% while the symbol error rate decreases at least 20%

    3G Wideband CDMA : packet-based optimisation for high data-rate downlink transmission

    No full text
    A third generation (3G) of mobile communication systems, based on Wideband CDMA, are intended to offer high-speed packet-based services. Network operators wish to maximise the throughput in the downlink of3G systems, which requires efficient allocation ofresources. This thesis considers the problem ofmaximising throughput in an interference dominated channel. Cooperative broadcasting is a theoretical technique to mitigate this problem. Its implementation in practical systems requires efficient resource allocati.on to maximise the thr(oughput whilst meeting system and user-imposed constramts. A resource allocation approach is presented for implementing cooperative broadcasting. Users are paired and a teclmique for allocating resources between the pair is developed. Then, a method for pairing the users is considered. Simulation results are presented, which show a throughput improvement over existing resource allocation approaches. The problem ofcontrolling the distribution ofrandomly arriving data to meet the resource allocation specifications is examined. A single-threshold buffer is proposed, which requires fewer calculations than an existing double-threshold buffer. Simulation results are presented which show a throughput improvement may be realised, greater than that which would achievable using other rate control schemes. Cooperative broadcasting may lead to transmissions to some users being allocated low power. When full channel infonnation is available at the transmitter, a water filling solution may be used to maximise capacity. However, when combined with buffer management, erasure may result. This erasure may be overcome using an erasure protection code. Such a code is examined. When combined with Turbo coding, ajoint detector may be used for providing error and erasure protection. Analysis ofthis detector shows a lower limit on the error rate, dependent on the probability of erasure. Simulation results show that using this approach the error rate is significantly improved. This code can then be used to increase capacity, whilst achieving low error rates.Imperial Users onl

    Spatio-Temporal processing for Optimum Uplink-Downlink WCDMA Systems

    Get PDF
    The capacity of a cellular system is limited by two different phenomena, namely multipath fading and multiple access interference (MAl). A Two Dimensional (2-D) receiver combats both of these by processing the signal both in the spatial and temporal domain. An ideal 2-D receiver would perform joint space-time processing, but at the price of high computational complexity. In this research we investigate computationally simpler technique termed as a Beamfom1er-Rake. In a Beamformer-Rake, the output of a beamfom1er is fed into a succeeding temporal processor to take advantage of both the beamformer and Rake receiver. Wireless service providers throughout the world are working to introduce the third generation (3G) and beyond (3G) cellular service that will provide higher data rates and better spectral efficiency. Wideband COMA (WCDMA) has been widely accepted as one of the air interfaces for 3G. A Beamformer-Rake receiver can be an effective solution to provide the receivers enhanced capabilities needed to achieve the required performance of a WCDMA system. We consider three different Pilot Symbol Assisted (PSA) beamforming techniques, Direct Matrix Inversion (DMI), Least-Mean Square (LMS) and Recursive Least Square (RLS) adaptive algorithms. Geometrically Based Single Bounce (GBSB) statistical Circular channel model is considered, which is more suitable for array processing, and conductive to RAKE combining. The performances of the Beam former-Rake receiver are evaluated in this channel model as a function of the number of antenna elements and RAKE fingers, in which are evaluated for the uplink WCDMA system. It is shown that, the Beamformer-Rake receiver outperforms the conventional RAKE receiver and the conventional beamformer by a significant margin. Also, we optimize and develop a mathematical formulation for the output Signal to Interference plus Noise Ratio (SINR) of a Beam former-Rake receiver. In this research, also, we develop, simulate and evaluate the SINR and Signal to Noise Ratio (Et!Nol performances of an adaptive beamforming technique in the WCDMA system for downlink. The performance is then compared with an omnidirectional antenna system. Simulation shows that the best perfom1ance can be achieved when all the mobiles with same Angle-of-Arrival (AOA) and different distance from base station are formed in one beam

    Code-division multiplexing

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.Includes bibliographical references (p. 395-404).(cont.) counterpart. Among intra-cell orthogonal schemes, we show that the most efficient broadcast signal is a linear superposition of many binary orthogonal waveforms. The information set is also binary. Each orthogonal waveform is generated by modulating a periodic stream of finite-length chip pulses with a receiver-specific signature code that is derived from a special class of binary antipodal, superimposed recursive orthogonal code sequences. With the imposition of practical pulse shapes for carrier modulation, we show that multi-carrier format using cosine functions has higher bandwidth efficiency than the single-carrier format, even in an ideal Gaussian channel model. Each pulse is shaped via a prototype baseband filter such that when the demodulated signal is detected through a baseband matched filter, the resulting output samples satisfy the Generalized Nyquist criterion. Specifically, we propose finite-length, time overlapping orthogonal pulse shapes that are g-Nyquist. They are derived from extended and modulated lapped transforms by proving the equivalence between Perfect Reconstruction and Generalized Nyquist criteria. Using binary data modulation format, we measure and analyze the accuracy of various Gaussian approximation methods for spread-spectrum modulated (SSM) signalling ...We study forward link performance of a multi-user cellular wireless network. In our proposed cellular broadcast model, the receiver population is partitioned into smaller mutually exclusive subsets called cells. In each cell an autonomous transmitter with average transmit power constraint communicates to all receivers in its cell by broadcasting. The broadcast signal is a multiplex of independent information from many remotely located sources. Each receiver extracts its desired information from the composite signal, which consists of a distorted version of the desired signal, interference from neighboring cells and additive white Gaussian noise. Waveform distortion is caused by time and frequency selective linear time-variant channel that exists between every transmitter-receiver pair. Under such system and design constraints, and a fixed bandwidth for the entire network, we show that the most efficient resource allocation policy for each transmitter based on information theoretic measures such as channel capacity, simultaneously achievable rate regions and sum-rate is superposition coding with successive interference cancellation. The optimal policy dominates over its sub-optimal alternatives at the boundaries of the capacity region. By taking into account practical constraints such as finite constellation sets, frequency translation via carrier modulation, pulse shaping and real-time signal processing and decoding of finite-length waveforms and fairness in rate distribution, we argue that sub-optimal orthogonal policies are preferred. For intra-cell multiplexing, all orthogonal schemes based on frequency, time and code division are equivalent. For inter-cell multiplexing, non-orthogonal code-division has a larger capacity than its orthogonalby Ceilidh Hoffmann.Ph.D

    Spatio-Temporal processing for Optimum Uplink-Downlink WCDMA Systems

    Get PDF
    The capacity of a cellular system is limited by two different phenomena, namely multipath fading and multiple access interference (MAl). A Two Dimensional (2-D) receiver combats both of these by processing the signal both in the spatial and temporal domain. An ideal 2-D receiver would perform joint space-time processing, but at the price of high computational complexity. In this research we investigate computationally simpler technique termed as a Beamfom1er-Rake. In a Beamformer-Rake, the output of a beamfom1er is fed into a succeeding temporal processor to take advantage of both the beamformer and Rake receiver. Wireless service providers throughout the world are working to introduce the third generation (3G) and beyond (3G) cellular service that will provide higher data rates and better spectral efficiency. Wideband COMA (WCDMA) has been widely accepted as one of the air interfaces for 3G. A Beamformer-Rake receiver can be an effective solution to provide the receivers enhanced capabilities needed to achieve the required performance of a WCDMA system. We consider three different Pilot Symbol Assisted (PSA) beamforming techniques, Direct Matrix Inversion (DMI), Least-Mean Square (LMS) and Recursive Least Square (RLS) adaptive algorithms. Geometrically Based Single Bounce (GBSB) statistical Circular channel model is considered, which is more suitable for array processing, and conductive to RAKE combining. The performances of the Beam former-Rake receiver are evaluated in this channel model as a function of the number of antenna elements and RAKE fingers, in which are evaluated for the uplink WCDMA system. It is shown that, the Beamformer-Rake receiver outperforms the conventional RAKE receiver and the conventional beamformer by a significant margin. Also, we optimize and develop a mathematical formulation for the output Signal to Interference plus Noise Ratio (SINR) of a Beam former-Rake receiver. In this research, also, we develop, simulate and evaluate the SINR and Signal to Noise Ratio (Et!Nol performances of an adaptive beamforming technique in the WCDMA system for downlink. The performance is then compared with an omnidirectional antenna system. Simulation shows that the best perfom1ance can be achieved when all the mobiles with same Angle-of-Arrival (AOA) and different distance from base station are formed in one beam
    corecore