• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 318
  • 47
  • 25
  • 23
  • 10
  • 9
  • 8
  • 6
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 2
  • Tagged with
  • 506
  • 506
  • 385
  • 326
  • 187
  • 177
  • 135
  • 70
  • 70
  • 63
  • 60
  • 59
  • 59
  • 57
  • 53
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
91

Blind channel estimation and single-user detection for multi-carrier and spread-spectrum systems with transmit diversity

Nayeb Nazar, Shahrokh. January 2008 (has links)
No description available.
92

THE STUDY OF MULTIPLE ACCESS TECHNIQUES IN ULTRA WIDEBAND IMPULSE RADIO COMMUNICATIONS

Zhao, Yuhua 23 September 2005 (has links)
No description available.
93

Widely linear minimum variance channel estimation with application to multicarrier CDMA systems

Abdallah, Saeed January 2007 (has links)
No description available.
94

PN CODES FOR USE IN TTC SPREAD-SPECTRUM MULTIPLE-ACCESS SYSTEMS

Fiebig, U.-C., Schweikert, R. 11 1900 (has links)
International Telemetering Conference Proceedings / October 29-November 02, 1990 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Various PN codes for use in TTC spread-spectrum systems are considered. The evaluation is based on peak magnitudes and amplitude distributions of both the even and the odd autocorrelation and crosscorrelation functions. Furthermore the influence of the phase of a sequence on the correlation parameters is studied, multiple-access characteristics in terms of the total interference parameter are evaluated and synchronous as well as asynchronous code generation is considered.1
95

Topics in resource allocation in wireless sensor networks

Li, Chaofeng (James) January 2008 (has links)
The focus of this thesis is on the resource allocation problems in wireless sensor and cooperative networks. Typically, wireless sensor networks operate with limited energy and bandwidth are often required to meet some specified Quality-of-Service (QoS) constraints. The ultimate objective for the majority of the problems considered in this thesis is to save battery energy and maximize the network lifetime. / In the first part of this thesis, we employ complex mathematical models to emulate a variety of power drains in wireless sensor nodes. In the first instance, we address a lifetime optimization problem of a wireless TDMA/CDMA sensor network for joint transmit power and rate allocations. The effect of fast fading is captured by including rate outage and link outage constraints on each link. After that, a single-hop wireless sensor network is deployed for a certain application - to estimate a Gaussian source within a pre-specified distortion threshold. In this part, we consider lifetime maximization, in different multiple access protocols such as TDMA, an interference limited non-orthogonal multiple access (NOMA) and an idealized Gaussian multiple access channel. This problem is further studied in a multi-hop scenario where sensing and receiving powers are also included in addition to transmission power. Finally, we investigate a balancing problem between the source coding and transmission power for video wireless sensor systems where the sensor node is required to send the collected video clips, through wireless media, to a base station within a corresponding distortion threshold. All these energy saving and lifetime optimization problems in sensor networks can be formulated via nonlinear nonconvex optimization problems, which are generally hard to solve. However, with favourable variable substitution and reasonable approximation, most of these problems are shown to be convex. The only exception is the Gaussian source esitmation problem in NOMA scenario for which we provide a simple successive convex approximation based algorithm for the NOMA case that converges fast to a suboptimal solution. / In the second part of the thesis, we propose an optimal power allocation scheme with a K-block coding delay constraint on data transmission using a three node cooperative relay network assuming a block fading channel model. Channel information is fed back to the transmitter only in a causal fashion, so that the optimal power allocation strategy is only based on the current and past channel gains. We consider the two simplest schemes for information transmission using a three node (a source, a relay and a destination) relay network, namely the amplify and forward (AF) and decode and forward (DF) protocols. We use the dynamic programming methodology to solve the (K-block delay constrained) expected capacity maximization problem and the outage probability minimization problem with a short term sum power (total transmission power of the source and the relay) constraint. / The main contribution of the thesis is a comprehensive suite of power minimization and lifetime maximization methods that can be used in wireless sensor networks. We present several such applications and extensive numerical examples at the end of each chapter.
96

Space-time block coding with imperfect channel estimates

Baker, Dirk A. January 2001 (has links)
Thesis (M.S.)--West Virginia University, 2001. / Title from document title page. Document formatted into pages; contains iv, 74 p. : ill. Includes abstract. Includes bibliographical references (p. 73-74).
97

Cell search in frequency division : duplex WCDMA networks.

