Spelling suggestions: "subject:"multi antenna"" "subject:"culti antenna""
11 |
Computationally Efficient Blind-Adaptive Algorithms for Multi-Antennal SystemsBalasingam, Balakumar 12 1900 (has links)
<p>Multi-input multi-output (MIMO) systems are expected to playa crucial role in future wireless communications and a significant increase of interest in all aspects of MIMO system design has been seen in the past decade. The primary interest of this thesis is in the receiver part of the MIMO system. In this area, continuous interest has been shown in developing blind-adaptive decoding algorithms. While blind decoding algorithms improve data throughput by enabling the system de:signer to replace training symbols with data, they also tend to perform robustly against any environment disturbances, compared to their training-based counterparts. On the other hand, considering the fact that the wireless end user environment is becoming increasingly mobile, adaptive algorithms have the ability to improve the performance of a system regardless of whether it is a blind system or a training-based one. The primary difficulty faced by blind and adaptive algorithms is that they generally are computationally intense. In this thesis, we develop semi-blind and blind decoding algorithms that are adaptive in nature as well as computationally efficient for multi-antenna systems.</p> <p>First, we consider the problem of channel tracking for MIMO communication systems where the MIMO channel is time-varying. We consider a class of MIMO systems where orthogonal space-time block codes (OSTBCs) are used as the underlying space-time coding schemes. For a general MIMO system with any number of transmitting and receiving antenna combinations, a two-step MIMO channel tracking algorithm is proposed. As the first step, Kalman filtering is used to obtain an initial channel estimate for the current block based on the channel estimates obtained for previous blocks. Then, in the second step, the so-obtained initial channel estimate is refined using a decision-directed iterative method. We show that, due to specific properties of orthogonal space-time block codes, both the Kalman filter and the decision-directed algorithm can be significantly simplified. Then, we extend the above receiver for MIMO-OFDM systems and propose a computationally efficient semi-blind receiver for MIMO systems in frequency-selective channels. Further, for the proposed receivers, we have derived theoretical performance analysis in terms of probability of error. Assuming the knowledge of the transmitted symbols for the first block, we have derived the instantaneous signal to interference and noise ratio (SINR) for consecutive transmission blocks in the absence of training, by exploiting Kalman filtering to track the channel in a decision-directed mode. Later, we extend the the theoretical performance limit comparisons for time-domain vs. frequency-domain channel tracking for MIMO-OFDM systems. Further, we study the advantage of adaptive channel tracking algorithms in comptype pilot aided channel estimation schemes in practical MIMO-OFDM systems.</p> <p>After that, an efficient sequential Monte-Carlo (SMC) algorithm is developed for blind detection in MIMO systems where OSTBCs are used as the underlying space-time coding scheme. The proposed algorithm employs Rao-Blackwellization strategy to marginalize out the (unwanted) channel coefficients and uses optimal importance function to generate samples to propagate the posterior distribution. The algorithm is blind in the sense that, unlike the earlier ones, the transmission of training symbols is not required by this scheme. The marginalization involves the computation of (hundreds of) Kalman filters running in parallel resulting in intense computer requirement. We show that, the marginalization step can be significantly simplified for the speci1ied problem under no additional assumptions - resulting in huge computational savings. Further, we extend this result to frequency selective channels and propose a novel and efficient SMC receiver for MIMO-OFDM systems.</p> <p>Finally, a novel adaptive algorithm is presented for directional MIMO systems. Specifically, the problem of direction of arrivall (DOA) tracking of an unknown time-varying number of mobile sources is considered. The challenging part of the problem is the unknown, time-varying number of sources that demand a combination of source enumeration techniques and sequential state estimation methods to track the time-varying number of DOAs. In this thesis, we transform the problem into a novel state-space model, and, by employing probability hypothesis density (PHD) filtering technique, propose a simple algorithm that is able to track the number of sources as well as the corresponding directions of arrivals. In addition to the fact that the proposed algorithm is simple and easier to implement, simulation results show that, the PHD implementation yields superior performance over competing schemes in tracking rapidly varying number of targets.</p> / Doctor of Philosophy (PhD)
|
12 |
Multi-antenna Relay Beamforming with Per-antenna Power ConstraintsXiao, Qiang 27 November 2012 (has links)
Multi-antenna relay beamforming is a promising candidate in the next generation wireless communication systems. The assumption of sum power constraint at the relay in previous work is often unrealistic in practice, since each antenna of the relay is limited by its own front-end power amplifier and thus has its own individual power constraint. In this thesis, given per-antenna power constraints, we obtain the semi-closed form solution for the optimal relay beamforming design in the two-hop amplify-and-forward relay beamforming and establish its duality with the point-to-point single-input multiple-output (SIMO) beamforming system. Simulation results show that the per-antenna power constraint case has much lower per-antenna peak power and much smaller variance of per-antenna power usage than the sum-power constraint case. A heuristic iterative algorithm to minimize the total power of relay network is proposed.
|
13 |
Multi-antenna Relay Beamforming with Per-antenna Power ConstraintsXiao, Qiang 27 November 2012 (has links)
Multi-antenna relay beamforming is a promising candidate in the next generation wireless communication systems. The assumption of sum power constraint at the relay in previous work is often unrealistic in practice, since each antenna of the relay is limited by its own front-end power amplifier and thus has its own individual power constraint. In this thesis, given per-antenna power constraints, we obtain the semi-closed form solution for the optimal relay beamforming design in the two-hop amplify-and-forward relay beamforming and establish its duality with the point-to-point single-input multiple-output (SIMO) beamforming system. Simulation results show that the per-antenna power constraint case has much lower per-antenna peak power and much smaller variance of per-antenna power usage than the sum-power constraint case. A heuristic iterative algorithm to minimize the total power of relay network is proposed.
|
14 |
On delay-sensitive communication over wireless systemsLiu, Lingjia 15 May 2009 (has links)
This dissertation addresses some of the most important issues in delay-sensitive
communication over wireless systems and networks. Traditionally, the design of communication
networks adopts a layered framework where each layer serves as a “black
box” abstraction for higher layers. However, in the context of wireless networks with
delay-sensitive applications such as Voice over Internet Protocol (VoIP), on-line gaming,
and video conferencing, this layered architecture does not offer a complete picture.
For example, an information theoretic perspective on the physical layer typically ignores
the bursty nature of practical sources and often overlooks the role of delay in
service quality. The purpose of this dissertation is to take on a cross-disciplinary
approach to derive new fundamental limits on the performance, in terms of capacity
and delay, of wireless systems and to apply these limits to the design of practical
wireless systems that support delay-sensitive applications. To realize this goal, we
consider a number of objectives.
1. Develop an integrated methodology for the analysis of wireless systems that
support delay-sensitive applications based, in part, on large deviation theory.
2. Use this methodology to identify fundamental performance limits and to design
systems which allocate resources efficiently under stringent service requirements.
3. Analyze the performance of wireless communication networks that takes advantage of novel paradigms such as user cooperation, and multi-antenna systems.
Based on the proposed framework, we find that delay constraints significantly
influence how system resources should be allocated. Channel correlation has a major
impact on the performance of wireless communication systems. Sophisticated power
control based on the joint space of channel and buffer states are essential for delaysensitive
communications.
|
15 |
Convex optimization based resource allocation in multi-antenna systemsShashika Manosha Kapuruhamy Badalge, . () 29 December 2017 (has links)
Abstract
The use of multiple antennas is a fundamental requirement in future wireless networks as it helps to increase the reliability and spectral efficiency of mobile radio links. In this thesis, we study convex optimization based radio resource allocation methods for the downlink of multi-antenna systems.
First, the problem of admission control in the downlink of a multicell multiple-input single-output (MISO) system has been considered. The objective is to maximize the number of admitted users subject to a signal-to-interference-plus-noise ratio (SINR) constraint at each admitted user and a transmit power constraint at each base station (BS). We have cast the admission control problem as an ℓ0 minimization problem; it is known to be combinatorial, NP-hard. Centralized and distributed algorithms to solve this problem have been proposed. To develop the centralized algorithm, we have used sequential convex programming (SCP). The distributed algorithm has been derived by using the consensus-based alternating direction method of multipliers in conjunction with SCP. We have shown numerically that the proposed admission control algorithms achieve a near-to-optimal performance. Next, we have extended the admission control problem to provide fairness, where long-term fairness among the users has been guaranteed. We have focused on proportional and max-min fairness, and proposed dynamic control algorithms via Lyapunov optimization. Results show that these proposed algorithms guarantee fairness.
Then, the problem of admission control for the downlink of a MISO heterogeneous networks (hetnet) has been considered, and the proposed centralized and distributed algorithms have been adapted to find a solution. Numerically, we have illustrated that the centralized algorithm achieves a near-to-optimal performance, and the distributed algorithm’s performance is closer to the optimal value.
Finally, an algorithm to obtain the set of all achievable power-rate tuples for a multiple-input multiple-output hetnet has been provided. The setup consists of a single macrocell and a set of femtocells. The interference power to the macro users from the femto BSs has been kept below a threshold. To find the set of all achievable power-rate tuples, a two-dimensional vector optimization problem is formulated, where we have considered maximizing the sum-rate while minimizing the sum-power, subject to maximum power and interference threshold constraints. This problem is known to be NP-hard. A solution method is provided by using the relationship between the weighted sum-rate maximization and weighted-sum-mean-squared-error minimization problems. The proposed algorithm was used to evaluate the impact of imposing interference threshold constraints and the co-channel deployments in a hetnet. / Tiivistelmä
Monen antennin käyttö on perusvaatimus tulevissa langattomissa verkoissa, koska se auttaa lisäämään matkaviestinyhteyksien luotettavuutta ja spektritehokkuutta. Tässä väitöskirjassa tutkitaan konveksiin optimointiin perustuvia radioresurssien allokointimenetelmiä moniantennijärjestelmien alalinkin suunnassa.
Ensiksi on käsitelty pääsynvalvonnan ongelmaa alalinkin suuntaan monen solun moni-tulo yksi-lähtö (MISO) -verkoissa. Tavoitteena on maksimoida hyväksyttyjen käyttäjien määrä, kun hyväksytyille käyttäjille on asetettu signaali-häiriö-kohinasuhteen (SINR) rajoitus, ja tukiasemille lähetystehon rajoitus. Pääsynvalvonnan ongelma on muotoiltu ℓ0-minimointiongelmana, jonka tiedetään olevan kombinatorinen, NP-vaikea ongelma. Ongelman ratkaisemiseksi on ehdotettu keskitettyjä ja hajautettuja algoritmeja. Keskitetty optimointialgoritmi perustuu sekventiaaliseen konveksiin optimointiin. Hajautettu algoritmi pohjautuu konsensusoptimointimenetelmään ja sekventiaaliseen konveksiin optimointiin. Ehdotettujen pääsynvalvonta-algoritmien on numeerisesti osoitettu saavuttavan lähes optimaalinen suorituskyky. Lisäksi pääsynvalvontaongelma on laajennettu takaamaan pitkän aikavälin oikeudenmukaisuus käyttäjien välillä. Työssä käytetään erilaisia määritelmiä oikeudenmukaisuuden takaamiseen, ja ehdotetaan dynaamisia algoritmeja pohjautuen Lyapunov-optimointiin. Tulokset osoittavat, että ehdotetuilla algoritmeilla taataan käyttäjien välinen oikeudenmukaisuus.
Tämän jälkeen käsitellään heterogeenisen langattoman MISO-verkon pääsynvalvonnan ongelmaa. Edellä ehdotettuja keskitettyjä ja hajautettuja algoritmeja on muokattu tämän ongelman ratkaisemiseksi. Työssä osoitetaan numeerisesti, että sekä keskitetyllä että hajautetulla algoritmilla saavutetaan lähes optimaalinen suorituskyky.
Lopuksi on laadittu algoritmi, jolla löydetään kaikki saavutettavissa olevat teho-datanopeusparit heterogeenisessä langattomassa moni-tulo moni-lähtö (MIMO) -verkossa. Verkko koostuu yhdestä makrosolusta ja useasta piensolusta. Piensolutukiasemista makrokäyttäjiin kohdistuvan häiriön teho on pidetty tietyn rajan alapuolella. Kaikkien saavutettavien teho-datanopeusparien löytämiseksi on laadittu kaksiulotteinen vektorioptimointiongelma, jossa maksimoidaan summadatanopeus pyrkien minimoimaan kokonaisteho, kun enimmäisteholle ja häiriökynnykselle on asetettu rajoitukset. Tämän ongelman tiedetään olevan NP-vaikea. Ongelman ratkaisemiseksi käytetään painotetun summadatanopeuden maksimointiongelman, ja painotetun keskineliövirheen minimointiongelman välistä suhdetta. Ehdotettua algoritmia käytettiin arvioimaan häiriörajoitusten ja saman kanavan käyttöönoton vaikutusta heterogeenisessä langattomassa verkossa.
|
16 |
Multi-Antenna Communication Receivers Using Metaheuristics and Machine Learning AlgorithmsNagaraja, Srinidhi January 2013 (has links) (PDF)
In this thesis, our focus is on low-complexity, high-performance detection algorithms for multi-antenna communication receivers. A key contribution in this thesis is the demonstration that efficient algorithms from metaheuristics and machine learning can be gainfully adapted for signal detection in multi- antenna communication receivers. We first investigate a popular metaheuristic known as the reactive tabu search (RTS), a combinatorial optimization technique, to decode the transmitted signals in large-dimensional communication systems. A basic version of the RTS algorithm is shown to achieve near-optimal performance for 4-QAM in large dimensions. We then propose a method to obtain a lower bound on the BER performance of the optimal detector. This lower bound is tight at moderate to high SNRs and is useful in situations where the performance of optimal detector is needed for comparison, but cannot be obtained due to very high computational complexity. To improve the performance of the basic RTS algorithm for higher-order modulations, we propose variants of the basic RTS algorithm using layering and multiple explorations. These variants are shown to achieve near-optimal performance in higher-order QAM as well.
Next, we propose a new receiver called linear regression of minimum mean square error (MMSE) residual receiver (referred to as LRR receiver). The proposed LRR receiver improves the MMSE receiver by learning a linear regression model for the error of the MMSE receiver. The LRR receiver uses pilot data to estimate the channel, and then uses locally generated training data (not transmitted over the channel) to find the linear regression parameters. The LRR receiver is suitable for applications where the channel remains constant for a long period (slow-fading channels) and performs well. Finally, we propose a receiver that uses a committee of linear receivers, whose parameters are estimated from training data using a variant of the AdaBoost algorithm, a celebrated supervised classification algorithm in ma- chine learning. We call our receiver boosted MMSE (B-MMSE) receiver. We demonstrate that the performance and complexity of the proposed B-MMSE receiver are quite attractive for multi-antenna communication receivers.
|
17 |
The optimization of multiple antenna broadband wireless communications : a study of propagation, space-time coding and spatial envelope correlation in Multiple Input, Multiple Output radio systemsDia'meh, Yousef Ali January 2013 (has links)
This work concentrates on the application of diversity techniques and space time block coding for future mobile wireless communications. The initial system analysis employs a space-time coded OFDM transmitter over a multipath Rayleigh channel, and a receiver which uses a selection combining diversity technique. The performance of this combined scenario is characterised in terms of the bit error rate and throughput. A novel four element QOSTBC scheme is introduced, it is created by reforming the detection matrix of the original QOSTBC scheme, for which an orthogonal channel matrix is derived. This results in a computationally less complex linear decoding scheme as compared with the original QOSTBC. Space time coding schemes for three, four and eight transmitters were also derived using a Hadamard matrix. The practical optimization of multi-antenna networks is studied for realistic indoor and mixed propagation scenarios. The starting point is a detailed analysis of the throughput and field strength distributions for a commercial dual band 802.11n MIMO radio operating indoors in a variety of line of sight and non-line of sight scenarios. The physical model of the space is based on architectural schematics, and realistic propagation data for the construction materials. The modelling is then extended and generalized to a multi-storey indoor environment, and a large mixed site for indoor and outdoor channels based on the Bradford University campus. The implications for the physical layer are also explored through the specification of antenna envelope correlation coefficients. Initially this is for an antenna module configuration with two independent antennas in close proximity. An operational method is proposed using the scattering parameters of the system and which incorporates the intrinsic power losses of the radiating elements. The method is extended to estimate the envelope correlation coefficient for any two elements in a general (N,N) MIMO antenna array. Three examples are presented to validate this technique, and very close agreement is shown to exist between this method and the full electromagnetic analysis using the far field antenna radiation patterns.
|
18 |
Conception de systèmes multi-antennaires pour techniques de diversité et MIMO : application aux petits objets nomades communicants / Design of multi-antenna systems for diversity and MIMO techniques : applications to small communicating devicesDioum, Ibra 12 December 2013 (has links)
La demande de transmissions à débits de plus en plus élevés s’accentue davantage avec l’essor de nouveaux services dans les réseaux de communication sans fils. Pour répondre à cette demande, une solution consiste à augmenter la capacité de transmission du canal radiofréquence entre la station de base et le terminal portatif. Ceci peut être réalisé en augmentant le nombre d’éléments rayonnant impliqués à l’émission et à la réception de cette liaison radiofréquence : on parle alors de technique MIMO (Multiple Input, Multiple Output). Cette thèse porte principalement sur la conception, l’optimisation et la caractérisation de systèmes multi-antennaires pour techniques de diversité et MIMO en bandes LTE (Long Term Evolution). Trois prototypes multi-bandes sont proposés dont deux systèmes planaires et un système d’antennes IFAs compactes. De nouvelles solutions multi-bandes et l’influence de la position de l’antenne sur le plan de masse sont étudiées pour réaliser de la diversité spatiale, de polarisation et de diagramme de rayonnement avec une faible corrélation entre les signaux reçus sur chaque antenne mais surtout une bonne efficacité totale. Une ligne de neutralisation est utilisée pour isoler les antennes et un fonctionnement multi-bande est réalisé. L’impédance d’entrée des antennes est étudiée avec la méthode de Youla & Carlin afin d’améliorer la bande passante de la structure compacte de type IFA. Les performances en diversité et en MIMO de ces systèmes sont évaluées dans différents environnements de propagation. Elles montrent que ces systèmes peuvent être utilisés efficacement pour des applications en diversité et MIMO. / The transmission demand for increasing data rate becomes more and more important with the development of new services in radio communication networks. To answer to this demand, one solution consists in increasing the transmission capacity of the radio channel between the base station and the handset terminal. This can be realized by increasing the number of radiating elements involved in the transmission and the reception of this radio link: we talk about MIMO (Multiple Input Multiple Output) technique. The work realized in this thesis concerns mainly design, optimization and characterization of multi-antenna systems for MIMO and diversity techniques in LTE (Long Term Evolution) bands. Three multi bands prototypes are proposed whose two planar systems and one compact IFAs antennas system. News multiband solution and antenna position influence on the PCB were studied to realize spatial, polarization and pattern diversity with low correlation between received signals on each antenna and a good efficiency. The neutralization line was used for antennas isolation and its application in multiband was realized. The antenna load impedance has been studied with Youla & Carlin method in order to improve the frequency bandwidth of the compact IFA structure. Diversity and MIMO performances of these systems were evaluated in different propagation environments. They show that these systems can be effectively used for diversity and MIMO application.
|
19 |
Low-Complexity Receiver Algorithms in Large-Scale Multiuser MIMO Systems and Generalized Spatial ModulationDatta, Tanumay January 2013 (has links) (PDF)
Multi-antenna wireless systems have become very popular due to their theoretically predicted higher spectral efficiencies and improved performance compared to single-antenna systems. Large-scale multiple-input multiple-output (MIMO) systems refer to wireless systems where communication terminals employ tens to hundreds of antennas to achieve in-creased spectral efficiencies/sum rates, reliability, and power efficiency. Large-scale multi-antenna systems are attractive to meet the increasing wireless data rate requirements, without compromising on the bandwidth. This thesis addresses key signal processing issues in large-scale MIMO systems. Specifically, the thesis investigates efficient algorithms for signal detection and channel estimation in large-scale MIMO systems. It also investigates ‘spatial modulation,’ a multi-antenna modulation scheme that can reduce the number of transmit radio frequency (RF) chains, without compromising much on the spectral efficiency. The work reported in this thesis is comprised of the following two parts:
1 investigation of low-complexity receiver algorithms based on Markov chain Monte Carlo (MCMC) technique, tabu search, and belief propagation for large-scale uplink multiuser MIMO systems, and
2 investigation of achievable rates and signal detection in generalized spatial modulation.
1. Receiver algorithms for large-scale multiuser MIMO systems on the uplink In this part of the thesis, we propose low-complexity algorithms based on MCMC techniques, Gaussian sampling based lattice decoding (GSLD), reactive tabu search (RTS), and factor graph based belief propagation (BP) for signal detection on the uplink in large-scale multiuser MIMO systems. We also propose an efficient channel estimation scheme based on Gaussian sampling.
Markov chain Monte Carlo (MCMC) sampling: We propose a novel MCMC based detection algorithm, which achieves near-optimal performance in large dimensions at low complexities by the joint use of a mixed Gibbs sampling (MGS) strategy and a multiple restart strategy with an efficient restart criterion. The proposed mixed Gibbs sampling distribution is a weighted mixture of the target distribution and uniform distribution. The presence of the uniform component in the sampling distribution allows the algorithm to exit from local traps quickly and alleviate the stalling problem encountered in conventional Gibbs sampling. We present an analysis for the optimum choice of the mixing ratio. The analysis approach is to define an absorbing Markov chain and use its property regarding the expected number of iterations needed to reach the global minima for the first time. We also propose an MCMC based algorithm which exploits the sparsity in uplink multiuser MIMO transmissions, where not all users are active simultaneously. Gaussian sampling based lattice decoding: Next, we investigate the problem of searching the closest lattice point in large dimensional lattices and its use in signal detection in large-scale MIMO systems. Specifically, we propose a Gaussian sampling based lattice decoding (GSLD) algorithm. The novelty of this algorithm is that, instead of sampling from a discrete distribution as in Gibbs sampling, the algorithm iteratively generates samples from a continuous Gaussian distribution, whose parameters are obtained analytically. This makes the complexity of the proposed algorithm to be independent of the size of the modulation alpha-bet. Also, the algorithm is able to achieve near-optimal performance for different antenna and modulation alphabet settings at low complexities. Random restart reactive tabu search (R3TS): Next, we study receiver algorithms based on reactive tabu search (RTS) technique in large-scale MIMO systems. We propose a multiple random restarts based reactive tabu search (R3TS) algorithm that achieves near-optimal performance in large-scale MIMO systems. A key feature of the proposed R3TS algorithm is its performance based restart criterion, which gives very good performance-complexity tradeoff in large-dimension systems. Lower bound on maximum likelihood (ML) bit error rate (BER) performance: We propose an approach to obtain lower bounds on the ML performance of large-scale MIMO systems using RTS simulation. In the proposed approach, we run the RTS algorithm using the transmitted vector as the initial vector, along with a suitable neighborhood definition, and find a lower bound on number of errors in ML solution. We demonstrate that the proposed bound is tight (within about 0.5 dB of the optimal performance in a 16×16MIMO system) at moderate to high SNRs. Factor graph using Gaussian approximation of interference (FG-GAI): Multiuser MIMO channels can be represented by graphical models that are fully/densely connected (loopy graphs), where conventional belief propagation yields suboptimal performance and requires high complexity. We propose a solution to this problem that uses a simple, yet effective, Gaussian approximation of interference (GAI) approach that carries out a linear per-symbol complexity message passing on a factor graph (FG) based graphical model. The proposed algorithm achieves near-optimal performance in large dimensions in frequency-flat as well as frequency-selective channels. Gaussian sampling based channel estimation: Next, we propose a Gaussian sampling based channel estimation technique for large-scale time-division duplex (TDD) MIMO systems. The proposed algorithm refines the initial estimate of the channel by iteratively detecting the data block and using that knowledge to improve the estimated channel knowledge using a Gaussian sampling based technique. We demonstrate that this algorithm achieves near-optimal performance both in terms of mean square error of the channel estimates and BER of detected data in both frequency-flat and frequency-selective channels.
2. Generalized spatial modulation In the second part of the thesis, we investigate generalized spatial modulation (GSM) in point-to point MIMO systems. GSM is attractive because of its ability to work with less number of transmit RF chains compared to traditional spatial multiplexing, without com-promising much on spectral efficiency. In this work, we show that, by using an optimum combination of number of transmit antennas and number of transmit RF chains, GSM can achieve better throughput and/or BER than spatial multiplexing. We compute tight bounds on the maximum achievable rate in a GSM system, and quantify the percentage savings in the number of transmit RF chains as well as the percentage increase in the rate achieved in GSM compared to spatial multiplexing. We also propose a Gibbs sampling based algorithm suited to detect GSM signals, which yields impressive BER performance and complexity results.
|
20 |
A Calibration Method for a Controlled Reception Pattern Antenna and Software Defined Radio ConfigurationBauer, Zachary Obenour 12 June 2013 (has links)
No description available.
|
Page generated in 0.0755 seconds