No description available.

International Telemetering Conference Proceedings / November 04-07, 1991 / Riviera Hotel and Convention Center, Las Vegas, Nevada / A Remote Telemetry Station (RTS) was developed to support Boeing’s requirement to relocate its flight test telemetry range away from Seattle, Wa. As requirements to relocate the test range were investigated high level requirements were documented and various approaches were evaluated. The end result of the analysis and requirements definition was the procurement of the Remote Telemetry Station (RTS). The RTS is capable of supporting many sites, tracking and receiving up to 1024 Kbits/sec of telemetry data, providing fully redundant two-way radio communication in the UHF and VHF bands, linking all the data back to Seattle and appearing transparent to the users. The RTS was designed and developed by a Boeing/Veda Incorporated team. The end result of this joint design and development effort is a system that meets all Boeing requirements in a highly integrated, extremely efficient, and very flexible package providing for growth through the year 2000.

The thesis discusses the channel modelling and relay techniques in powerline communications (PLC) which is considered as a promising technology for the Smart Grid communications, Internet access and home area network (HAN). In this thesis, the statistical PLC channel characteristics are investigated, a new statistical channel modelling method is proposed for the in-door PLC. Then a series of the relay protocols are suggested for the broadband communications over power grid. The statistical channel modelling method is proposed to surmount the limits of the traditional deterministic PLC channel models such as multipath model and transmission line model. To develop the channel model, the properties of the multipath magnitudes, interval between the paths, cable loss and the channel classification are investigated in detail. Then, each property is described by statistical distribution or formula. The simulation results show that the statistical model can describe the PLC channels as accurate as deterministic models without the topology information which is a time-consuming work for collecting. The relay transmission is proposed to help PLC adapting the diverse application scenarios. The protocols covers the main relay aspects which include decode/amplify forwarding, single/ multiple relay nodes, full/half duplex relay working mode. The capacity performance of each protocol is given and compared. A series of the facts which improve the performance of the PLC networks are figured out according to simulation results. The facts include that the decode-and-forward is more suitable for the PLC environment, deviation or transforming station is better location for placing relay node and full duplex relay working mode help exploiting the capacity potential of the PLC networks. Some future works are pointed out based on the work of statistical channel model and relay. In the last part of this thesis, an unit based statistical channel model is initialled for adapting various PLC channel conditions, a more practical relay scenario which contains multiple data terminals is proposed for approaching the realistic transmission scenario. At last, the relay for the narrowband PLC Smart Grid is also mentioned as future research topic.

In 14th August 2003, the Northeast USA suffered its worst power outage event in history. The power disturbance spreading through the system caused mal-trips of the distance relay remote back-up protections, which indeed contributed to the power outage cascading a wide area. The power outage in the Northeast USA was constrained by the presence of HVDC interconnections between the HVAC networks in Ontario and New York. The system collapse did not progress beyond the HVDC interconnection interface with Quebec. The HVDC link can regulate the voltage and current therefore impacts on the performance of the protection and system stability. The distance relay mal-operations were one of the main cause of the Northeast USA blackout as well as the other recent major large area blackouts which were pointed out by the previous papers. This thesis is focus on investigate how HVDC interconnections contribute to maintaining the power system stability. The research work investigated the performance of a distance relay to faults and disturbance on networks containing HVDC interconnection. The research work was carried out by modelling and testing a classic signal processing distance relay in a simple AC network which was based on Kunder’s two areas system using MATLAB/SIMULINK at first. Then the modeled distance relay’s performance was investigated by combining the distance relay and a simple HVDC link based on the Kunder’s two areas system. The research work firstly combined the signal processing distance relay and the HVDC link together to investigate the distance relay’s performance when the protected feeder containing DC link. The distance relay’s performance was investigated when the protected feeders containing HVDC link under fault conditions and power swing conditions. For comparison, a similar power system without HVDC link was also simulated.

Typescript (photocopy). / Digitized by Kansas Correctional Industries

This research examines a two-way relay network consisting of two transceivers and multiple parallel relays, which are equipped with single antennas and operate in a halfduplex mode. In this system, the two transceivers prefer to exchange their information via relays. It is assumed that the relays have the full instantaneous channel state information (CSI) and relay the signals using the amplify-and-forward (AF) method. The performance of two AF bi-directional network beamforming schemes, namely multiple access broadcast channel (MABC) strategy and time division broadcast channel (TDBC) protocol, under joint optimal power control and beamforming design are studied and compared. To do so, we first design a TDBC-based bi-directional network beamformers, through minimization of the total power consumed in the whole network subject to quality of service (QoS) constraints, for the case with a direct link between the two transceivers. The corresponding power minimization problem is carried out over the transceiver transmit powers as well as relay beamforming weights, thus resulting in a jointly optimal power allocation and beamforming approach. We devise optimal secondorder cone programming based solutions as well as fast gradient-based solutions to these problems. Then these solutions are exploited to compare the performance of the underlying TDBC-based approach to that of the MABC-based technique developed in [1]. This comparison is important because the TDBC approach appears to have certain advantages which can be exploited towards improving the performance of two-way network beamforming. These advantages include the additional degree of freedom as well as the possibility of benefitting from the availability of a direct link between the two transceivers. Interestingly, in the absence of a direct link between the two transceivers, we show that when the QoS constraints are imposed to meet certain given probabilities of un-coded error (or, equivalently, to meet certain signal-to-noise ratio constraints), these two schemes perform closely in terms of the minimum total transmit power. However, when the QoS iv constraints are used to guarantee certain given rates, the MABC-based scheme outperforms the TDBC counterpart. In the case when a direct link exists between the two transceivers, the TDBC-based approach can outperform the MABC-based method provided that the direct link is strong enough. / UOIT

