Space-time codes (STC) are a class of signaling techniques, offering coding and diversity gains along with improved spectral efficiency. These codes exploit both the spatial and the temporal diversity of the wireless link by combining the design of the error correction code, modulation scheme and array processing. STC are well suited for improving the downlink performance, which is the bottleneck in asymmetric applications such as downstream Internet. Three original contributions to the area of STC are presented in this dissertation. First, the development of analytic tools that determine the fundamental limits on the performance of STC in a variety of channel conditions. For trellis-type STC, transfer function based techniques are applied to derive performance bounds over Rayleigh, Rician and correlated fading environments. For block-type STC, an analytic framework that supports various complex orthogonal designs with arbitrary signal cardinalities and array configurations is developed. In the second part of the dissertation, the Virginia Tech Space-Time Advanced Radio (VT-STAR) is designed, introducing a multi-antenna hardware laboratory test bed, which facilitates characterization of the multiple-input multiple-output (MIMO) channel and validation of various space-time approaches. In the third part of the dissertation, two novel space-time architectures paired with iterative processing principles are proposed. The first extends the suitability of STC to outdoor wireless communications by employing iterative equalization/decoding for time dispersive channels and the second employs iterative interference cancellation/decoding to solve the error propagation problem of Bell-Labs Layered Space-Time Architecture (BLAST). Results show that remarkable energy and spectral efficiencies are achievable by combining concepts drawn from space-time coding, multiuser detection, array processing and iterative decoding. / Ph. D.

Wireless systems are rapidly developing to provide high speed voice, text and multimedia messaging services which were traditionally offered by wire line networks. To support these services, channels with large capacities are required. Information theoretic investigations have shown that Multiple Input Multiple Output (MIMO) channels can achieve very high capacities. Space-Time Block Coding (STBC) and Bell Labs Layered Space-Time Architecture (BLAST) are two potential schemes which utilize the diversity offered by MIMO channels to provide reliable high date rate wireless communication. This work studies the sensitivity of these two schemes to spatial correlation in MIMO channels. The first part of the thesis studies the effect of spatial correlation on the performance of STBC by using Geometrically Based Single Bounce MIMO (GBSB-MIMO) channel models. Performance is analyzed for two scenarios: one without scatterers in the vicinity of the transmitter and other with scatterers. In the second part of the thesis, the sensitivity of BLAST to spatial correlation is analyzed. Later, schemes which use the principles of Multilayered Space-Time Coded Modulation to combine the benefits of BLAST and STBC are introduced and their performance is investigated in correlated and uncorrelated Rayleigh fading. Results indicate that schemes using orthogonal design space-time block codes are reasonably robust to spatial correlation while schemes like BLAST are very sensitive as they depend on array processing to separate signals from various transmit antennas. / Master of Science

This thesis discuss on new technique called space time block coding (especially Alamouti's code) which is used to increase capacity and reliability of data transmission over time varying multi-path fading channel. The over all work of the thesis included in the following four chapters. In chapter-1 we are going to cover some theoretical part which is useful to understand thesis work and in chapter-2 we will discuss the comparison between simple space time block code (Alamouti's code) and MRRC (Maximum Ratio Receiver Combining) which is receiver diversity and then in chapter-3 we will see the channel capacity & probability error performance for 2x2 Alamouti code over Rayleigh and Rice fading channel .Finally the conclusion and further work included in chapter-4.

