Çok genlikli minimum kaydırmalı anahtarlama için kafes kodlar
Trellis codes for multi-amplitud minimum shift keying modulation
- Tez No: 39480
- Danışmanlar: DOÇ.DR. H. ÜMİT AYGÖLÜ
- Tez Türü: Yüksek Lisans
- Konular: Elektrik ve Elektronik Mühendisliği, Electrical and Electronics Engineering
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 1994
- Dil: Türkçe
- Üniversite: İstanbul Teknik Üniversitesi
- Enstitü: Fen Bilimleri Enstitüsü
- Ana Bilim Dalı: Belirtilmemiş.
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: 76
Özet
Conventional convolutional codes are normally optimized in terms of their free Hamming distance[11], [12]. These codes can also be combined with continuous phase modulation (CPM) or specifically CPFSK. A larger class of schemes is obtained by combining convolutional coding with CPM[13]. In [13], Lindell and Sundberg is optimized the Euclidean distance for combination of the channel coding and CPFSK modulation. In a code trellis minimum merge length is increased by prior encoding of the data symbols, generally, the longer the merge length, the larger the minimum normalized squared Euclidean distance and hence the better the error performance. This is the one of the reasons that coding is used in conjunction with CPM. Error performance analysis of an arbitrary trellis code is different from that of binary convolutional code due to the nonlinearity induced by the memoryless mapper. For a nonlinear code the Euclidean distance between any incorrect path and the correct path is dependent upon the correct path. Biglieri[14], has proposed a method based on generalized generating function which involves an error state diagram where the number of states is equal to the square of the number of trellis states. But this method is impractical for codes with more than 2 or 4 states. For example a code with 8 trellis states requires 64 states in its error state diagram to compute the generalized generating function. Zehavi and Wolf[15] showed that the modified generating function can be calculated from error state diagram with number of states equal to that of the encoder trellis if the code satisfy some symmetry properties. Most of the Ungerboeck' s type codes satisfy these properties. Bounds on the bit-error or error-event probabilities can be then derived. In this thesis, an extended version of minimum shift keying known as multi-amplitude minimum shift keying is considered and its inherent trellis structure with four states is explored. After that, optimum combination of convolutional codes and multi-amplitude minimum shift keying modulation is suggested. In the second chapter of the thesis, minimum shift keying modulation is explained in detail and inherent error control properties of this modulation scheme is examined. Than, trellis coded-modulation technique and free Euclidean distance calculation algorithm are presented. In the third chapter, the extended version of minimum shift keying which have multi-amplitudes signals known as multi-amplitude minimum shift keying modulation (MAMSK), is considered. A trellis code structure for multi- amplitude minimum shift keying is obtained with prescribed initial phases IX
Özet (Çeviri)
and amplitudes. The MAMSK is then presented in coded-modulation scheme. After that, error performance of uncoded MAMSK signal is investigated. in chapter four, in order to improve the error performance of multi- amplitude minimum shift keying, the optimum combinations of convolutional codes and multi-amplitude minimum shift keying modulation are explored. VVith R=1/2, K=1 coded MAMSK modulation, an asymptotic coding gain of 6.5 dB över uncoded MAMSK modulation is obtained. R=1/2, K=2 coded MAMSK modulation offers an asymptotic coding gain of 7 dB över uncoded modulation.Conventional convolutional codes are normally optimized in terms of their free Hamming distance[11], [12]. These codes can also be combined with continuous phase modulation (CPM) or specifically CPFSK. A larger class of schemes is obtained by combining convolutional coding with CPM[13]. In [13], Lindell and Sundberg is optimized the Euclidean distance for combination of the channel coding and CPFSK modulation. In a code trellis minimum merge length is increased by prior encoding of the data symbols, generally, the longer the merge length, the larger the minimum normalized squared Euclidean distance and hence the better the error performance. This is the one of the reasons that coding is used in conjunction with CPM. Error performance analysis of an arbitrary trellis code is different from that of binary convolutional code due to the nonlinearity induced by the memoryless mapper. For a nonlinear code the Euclidean distance between any incorrect path and the correct path is dependent upon the correct path. Biglieri[14], has proposed a method based on generalized generating function which involves an error state diagram where the number of states is equal to the square of the number of trellis states. But this method is impractical for codes with more than 2 or 4 states. For example a code with 8 trellis states requires 64 states in its error state diagram to compute the generalized generating function. Zehavi and Wolf[15] showed that the modified generating function can be calculated from error state diagram with number of states equal to that of the encoder trellis if the code satisfy some symmetry properties. Most of the Ungerboeck' s type codes satisfy these properties. Bounds on the bit-error or error-event probabilities can be then derived. In this thesis, an extended version of minimum shift keying known as multi-amplitude minimum shift keying is considered and its inherent trellis structure with four states is explored. After that, optimum combination of convolutional codes and multi-amplitude minimum shift keying modulation is suggested. In the second chapter of the thesis, minimum shift keying modulation is explained in detail and inherent error control properties of this modulation scheme is examined. Than, trellis coded-modulation technique and free Euclidean distance calculation algorithm are presented. In the third chapter, the extended version of minimum shift keying which have multi-amplitudes signals known as multi-amplitude minimum shift keying modulation (MAMSK), is considered. A trellis code structure for multi- amplitude minimum shift keying is obtained with prescribed initial phases IXand amplitudes. The MAMSK is then presented in coded-modulation scheme. After that, error performance of uncoded MAMSK signal is investigated. in chapter four, in order to improve the error performance of multi- amplitude minimum shift keying, the optimum combinations of convolutional codes and multi-amplitude minimum shift keying modulation are explored. VVith R=1/2, K=1 coded MAMSK modulation, an asymptotic coding gain of 6.5 dB över uncoded MAMSK modulation is obtained. R=1/2, K=2 coded MAMSK modulation offers an asymptotic coding gain of 7 dB över uncoded modulation.Conventional convolutional codes are normally optimized in terms of their free Hamming distance[11], [12]. These codes can also be combined with continuous phase modulation (CPM) or specifically CPFSK. A larger class of schemes is obtained by combining convolutional coding with CPM[13]. In [13], Lindell and Sundberg is optimized the Euclidean distance for combination of the channel coding and CPFSK modulation. In a code trellis minimum merge length is increased by prior encoding of the data symbols, generally, the longer the merge length, the larger the minimum normalized squared Euclidean distance and hence the better the error performance. This is the one of the reasons that coding is used in conjunction with CPM. Error performance analysis of an arbitrary trellis code is different from that of binary convolutional code due to the nonlinearity induced by the memoryless mapper. For a nonlinear code the Euclidean distance between any incorrect path and the correct path is dependent upon the correct path. Biglieri[14], has proposed a method based on generalized generating function which involves an error state diagram where the number of states is equal to the square of the number of trellis states. But this method is impractical for codes with more than 2 or 4 states. For example a code with 8 trellis states requires 64 states in its error state diagram to compute the generalized generating function. Zehavi and Wolf[15] showed that the modified generating function can be calculated from error state diagram with number of states equal to that of the encoder trellis if the code satisfy some symmetry properties. Most of the Ungerboeck' s type codes satisfy these properties. Bounds on the bit-error or error-event probabilities can be then derived. In this thesis, an extended version of minimum shift keying known as multi-amplitude minimum shift keying is considered and its inherent trellis structure with four states is explored. After that, optimum combination of convolutional codes and multi-amplitude minimum shift keying modulation is suggested. In the second chapter of the thesis, minimum shift keying modulation is explained in detail and inherent error control properties of this modulation scheme is examined. Than, trellis coded-modulation technique and free Euclidean distance calculation algorithm are presented. In the third chapter, the extended version of minimum shift keying which have multi-amplitudes signals known as multi-amplitude minimum shift keying modulation (MAMSK), is considered. A trellis code structure for multi- amplitude minimum shift keying is obtained with prescribed initial phases IXand amplitudes. The MAMSK is then presented in coded-modulation scheme. After that, error performance of uncoded MAMSK signal is investigated. in chapter four, in order to improve the error performance of multi- amplitude minimum shift keying, the optimum combinations of convolutional codes and multi-amplitude minimum shift keying modulation are explored. VVith R=1/2, K=1 coded MAMSK modulation, an asymptotic coding gain of 6.5 dB över uncoded MAMSK modulation is obtained. R=1/2, K=2 coded MAMSK modulation offers an asymptotic coding gain of 7 dB över uncoded modulation.
Benzer Tezler
- An investigation on the effects of multi-axis ultrasonic vibration-assisted milling with nanofluid minimum quantity lubrication on difficult-to-cut materials used in aerospace industries
Havacılık endüstrisinde kullanılan kesilmesi zor malzemeler üzerinde nanoakışkan minimum miktar yağlama ile çok eksenli ultrasonik titreşi̇m destekli frezelemenin etkileri üzerine bir inceleme
RAMAZAN HAKKI NAMLU
Doktora
İngilizce
2023
Makine MühendisliğiAtılım ÜniversitesiMakine Mühendisliği Ana Bilim Dalı
DR. ÖĞR. ÜYESİ BAHRAM LOTFİ
PROF. DR. SADIK ENGİN KILIÇ
- Design and analysis of radar antenna structures for optimum dynamic behavior
En iyi dinamık davranışa sahip radar anten yapılarının tasarımı ve analizi
ENVER SUN
Yüksek Lisans
İngilizce
2016
Makine MühendisliğiOrta Doğu Teknik ÜniversitesiMakine Mühendisliği Ana Bilim Dalı
YRD. DOÇ. DR. GÖKHAN OSMAN ÖZGEN
PROF. DR. YAVUZ YAMAN
- Şebeke ile senkron çalışmada çok seviyeli güç elektroniği devreleri üzerinden okyanus dalga enerjisinin dönüştürülmesinin matematiksel modellemesine katkılar
Contributions to the mathematical modelling of the ocean wave energy conversion through multilevel power electronics converters for on-grid operation
İLKNUR ÇOLAK
Doktora
Türkçe
2021
Elektrik ve Elektronik Mühendisliğiİstanbul Teknik ÜniversitesiElektrik Mühendisliği Ana Bilim Dalı
DOÇ. DR. DERYA AHMET KOCABAŞ
- Design of a mixer first receiver front-end
Önce karıştırıcı türü alıcı ön yüzü tasarımı
MEHMET ALPEREN BALTACI
Yüksek Lisans
İngilizce
2024
Elektrik ve Elektronik Mühendisliğiİstanbul Teknik ÜniversitesiElektronik ve Haberleşme Mühendisliği Ana Bilim Dalı
DOÇ. DR. MUSTAFA BERKE YELTEN
- Linearity and efficiency improvement on RF power amplifiers
RF kuvvetlendiricilerde doğrusallık ve verimin iyileştirilmesi
ÖMER AYDIN
Doktora
İngilizce
2016
Elektrik ve Elektronik Mühendisliğiİstanbul Teknik ÜniversitesiElektrik-Elektronik Ana Bilim Dalı
PROF. OSMAN PALAMUTÇUOĞULLARI