8,685 research outputs found

    Power allocation and user selection in multi-cell: multi-user massive MIMO systems

    Get PDF
    Submitted in fulfilment of the academic requirements for the degree of Master of Science (Msc) in Engineering, in the School of Electrical and Information Engineering (EIE), Faculty of Engineering and the Built Environment, at the University of the Witwatersrand, Johannesburg, South Africa, 2017The benefits of massive Multiple-Input Multiple-Output (MIMO) systems have made it a solution for future wireless networking demands. The increase in the number of base station antennas in massive MIMO systems results in an increase in capacity. The throughput increases linearly with an increase in number of antennas. To reap all the benefits of massive MIMO, resources should be allocated optimally amongst users. A lot of factors have to be taken into consideration in resource allocation in multi-cell massive MIMO systems (e.g. intra-cell, inter-cell interference, large scale fading etc.) This dissertation investigates user selection and power allocation algorithms in multi-cell massive MIMO systems. The focus is on designing algorithms that maximizes a particular cell of interest’s sum rate capacity taking into consideration the interference from other cells. To maximize the sum-rate capacity there is need to optimally allocate power and select the optimal number of users who should be scheduled. Global interference coordination has very high complexity and is infeasible in large networks. This dissertation extends previous work and proposes suboptimal per cell resource allocation models that are feasible in practice. The interference is introduced when non-orthogonal pilots are used for channel estimation, resulting in pilot contamination. Resource allocation values from interfering cells are unknown in per cell resource allocation models, hence the inter-cell interference has to be modelled. To tackle the problem sum-rate expressions are derived to enable power allocation and user selection algorithm analysis. The dissertation proposes three different approaches for solving resource allocation problems in multi-cell multi-user massive MIMO systems for a particular cell of interest. The first approach proposes a branch and bound algorithm (BnB algorithm) which models the inter-cell interference in terms of the intra-cell interference by assuming that the statistical properties of the intra-cell interference in the cell of interest are the same as in the other interfering cells. The inter-cell interference is therefore expressed in terms of the intra-cell interference multiplied by a correction factor. The correction factor takes into consideration pilot sequences used in the interfering cells in relation to pilot sequences used in the cell of interest and large scale fading between the users in the interfering cells and the users in the cell of interest. The resource allocation problem is modelled as a mixed integer programming problem. The problem is NP-hard and cannot be solved in polynomial time. To solve the problem it is converted into a convex optimization problem by relaxing the user selection constraint. Dual decomposition is used to solve the problem. In the second approach (two stage algorithm) a mathematical model is proposed for maximum user scheduling in each cell. The scheduled users are then optimally allocated power using the multilevel water filling approach. Finally a hybrid algorithm is proposed which combines the two approaches described above. Generally in the hybrid algorithm the cell of interest allocates resources in the interfering cells using the two stage algorithm to obtain near optimal resource allocation values. The cell of interest then uses these near optimal values to perform its own resource allocation using the BnB algorithm. The two stage algorithm is chosen for resource allocation in the interfering cells because it has a much lower complexity compared to the BnB algorithm. The BnB algorithm is chosen for resource allocation in the cell of interest because it gives higher sum rate in a sum rate maximization problem than the two stage algorithm. Performance analysis and evaluation of the developed algorithms have been presented mainly through extensive simulations. The designed algorithms have also been compared to existing solutions. In general the presented results demonstrate that the proposed algorithms perform better than the existing solutions.XL201

    Air quality evaluation of London Paddington train station

    Get PDF
    Enclosed railway stations hosting diesel trains are at risk of reduced air quality as a result of exhaust emissions that may endanger passengers and workers. Air quality measurements were conducted inside London Paddington Station, a semi-enclosed railway station where 70% of trains are powered by diesel engines. Particulate matter (PM2.5) mass was measured at five station locations. PM size, PM number, oxides of nitrogen (NOx), and sulfur dioxide (SO2) were measured at two station locations. Paddington Station’s hourly mean PM2.5 mass concentrations averaged 16 μg/m3 [min 2, max 68]. Paddington Station’s hourly mean NO2 concentrations averaged 73 ppb [49, 120] and SO2 concentrations averaged 25 ppb [15, 37]. While UK train stations are not required to comply with air quality standards, there were five instances where the hourly mean NO2 concentrations exceeded the EU hourly mean limits (106 ppb) for outdoor air quality. PM2.5, SO2, and NO2 concentrations were compared against Marylebone, a busy London roadside 1.5 km from the station. The comparisons indicated that train station air quality was more polluted than the nearby roadside. PM2.5 for at least one measurement location within Paddington Station was shown to be statistically higher (P-value < 0.05) than Marylebone on 3 out of 4 days. Measured NO2 within Paddington Station was statistically higher than Marylebone on 4 out of 5 days. Measured SO2 within Paddington Station was statistically higher than Marylebone on all 3 days.We thank the Engineering and Physical Sciences Research Council (EP/F034350/1) for funding the Energy Efficient Cities Initiative and the Schiff Foundation for doctoral studentship funding.This is the final version of the article. It first appeared from IOP via http://dx.doi.org/10.1088/1748-9326/10/9/09401

    The Radical Psychiatrist as Trickster

    Get PDF

    Computing shortest paths in 2D and 3D memristive networks

    Full text link
    Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest path solution is perhaps that of a traditional labyrinth or maze with a single entrance and exit. Many techniques and algorithms have been derived to solve mazes, which often tend to be computationally demanding, especially as the size of maze and number of paths increase. In addition, they are not suitable for performing multiple shortest path computations in mazes with multiple entrance and exit points. Mazes have been proposed to be solved using memristive networks and in this paper we extend the idea to show how networks of memristive elements can be utilised to solve multiple shortest paths in a single network. We also show simulations using memristive circuit elements that demonstrate shortest path computations in both 2D and 3D networks, which could have potential applications in various fields

    The Real You: Paddington Markets and the Postmodern Search for the Self

    Get PDF
    Paddington Markets, located on the grounds of the Paddington Uniting Church every Saturday, are defined by their emphasis on the ‘Natural’, the ‘Original’, the ‘Organic’ and the ‘Vintage’, all designed to appeal to our sense of authenticity in regards to our own identity.  However, in an era of conflicting modern and postmodern ideas about the nature of reality and representation, identity is fast becoming a victim of uncertainty. So what does it mean to be an individual in today’s society?  Is it ever possible to ‘be yourself’?  Today, the struggle to find a unique identity is becoming increasingly pressing yet increasingly difficult.  Paddington Markets embodies the way in which the search for identity is undertaken through consumerism, through its emphasis on the ‘authentic’ qualities of its products. This article will examine the way in which modernism and postmodernism have shaped the way we conceptualise reality, representation, the subject and identity, and the ways in which consumerism has adapted to suit the changing ideas of these two traditions.  Through the theories of Baudrillard, Lyotard, Hall, Marx and with a little bit of help from Bon Jovi, the question of what identity means in a consumer society is explored through Paddington Markets

    Determining A Proper Test for Inherent Distinctiveness in Trade Dress

    Get PDF

    Node and Place, a study on the spatial process of railway terminus area redevelopment in central London

    Get PDF
    Bertolini and Spit (1998) have argued that any significant transport node should ideally also be a significant place in the city. However, this rarely seems to be the case, and the resolution of this disparity, which they refer to as the 'node-place' problem, in practice means redesigning what are currently regional-to-local transport nodes to also function as local pedestrian nodes. This is a complex design task, made more difficult by the fact that termini, although often located in strategic inner urban areas, are also frequently scarred by railway structures and adjacent to large wastelands or blighted neighbourhoods. Not surprisingly, there are as yet few success stories, and conversely many cases where attempts to address this problem through design have fallen below expectations. This problem, of converting railway termini and their surrounding areas into urban places, is the subject of this thesis. The argument proposes that the ‘node-place’ problem is fundamentally a spatial one. Using the methodology of space syntax, together with Hillier's compound theories of how vibrant urban places are progressively formed by the influence of the urban grid on natural movement (Hillier et al 1993 ), and the subsequent influence this has on land use patterns (Hillier 1996 ) and centre formation (Hillier 2000 ), the thesis investigates the spatial structure and functioning of eleven mainline railway terminus areas in central London. This is undertaken through a series of studies of increasing precision: historical figure-ground analyses of station areas; syntactic analysis of station contexts and the influence of the station on that context; detailed observation of movement patterns and rates in station contexts; and finally the synthesis of all data types into a single picture. On the basis of the results of these studies, it is argued that the key to the successful creation of an urban place out of a transport node is the same as that which prevails in cities in general; namely that spatial configuration is critical, and that the spaces inside and outside railway termini have to become an 'integrated part' of the local system of pedestrian movement. In order to achieve this, space has to be re-engineered to overcome the current tendency of stations to work as urban 'negative attractors' through the effect of the large blockages they impose on the development of local patterns of natural movement, in spite of the station being in itself a 'point attractor'. A node can become a place when it also becomes a 'configurational attractor' in the local network

    Modelling train delays with q-exponential functions

    Get PDF
    We demonstrate that the distribution of train delays on the British railway network is accurately described by q-exponential functions. We explain this by constructing an underlying superstatistical model.Comment: 12 pages, 5 figure
    corecore