<p>In this thesis a H.264 baseline high definition encoder is implemented on CELL processor. The target video sequence is YUV420 1080p at 30 frames per second in our encoder. To meet real-time requirements, a system architecture which reduces DMA requests is designed for large memory accessing. Several key computing kernels: Intra frame encoding, motion estimation searching and entropy coding are designed and ported to CELL processor units. A main challenge is to find a good tradeoff between DMA latency and processing time. The limited 256K bytes on-chip memory of SPE has to be organized efficiently in SIMD way. CAVLC is performed in non-real-time on the PPE.</p><p> </p><p>The experimental results show that our encoder is able to encode I frame in high quality and encode common 1080p video sequences in real-time. With the using of five SPEs and 63KB executable code size, 20.72M cycles are needed to encode one P frame partitions for one SPE. The average PSNR of P frames increases a maximum of 1.52%. In the case of fast speed video sequence, 64x64 search range gets better frame qualities than 16x16 search range and increases only less than two times computing cycles of 16x16. Our results also demonstrate that more potential power of the CELL processor can be utilized in multimedia computing.</p><p> </p><p>The H.264 main profile will be implemented in future phases of this encoder project. Since the platform we use is IBM Full-System Simulator, DMA performance in a real CELL processor is an interesting issue. Real-time entropy coding is another challenge to CELL.</p>

The overall aim of this thesis is to describe and analyse the age-related life experiences of elderly retired people and in relation to this to problematise ageism as an analytical concept in order to present a more dynamic understanding of the phenomenon of ageism in everyday life. Related to the overall objective three overarching research questions are addressed. How do elderly individuals relate to “age” in life and how do they express this in contexts in which standpoints are made in relation to age-codes? What can be generally said to represent the foundation of elderly people’s experiences of ageism? What all-embracing picture of ageism and age-coding is made visible when the phenomenon is examined using different kinds of methods for collecting and analysing empirical material? Research within the field of ageism is presented in terms of how it has been examined: as an ideology, as an “ideology” that is possible to deconstruct and as manifestations in everyday life. The hegemonic way of defining ageism is to associate it with prejudice, stereotyping and discriminationbased on age. This is viewed to be insufficient in order to understand ageism in everyday life. The positioning of the thesis in relation to the research field is therefore seen as problematising ageism as an analytical concept. The thesis consists of three different studies that are based on three different empirical materials. Life-stories, a questionnaire and focus group interviews are used to collect empirical material on the subject of elderly people’s age-related life experiences. The empirical materials and the studies connected to them are distinct ways of investigating ageism. Tentatively, methodtriangulation is applied in order to analyse the topic of ageism in everyday life from differenttheoretical perspectives. The most important conclusion is that ageism can be understood more dynamically as a practise that is exceptionally close to us individuals in everyday life. It is suggested that ageism is not only associated to age. Informants use alternative age-markers or time-markers in relation to which theyascribe meaning. When individuals tell their life-story the experiences are for example not tied to age. Age is hardly ever mentioned. In its place meaning is constructed around and ascribed to timemarkers such as for example “young”, “old”, “year”, “month”, “elderly” and so on. The use of and ascription of meaning to time-markers is also applicable in the other studies in the thesis. These alternative time-markers are suggested as something that also indicate ageism. Experiences and meaning are not solely focused on age. However, the meaning constructed in relation to the alternative markers is not unanimous, even if it sometimes appears to be. The experienced meaning takes many different forms and can by no means be fixated once and for all. An important conclusion is also that we cannot disregard gender in the understanding of ageism. It seems imperative to practice intersectional reasoning in order to understand the dynamics of ageism. Gendered ageism or gendered time-coding is essential in comprehending what people experience in everyday life.

Video compression is a key technology used in several multimedia applications. Improvements in the compression techniques together with the increasing speed and optimized architecture of the new family processors enable us to use this technology more in real time systems. H.264 (also known as MPEG-4 Part 10 or AVC - Advanced Video Coding), is the latest video coding standard which is noted for achieving very high data compression. While H.264 is superior to its predecessors, it has a very high computational complexity which makes its costly for real time applications. Thus, in order to perform video encoding with satisfactory speed there is an obvious need for reducing the computational complexity. New algorithms were developed for this purpose. The developed algorithms were implemented on Texas Instrument TMS320C64x family to be able to fulfill the requirement in optimized signal processing hardware with low power consumption which arises from the computational complexity and the need for portable devices in video processing technology. With the new algorithms developed, a computation reduction of 55% was achieved without loosing perceptual image quality. Furthermore, the algorithms were implemented on a DSP along with the networking functionality to obtain a video streaming system. The final system may be used in a wide range of fields from surveillance systems to mobile systems.