Rezenom, Seare Haile. January 2006 (has links)
Wireless radio access technologies have been progressively evolving to meet the high data rate demands of consumers. The deployment and success of voice-based second generation networks were enabled through the use of the Global System for Mobile Communications (GSM) and the Interim Standard Code Division Multiple Access (lS-95 CDMA) networks. The rise of the high data rate third generation communication systems is realised by two potential wireless radio access networks, the Wideband Code Division Multiple Access (WCDMA) and the CDMA2000. These networks are based on the use of various types of codes to initiate, sustain and terminate the communication links. Moreover, different codes are used to separate the transmitting base stations. This dissertation focuses on base station identification aspects of the Frequency Division Duplex (FDD) WCDMA networks. Notwithstanding the ease of deployment of these networks, their asynchronous nature presents serious challenges to the designer of the receiver. One of the challenges is the identification of the base station identity by the receiver, a process called Cell Search. The receiver algorithms must therefore be robust to the hostile radio channel conditions, Doppler frequency shifts and the detrimental effects of carrier frequency offsets. The dissertation begins by discussing the structure and the generation of WCDMA base station data along with an examination of the effects of the carrier frequency offset. The various cell searching algorithms proposed in the literature are then discussed and a new algorithm that exploits the correlation length structure is proposed and the simulation results are presented. Another design challenge presented by WCDMA networks is the estimation of carrier frequency offset at the receiver. Carrier frequency offsets arise due to crystal oscillator inaccuracies at the receiver and their effect is realised when the voltage controlled oscillator at the receiver is not oscillating at the same carrier frequency as that of the transmitter. This leads to a decrease in the receiver acquisition performance. The carrier frequency offset has to be estimated and corrected before the decoding process can commence. There are different approaches in the literature to estimate and correct these offsets. The final part of the dissertation investigates the FFT based carrier frequency estimation techniques and presents a new method that reduces the estimation error. / Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, Durban, 2006.
98

Topics in resource allocation in wireless sensor networks

Li, Chaofeng (James) January 2008 (has links)
The focus of this thesis is on the resource allocation problems in wireless sensor and cooperative networks. Typically, wireless sensor networks operate with limited energy and bandwidth are often required to meet some specified Quality-of-Service (QoS) constraints. The ultimate objective for the majority of the problems considered in this thesis is to save battery energy and maximize the network lifetime. / In the first part of this thesis, we employ complex mathematical models to emulate a variety of power drains in wireless sensor nodes. In the first instance, we address a lifetime optimization problem of a wireless TDMA/CDMA sensor network for joint transmit power and rate allocations. The effect of fast fading is captured by including rate outage and link outage constraints on each link. After that, a single-hop wireless sensor network is deployed for a certain application - to estimate a Gaussian source within a pre-specified distortion threshold. In this part, we consider lifetime maximization, in different multiple access protocols such as TDMA, an interference limited non-orthogonal multiple access (NOMA) and an idealized Gaussian multiple access channel. This problem is further studied in a multi-hop scenario where sensing and receiving powers are also included in addition to transmission power. Finally, we investigate a balancing problem between the source coding and transmission power for video wireless sensor systems where the sensor node is required to send the collected video clips, through wireless media, to a base station within a corresponding distortion threshold. All these energy saving and lifetime optimization problems in sensor networks can be formulated via nonlinear nonconvex optimization problems, which are generally hard to solve. However, with favourable variable substitution and reasonable approximation, most of these problems are shown to be convex. The only exception is the Gaussian source esitmation problem in NOMA scenario for which we provide a simple successive convex approximation based algorithm for the NOMA case that converges fast to a suboptimal solution. / In the second part of the thesis, we propose an optimal power allocation scheme with a K-block coding delay constraint on data transmission using a three node cooperative relay network assuming a block fading channel model. Channel information is fed back to the transmitter only in a causal fashion, so that the optimal power allocation strategy is only based on the current and past channel gains. We consider the two simplest schemes for information transmission using a three node (a source, a relay and a destination) relay network, namely the amplify and forward (AF) and decode and forward (DF) protocols. We use the dynamic programming methodology to solve the (K-block delay constrained) expected capacity maximization problem and the outage probability minimization problem with a short term sum power (total transmission power of the source and the relay) constraint. / The main contribution of the thesis is a comprehensive suite of power minimization and lifetime maximization methods that can be used in wireless sensor networks. We present several such applications and extensive numerical examples at the end of each chapter.
99

Experimental demonstration of OCDMA and OTDMA PONs with FEC and burst-mode reception

Kheder, Noha. January 1900 (has links)
Thesis (M.Eng.). / Written for the Dept. of Electrical and Computer Engineering. Title from title page of PDF (viewed 2008/07/29). Includes bibliographical references.
100

Estimation of radio resource in a 3G multimedia system through simulation /

Saw, Chiew-Leong, January 1900 (has links)
Thesis (M. Eng.)--Carleton University, 2001. / Includes bibliographical references (p. 82-84). Also available in electronic format on the Internet.

Page generated in 0.046 seconds