• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6
  • 3
  • 2
  • 1
  • Tagged with
  • 12
  • 12
  • 4
  • 4
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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.

An Unified Approach to Analyze a Generic M-ary CDMA System

Chao, Chien-yao 30 July 2004 (has links)
In this thesis we propose and study a new CDMA architecture, namely parallel-transmission M-ary CDMA system. By using variable combination patterns of spreading codes, we can greatly improve the system bandwidth utilization. The more spreading codes used in each user, the higher bandwidth efficiency can achieve with more bits packed in each symbol. In addition, a user can adjust transmission data rate easily by changing the number of spreading codes used to fit varying system operational requirements. In this thesis, we should use maximum likelihood detection algorithms for signal detection to ensure an optimal performance in terms of bit error rate. The system performance of such a parallel-transmission M-ary CDMA system is analytically studied in both AWGN and Nakagami channels in the presence of multiple access interference and multi-path interference. The both theoretical analysis and computer simulations show that the scheme works pretty well under various channel condition.


Honglin, Zhao, Shijie, Bi, Tingxian, Zhou 10 1900 (has links)
International Telemetering Conference Proceedings / October 27-30, 1997 / Riviera Hotel and Convention Center, Las Vegas, Nevada / This paper analyzes the performance of an M-ary spread spectrum system with orthogonal codes. A new scheme of M-ary spread spectrum communication with phase shifted msequence is proposed, and the method to implement code synchronization in the scheme is given. The performance of the new scheme is analyzed, and compared to conventional spread spectrum systems and orthogonal code M-ary systems. The results show that stronger anti-interference ability, and better data transmission efficiency, and lower complexity is achieved in the system employing phase shifted m-sequence.

The Study of Distributed Detection Using Two-Dimensional Codes

Lin, Yu-pang 12 January 2010 (has links)
In this thesis, we consider the distributed classification problem in wireless sensor networks (WSNs). Sensor nodes in WSNs detect environmental variations and make their decisions individually, after which their decisions, possibly in the presence of faults, are transmitted to a fusion center. In literature, the distributed classification fusion using error correcting codes has been shown to have good sensor fault-tolerance capability. In this thesis, we extend the fault-tolerant classification system using error correcting code by using two-dimensional channel coding. We also extend the binary coding in literature to the M-ary code. This thesis then suggests a code construction method with low computational complexity. Based on the suggest code construction method, this thesis then conducts a series experiment to investigate the performance of the suggested method.

M-ary orthogonal modulation using wavelet basis functions

Pan, Xiaoyun January 2000 (has links)
No description available.

The capacity of multi-access TD/CCSK with decision feedback and transmitted reference

Lin, Chang-Ho January 1996 (has links)
No description available.

Optimization of Code-Constellation for M-ary CDMA Systems

Chen, Yang-Wen 02 September 2006 (has links)
In this thesis, we propose and evaluate quasi-optimal algorithms for solving the code-constellation optimization problem in M-ary CDMA system. The M-ary CDMA system is a new CDMA architecture. The more spreading codes used in each user, and the higher bandwidth efficiency can achieve with more bits packed in each symbol. We use a code, which we refer to as ¡§mapping code¡¨, to help form a multidimensional spherical code-constellation. The M codewords of the mapping code correspond one-to-one to the M points on the code-constellation. Thus, the code-constellation optimization problem is a combinatorial optimization problem. We present that an exhaustive search (ES) algorithm would have compute and check all possible subset, and then this problem becomes a NP-hard. Based on the exhaustive search algorithm, we propose symmetric points search (SPS) algorithm to reduce computation complexity, but it is not optimal algorithm. In addition, we propose a quasi-optimal algorithm, namely Manhattan distance search (MDS) algorithm. Numerical results and comparisons are provided to illustrate that the computation complexity of the Manhattan distance search algorithm increases linearly with dimension of code-constellation and its performance is better than others.

Classification Of Remotely Sensed Data By Using 2d Local Discriminant Bases

Tekinay, Cagri 01 August 2009 (has links) (PDF)
In this thesis, 2D Local Discriminant Bases (LDB) algorithm is used to 2D search structure to classify remotely sensed data. 2D Linear Discriminant Analysis (LDA) method is converted into an M-ary classifier by combining majority voting principle and linear distance parameters. The feature extraction algorithm extracts the relevant features by removing the irrelevant ones and/or combining the ones which do not represent supplemental information on their own. The algorithm is implemented on a remotely sensed airborne data set from Tippecanoe County, Indiana to evaluate its performance. The spectral and spatial-frequency features are extracted from the multispectral data and used for classifying vegetative species like corn, soybeans, red clover, wheat and oat in the data set.

Optimum detection of differentially-encoded M-ary phase-shift keying in a dispersive aeronautical channel

Rodenbaugh, John Irvin January 2002 (has links)
No description available.

A Novel Precoding Scheme for Systems Using Data-Dependent Superimposed Training

Chen, Yu-chih 31 July 2012 (has links)
For channel estimation without data-induced interference in data-dependent superimposed training (DDST) scheme, the data sequence is shifted by subtracting a data-dependent sequence before added to training sequence at transmitter. The distorted term causes the data identification problem (DIP) at the receiver. In this thesis, we propose two precoding schemes based on previous work. To maintain low peak-to-average power ratio (PAPR), the precoding matrix is restricted to a diagonal matrix. The first scheme is proposed to enlarge the minimum distance between the closest codewords, termed as efficient diagonal scheme. Conditions to make sure the precoding matrix is efficient for M-ary phase shift keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) modulation are listed in this paper. The second scheme pursues a lowest complexity at receiver which means the amount of searching set is reduced. It is a trade-off between the better bit error rate (BER) performance and a lower complexity at receiver. The simulation results show that PAPR have been improved and the DIP is solved in both schemes.


Bishop, Chris, Fahey, Mike 10 1900 (has links)
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Shaped Offset Quadrature Phase Shift Keying (SOQPSK) has the advantages of low sidelobes and high detection probability; however, its main lobe has a fixed width set by the number of constellation points. By slightly modifying the modulation scheme, the four constellation points of quadrature shift keying can be changed to M constellation points where M is a power of 2. After this change, the power spectral density (PSD) retains low sidelobes, and the desirable property of being able to detect the signal by integrating over two symbol periods is retained.

Page generated in 0.1031 seconds