23 research outputs found

    Towards low-cost gigabit wireless systems at 60 GHz

    Get PDF
    The world-wide availability of the huge amount of license-free spectral space in the 60 GHz band provides wide room for gigabit-per-second (Gb/s) wireless applications. A commercial (read: low-cost) 60-GHz transceiver will, however, provide limited system performance due to the stringent link budget and the substantial RF imperfections. The work presented in this thesis is intended to support the design of low-cost 60-GHz transceivers for Gb/s transmission over short distances (a few meters). Typical applications are the transfer of high-definition streaming video and high-speed download. The presented work comprises research into the characteristics of typical 60-GHz channels, the evaluation of the transmission quality as well as the development of suitable baseband algorithms. This can be summarized as follows. In the first part, the characteristics of the wave propagation at 60 GHz are charted out by means of channel measurements and ray-tracing simulations for both narrow-beam and omni-directional configurations. Both line-of-sight (LOS) and non-line-of-sight (NLOS) are considered. This study reveals that antennas that produce a narrow beam can be used to boost the received power by tens of dBs when compared with omnidirectional configurations. Meanwhile, the time-domain dispersion of the channel is reduced to the order of nanoseconds, which facilitates Gb/s data transmission over 60-GHz channels considerably. Besides the execution of measurements and simulations, the influence of antenna radiation patterns is analyzed theoretically. It is indicated to what extent the signal-to-noise ratio, Rician-K factor and channel dispersion are improved by application of narrow-beam antennas and to what extent these parameters will be influenced by beam pointing errors. From both experimental and analytical work it can be concluded that the problem of the stringent link-budget can be solved effectively by application of beam-steering techniques. The second part treats wideband transmission methods and relevant baseband algorithms. The considered schemes include orthogonal frequency division multiplexing (OFDM), multi-carrier code division multiple access (MC-CDMA) and single carrier with frequency-domain equalization (SC-FDE), which are promising candidates for Gb/s wireless transmission. In particular, the optimal linear equalization in the frei quency domain and associated implementation issues such as synchronization and channel estimation are examined. Bit error rate (BER) expressions are derived to evaluate the transmission performance. Besides the linear equalization techniques, a low-complexity inter-symbol interference cancellation technique is proposed to achieve much better performance of code-spreading systems such as MC-CDMA and SC-FDE. Both theoretical analysis and simulations demonstrate that the proposed scheme offers great advantages as regards both complexity and performance. This makes it particularly suitable for 60-GHz applications in multipath environments. The third part treats the influence of quantization and RF imperfections on the considered transmission methods in the context of 60-GHz radios. First, expressions for the BER are derived and the influence of nonlinear distortions caused by the digital-to-analog converters, analog-to-digital converters and power amplifiers on the BER performance is examined. Next, the BER performance under the influence of phase noise and IQ imbalance is evaluated for the case that digital compensation techniques are applied in the receiver as well as for the case that such techniques are not applied. Finally, a baseline design of a low-cost Gb/s 60-GHz transceiver is presented. It is shown that, by application of beam-steering in combination with SC-FDE without advanced channel coding, a data rate in the order of 2 Gb/s can be achieved over a distance of 10 meters in a typical NLOS indoor scenario

    Iterative detection for pretransformed OFDM by subcarrier reconstruction

    Get PDF
    In this paper, an iterative detection method for an uncoded pretransformed (PT) orthogonal frequency division multiplexing (OFDM) system where the channel is not known at the transmitter is proposed. The iterative detection starts with linear detection. The noiseless received signal at the weakest subcarrier (corresponding to the smallest channel amplitude) is estimated based on all the detected data symbols using a hard or soft decision. Then, the actual received signal at the weakest subcarrier is replaced by the estimated one. This process is referred to as reconstruction here. After reconstruction, linear detection is carried out again to generate the next set of symbol estimates. The whole process proceeds iteratively to reconstruct the received signal at the next-weakest subcarrier. The transform coefficients and the iterative process are designed to maximize the minimum signal-to-noise power ratio. Under the assumption that the previous detection is error free, it is shown analytically that the iterative method achieves a diversity advantage of i+1 in the ith iteration, thus providing an explanation of its superior performance. Due to the flexibility of the transform design, the analysis conducted is applicable for other common systems as well. Simulations in realistic channels are carried out, and the bit-error rate performance of the iterative detection is superior as compared to that of the conventional detectors for the PT-OFDM or OFDM system

    Performance study of air interface for broadband wireless packet access

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Multi-carrier transmission techniques toward flexible and efficient wireless communication systems

    Get PDF
    制度:新 ; 文部省報告番号:甲2562号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2008/3/15 ; 早大学位記番号:新470

    Time diversity solutions to cope with lost packets

    Get PDF
    A dissertation submitted to Departamento de Engenharia Electrotécnica of Faculdade de Ciências e Tecnologia of Universidade Nova de Lisboa in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engenharia Electrotécnica e de ComputadoresModern broadband wireless systems require high throughputs and can also have very high Quality-of-Service (QoS) requirements, namely small error rates and short delays. A high spectral efficiency is needed to meet these requirements. Lost packets, either due to errors or collisions, are usually discarded and need to be retransmitted, leading to performance degradation. An alternative to simple retransmission that can improve both power and spectral efficiency is to combine the signals associated to different transmission attempts. This thesis analyses two time diversity approaches to cope with lost packets that are relatively similar at physical layer but handle different packet loss causes. The first is a lowcomplexity Diversity-Combining (DC) Automatic Repeat reQuest (ARQ) scheme employed in a Time Division Multiple Access (TDMA) architecture, adapted for channels dedicated to a single user. The second is a Network-assisted Diversity Multiple Access (NDMA) scheme, which is a multi-packet detection approach able to separate multiple mobile terminals transmitting simultaneously in one slot using temporal diversity. This thesis combines these techniques with Single Carrier with Frequency Division Equalizer (SC-FDE) systems, which are widely recognized as the best candidates for the uplink of future broadband wireless systems. It proposes a new NDMA scheme capable of handling more Mobile Terminals (MTs) than the user separation capacity of the receiver. This thesis also proposes a set of analytical tools that can be used to analyse and optimize the use of these two systems. These tools are then employed to compare both approaches in terms of error rate, throughput and delay performances, and taking the implementation complexity into consideration. Finally, it is shown that both approaches represent viable solutions for future broadband wireless communications complementing each other.Fundação para a Ciência e Tecnologia - PhD grant(SFRH/BD/41515/2007); CTS multi-annual funding project PEst-OE/EEI/UI0066/2011, IT pluri-annual funding project PEst-OE/EEI/LA0008/2011, U-BOAT project PTDC/EEATEL/ 67066/2006, MPSat project PTDC/EEA-TEL/099074/2008 and OPPORTUNISTICCR project PTDC/EEA-TEL/115981/200

    Energy-efficient diversity combining for different access schemes in a multi-path dispersive channel

    Get PDF
    Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e ComputadoresThe forthcoming generation of mobile communications, 5G, will settle a new standard for a larger bandwidth and better Quality of Service (QoS). With the exploding growth rate of user generated data, wireless standards must cope with this growth and at the same time be energy efficient to avoid depleting the batteries of wireless devices. Besides these issues, in a broadband wireless setting QoS can be severely affected from a multipath dispersive channel and therefore be energy demanding. Cross-layered architectures are a good choice to enhance the overall performance of a wireless system. Examples of cross-layered Physical (PHY) - Medium Access Control (MAC) architectures are type-II Diversity Combining (DC) Hybrid-ARQ (H-ARQ) and Multi-user Detection (MUD) schemes. Cross-layered type-II DC H-ARQ schemes reuse failed packet transmissions to enhance data reception on posterior retransmissions; MUD schemes reuse data information from previously collided packets on posterior retransmissions to enhance data reception. For a multipath dispersive channel, a PHY layer analytical model is proposed for Single-Carrier with Frequency Domain Equalization (SC-FDE) that supports DC H-ARQ and MUD. Based on this analytical model, three PHY-MAC protocols are proposed. A crosslayered Time Division Multiple Access (TDMA) scheme that uses DC H-ARQ is modeled and its performance is studied in this document; the performance analysis shows that the scheme performs better with DC and achieves a better energy efficiency at the cost of a higher delay. A novel cross-layered prefix-assisted Direct-Sequence Code Division Multiple Access (DS-CDMA) scheme is proposed and modeled in this document, it uses principles of DC and MUD. This protocol performs better by means of additional retransmissions, achieving better energy efficiency, at the cost of higher redundancy from a code spreading gain. Finally, a novel cross-layered protocol H-ARQ Network Division Multiple Access (H-NDMA) is proposed and modeled, where the combination of DC H-ARQ and MUD is used with the intent of maximizing the system capacity with a lower delay; system results show that the proposed scheme achieves better energy efficiency and a better performance at the cost of a higher number of retransmissions. A comparison of the three cross-layered protocols is made, using the PHY analytical model, under normalized conditions using the same amount of maximum redundancy. Results show that the H-NDMA protocol, in general, obtains the best results, achieving a good performance and a good energy efficiency for a high channel load and low Signal-to-Noise Ratio (SNR). TDMA with DC H-ARQ achieves the best energy efficiency, although presenting the worst delay. Prefix-assisted DS-CDMA in the other hand shows good delay results but presents the worst throughput and energy efficiency

    Finite Field Multiple Access

    Full text link
    In the past several decades, various multiple-access (MA) techniques have been developed and used. These MA techniques are carried out in complex-field domain to separate the outputs of the users. It becomes problematic to find new resources from the physical world. It is desirable to find new resources, physical or virtual, to confront the fast development of MA systems. In this paper, an algebraic virtual resource is proposed to support multiuser transmission. For binary transmission systems, the algebraic virtual resource is based on assigning each user an element pair (EP) from a finite field GF(pmp^m). The output bit from each user is mapped into an element in its assigned EP, called the output symbol. For a downlink MA system, the output symbols from the users are jointly multiplexed into a unique symbol in the same field GF(pmp^m) for further physical-layer transmission. The EPs assigned to the users are said to form a multiuser algebraic uniquely decodable (UD) code. Using EPs over a finite field, a network, a downlink, and an uplink orthogonal/non-orthogonal MA systems are proposed, which are called finite-field MA (FFMA) systems. Methods for constructing algebraic UD codes for FFMA systems are presented. An FFMA system can be designed in conjunction with the classical complex-field MA techniques to provide more flexibility and varieties.Comment: 32 pages, 10 figure

    OFCDM systems over fading channels

    Get PDF
    Along with the fast growing demand of information exchange, telecommunication systems are required to provide fast and reliable service to high-data-rate applications such as video conference, real-time broadcasting, and on-line gaming. In downlink transmission, orthogonal frequency and code division multiplexing (OFCDM) has been an attractive technique for high-data-rate applications. With two-dimensional spreading, in both time domain and frequency domain, OFCDM achieves diversity gains in multiuser scenarios. Moreover, the adjustable spreading factors (SF) give OFCDM systems the flexibility in transmission rate and diversity gain. In this thesis, we focus on the downlink of OFCDM communication systems. The performance of OFCDM systems is investigated over Ricean fading channels with Rayleigh fading as special case. Code division multiple access (CDMA) technique is used to support multiuser communications, where users can transmit at the same time using the same frequency with the help of code sequences. We compare different combining methods that are employed to achieve diversity gain. Moreover, channel correlation is examined to see its effect on the system performance. We also propose to combine multiple-input and multiple-output (MIMO) techniques, specifically space-time block coding (STBC), with OFCDM systems. By adding spatial diversity, a MIMO system can provide more reliable transmission compared to a single-input and single-output (SISO) system. The space-time scheme used in our study is Alamouti scheme [1], which employs N = 2 and M antennas at the transmitter side and receiver side respectively. In the thesis, we explain the system structure, transmission and detection methods, and system performance of such MIMO-OFCDM systems. In our study, the expressions of system bit error rate (BER) are considered under the condition that no multi-code interference (MCI) is present. The accuracy of the BER expressions is verified when compared with the simulated ones for both SISO and MIMO-OFCDM systems with different combining methods. These comparisons are carried over different channels and with different system parameters to explore the benefits of OFCDM based systems. Both analytical and simulation results show the large diversity gains achieved when incorporating STBC with OFCDM

    Design of tch-type sequences for communications

    Get PDF
    This thesis deals with the design of a class of cyclic codes inspired by TCH codewords. Since TCH codes are linked to finite fields the fundamental concepts and facts about abstract algebra, namely group theory and number theory, constitute the first part of the thesis. By exploring group geometric properties and identifying an equivalence between some operations on codes and the symmetries of the dihedral group we were able to simplify the generation of codewords thus saving on the necessary number of computations. Moreover, we also presented an algebraic method to obtain binary generalized TCH codewords of length N = 2k, k = 1,2, . . . , 16. By exploring Zech logarithm’s properties as well as a group theoretic isomorphism we developed a method that is both faster and less complex than what was proposed before. In addition, it is valid for all relevant cases relating the codeword length N and not only those resulting from N = p
    corecore