This thesis presents a comparison between two transmit diversity schemes, namely space-time coding and time-switched transmit diversity (TSTD) over block-fading and time-varying multi-input single-output (MISO) channels with different channel parameters. The schemes are concatenated with outer channel codes in order to achieve spatio-temporal diversity. The analytical results are derived for the error performances of the systems and the simulation results as well as outage probabilities are provided. Besides, the details of the pilot-symbol-aided modulation (PSAM) technique are investigated and the error performances of the systems are analyzed when the channel state information is estimated with PSAM. It is demonstrated using the analytical and simulation results that TSTD have a comparable error performance with the space-time coding techniques and it even outperforms the space-time codes for some channel parameters. Our results indicate that TSTD can be suggested as an alternative to space-time codes in some time-varying channels especially due to the implementation simplicity.

In this thesis, we consider the problem of designing space-time block codes that have low maximum-likelihood (ML) decoding complexity. We present a unified framework for determining the worst-case ML decoding complexity of space-time block codes. We use this framework to not only determine the worst-case ML decoding complexity of our own constructions, but also to show that some popular constructions of space-time block codes have lower ML decoding complexity than was previously known. Recognizing the practical importance of the two transmit and two receive antenna system, we propose the asymmetric golden code, which is designed specifically for low ML decoding complexity. The asymmetric golden code has the lowest decoding complexity compared to previous constructions of space-time codes, regardless of whether the channel varies with time. We also propose the embedded orthogonal space-time codes, which is a family of codes for an arbitrary number of antennas, and for any rate up to half the number of antennas. The family of embedded orthogonal space-time codes is the first general framework for the construction of space-time codes with low-complexity decoding, not only for rate one, but for any rate up to half the number of transmit antennas. Simulation results for up to six transmit antennas show that the embedded orthogonal space-time codes are simultaneously lower in complexity and lower in error probability when compared to some of the most important constructions of space-time block codes with the same number of antennas and the same rate larger than one. Having considered the design of space-time block codes with low ML decoding complexity on the transmitter side, we also develop efficient algorithms for ML decoding for the golden code, the asymmetric golden code and the embedded orthogonal space-time block codes on the receiver side. Simulations of the bit-error rate performance and decoding complexity of the asymmetric golden code and embedded orthogonal codes are used to demonstrate their attractive performance-complexity tradeoff.

<p>This thesis discuss on new technique called space time block coding (especially Alamouti's code) which is used to increase capacity and reliability of data transmission over time varying multi-path fading channel. The over all work of the thesis included in the following four chapters.</p><p>In chapter-1 we are going to cover some theoretical part which is useful to understand thesis work and in chapter-2 we will discuss the comparison between simple space time block code (Alamouti's code) and MRRC (Maximum Ratio Receiver Combining) which is receiver diversity and then in chapter-3 we will see the channel capacity & probability error performance for 2x2 Alamouti code over Rayleigh and Rice fading channel .Finally the conclusion and further work included in chapter-4.</p>

In this thesis, we present a space-time coded system which achieves high through- put and good performance with low processing delay using low-complexity detection and decoding. Initially, Hamming codes are used in a simple interleaved bit-mapped coded modulation structure (BMCM). This is concatenated with Alamouti's or- thogonal space-time block codes. The good performance achieved by this system indicates that higher throughput is possible while maintaining performance. An analytical bound for the performance of this system is presented. We also develop a class of low density parity check codes which allows flexible "throughput versus performance" tradeoffs. We then focus on a Rate 2 quasi-orthogonal space-time block code structure which enables us to achieve an overall throughput of 5.6 bits/symbol period with good performance and relatively simple decoding using iterative parallel interference cancellation. We show that this can be achieved through the use of a bit-mapped coded modulation structure using parallel short low density parity check codes. The absence of interleavers here reduces processing delay significantly. The proposed system is shown to perform well on flat Rayleigh fading channels with a wide range of normalized fade rates, and to be robust to channel estimation errors. A comparison with bit-interleaved coded modulation is also provided (BICM).