In this dissertation, we introduce a relay protocol for multiple-relay networks called parity forwarding. The relay channel is a classic multiuser information theory problem introduced in 1971, modeling a network of three nodes: a source, a destination, and a relay node. The relay has no message of its own and assists the source to communicate to the destination. Of the two main coding techniques for the relay channel, decode-and-forward (DF) and compress-and-forward (CF), our focus is to understand the DF scheme for single- and multiple-relay channels. For the single-relay channel, we present an interpretation of the classic DF strategy from a linear-coding perspective. Identifying binning in the classic DF strategy as parity bit generation, we devise ensembles of low-density parity-check (LDPC) codes, called bilayer LDPC codes, to incorporate the parity bits generated by the relay in the decoding process at the destination. We develop code design techniques and optimize the parameters of the bilayer LDPC code structure to show that bilayer LDPC codes can approach the theoretical DF rate. Inspired by the relation between binning and parity bits, we introduce the parity forwarding protocol to improve on the achievable DF rate in a multiple-relay network. For a two-relay network, we show that the previous multihop DF protocol can be improved if the relays forward parity messages and receivers (relays or the destination)use a joint decoding scheme. Depending on the relation between relay messages and decoded messages at each relay, different parity forwarding protocols are possible. In this thesis, we present a structured characterization of a class of parity forwarding protocols for multiple-relay networks. We propose a tree structure to describe the relations between messages. Using this tree structure, we derive a closed-form expression for the parity forwarding rate in a relay network with an arbitrary number of relays. Finally, examples of new types of degraded multiple-relay networks are presented for which the parity forwarding protocol achieves capacity.

This dissertation deals with wireless communications using cooperating relay nodes. Specifically, this dissertation relaxes two restrictive conditions ubiquitous in the current literature. First, the assumption that relay nodes can perform complex calculations is lifted. Demodulate-encode-forward (DEF) is a low-complexity relaying scheme where the relay is asked only to demodulate, not decode, a source transmission. The implementation of DEF and various methods that can be used with DEF to improve the performance while satisfying the hardware complexity limitations are detailed here. Second, we remove the assumption that the relays either transmit the complete source codeword or not transmit at all. When relays have limited resources, each relay may only be able to transmit part of the source codeword. Fractional cooperation, which allows nodes to transmit a fraction of the source codeword, is proposed and analyzed. Fractional cooperation is also very flexible because coordination between relaying nodes is not required. A third contribution of this dissertation is the use of the union-Bhattacharyya bound (UBB) to analyze relay networks. The bound has the significant advantage of accounting for the specifics of the system parameters and coding scheme used. The UBB is shown here to provide an effective and efficient scheme for relay selection, performance prediction, and system design. It can also be used to distribute relay resources in order to optimize the total energy consumed and error rate performance. A sub-optimal distributed algorithm that can be used to solve the optimization problems is introduced.

In this dissertation, we introduce a relay protocol for multiple-relay networks called parity forwarding. The relay channel is a classic multiuser information theory problem introduced in 1971, modeling a network of three nodes: a source, a destination, and a relay node. The relay has no message of its own and assists the source to communicate to the destination. Of the two main coding techniques for the relay channel, decode-and-forward (DF) and compress-and-forward (CF), our focus is to understand the DF scheme for single- and multiple-relay channels. For the single-relay channel, we present an interpretation of the classic DF strategy from a linear-coding perspective. Identifying binning in the classic DF strategy as parity bit generation, we devise ensembles of low-density parity-check (LDPC) codes, called bilayer LDPC codes, to incorporate the parity bits generated by the relay in the decoding process at the destination. We develop code design techniques and optimize the parameters of the bilayer LDPC code structure to show that bilayer LDPC codes can approach the theoretical DF rate. Inspired by the relation between binning and parity bits, we introduce the parity forwarding protocol to improve on the achievable DF rate in a multiple-relay network. For a two-relay network, we show that the previous multihop DF protocol can be improved if the relays forward parity messages and receivers (relays or the destination)use a joint decoding scheme. Depending on the relation between relay messages and decoded messages at each relay, different parity forwarding protocols are possible. In this thesis, we present a structured characterization of a class of parity forwarding protocols for multiple-relay networks. We propose a tree structure to describe the relations between messages. Using this tree structure, we derive a closed-form expression for the parity forwarding rate in a relay network with an arbitrary number of relays. Finally, examples of new types of degraded multiple-relay networks are presented for which the parity forwarding protocol achieves capacity.

This dissertation deals with wireless communications using cooperating relay nodes. Specifically, this dissertation relaxes two restrictive conditions ubiquitous in the current literature. First, the assumption that relay nodes can perform complex calculations is lifted. Demodulate-encode-forward (DEF) is a low-complexity relaying scheme where the relay is asked only to demodulate, not decode, a source transmission. The implementation of DEF and various methods that can be used with DEF to improve the performance while satisfying the hardware complexity limitations are detailed here. Second, we remove the assumption that the relays either transmit the complete source codeword or not transmit at all. When relays have limited resources, each relay may only be able to transmit part of the source codeword. Fractional cooperation, which allows nodes to transmit a fraction of the source codeword, is proposed and analyzed. Fractional cooperation is also very flexible because coordination between relaying nodes is not required. A third contribution of this dissertation is the use of the union-Bhattacharyya bound (UBB) to analyze relay networks. The bound has the significant advantage of accounting for the specifics of the system parameters and coding scheme used. The UBB is shown here to provide an effective and efficient scheme for relay selection, performance prediction, and system design. It can also be used to distribute relay resources in order to optimize the total energy consumed and error rate performance. A sub-optimal distributed algorithm that can be used to solve the optimization problems is introduced.