I. INTRODUCTION IJSER

3y ago
29 Views
2 Downloads
2.15 MB
8 Pages
Last View : 24d ago
Last Download : 3m ago
Upload by : Joao Adcock
Transcription

INTERNATIONAL JOURNAL OF SCIENTIFIC & ENGINEERING RESEARCH, VOLUME 7, ISSUE 8, AUGUST-2016ISSN 2229-5518Implementation of Digital Modulation Technique andCalculate the Bit Error Rate Performance using MatlabAli Kamal Taqi 1Abstract— With the increasing demand in communication, it has become necessary to give better and efficient service to users by using bettertechnique. This paper demonstrates different modulation technique including Amplitude Shift Keying (ASK), Frequency Shift Keying (FSK), PhaseShift Keying (PSK) and analyze the Bit Error Rate (BER) for different modulation schemes such as Binary Phase Shift Keying (BPSK), QuadraturePhase Shift Keying (QPSK), Octal Phase Shift Keying (8PSK), and Trellis Coded Modulation (TCM). By Choosing a reliable modulation schemeand better coding technique the enhancement of the performance can be obtained in transmitter and receiver of the system. Simulated result isshown to analyze and compare the performance of these systems by using additive white Gaussian noise channel (AWGN). Finally, the differentmodulation schemes are compared on the basis of BER and best modulation scheme is determined. From analysis of modulation techniques, thesystem could use more appropriate modulation technique to suit the channel quality, thus we can deliver the optimum and efficient systemparameters. Both Matlab Code and Simulink have been used for simulation.Index Terms— Digital Modulation, ASK, FSK, PSK, Bit Error Rate (BER), TCM.—————————— ——————————I. INTRODUCTIONIn the simplest type, a transmission-reception system may bea three-block system, consisting of a) a transmitter, b) atransmission medium and c) a receiver. If we predict of amix of the transmission device and reception device withinthe sort of a ‘transceiver’ and if (as is sometimes the case)the transmission medium permits signal each ways that, wetend to are in an exceedingly position to consider a both-way(bi-directional) communication system. For simpledescription, we are going to discuss a few unidirectionaltransmission-reception systems with the implicit assumptionthat, once understood, the concepts are used for developing/ analyzing two-way communication systems. So, ourrepresentative communication system, in an exceedinglystraightforward type, once more consists of 3 completelydifferent entities, viz. a transmitter, a channel and a receiver.A data communication system has many distinctive optionswhen put next with associate analog communication system.each analog (such as voice signal) and digital signals (suchas knowledge generated by computers) is communicatedover a digital gear mechanism. once the signal is analog innature, constant discrete-time discrete-amplitude illustrationis feasible when the initial process of sampling andquantization. So, each a digital signal and a quantal analogsignal are of comparable kind, i.e. discrete-time-discreteamplitude signals. A key feature of a data communicationsystem is that a way of ‘information’, with acceptable unitof live, is related to such signals. This image, attributable toClaude E. Shannon, ends up in many fascinating schematicdescription of a data communication system. parenthetically,take into account Fig.1.1 that shows the signal supply at thetransmission finish as constant ‘Information Source’ andalso the receiving user as associate ‘Information sink’. thegeneral purpose of the data communication system is ‘tocollect data from the supply and perform necessary signalprocess specified the data is delivered to the top user(information sink) with acceptable quality’. One could noteof the compromising phrase ‘acceptable quality’ andsurprise why a digital gear mechanism mustn't deliverprecisely the same data to the sink as accepted from thesupply. A broad and general answer to such question at nowis: well, it depends on the designer’s understanding of the‘channel’ (Fig. 1.1) and the way the designer will translatehis data to style the signal process algorithms / techniqueswithin the ’Encoder’ and ‘decoder’ blocks in Fig. 1.1 wetend to hope to select up many basic nonetheless smartapproaches to amass the higher than skills. However,pioneering add the 1940-s and 1950-s have established abottom-line to the look for ‘a unflawed (equivalently, ‘errorless’) data communication system’ delivery out manyprofound theorems (which currently get into the name ofknowledge Theory) to ascertain that, whereas error-lesstransmission of knowledge will ne'er be secured, the other‘acceptable quality’, haphazardly getting ready to error-lesstransmission could also be doable. This ‘possibility’ ofvirtually error-less data transmission has driven importantanalysis over the last 5 decades in multiple connected areassimilar to, a) digital modulation schemes, b) errormanagement techniques, c) optimum receiver style, d)modeling and characterization of channel so forth. As aresult, varieties of electronic communication systems aredesigned and place to use over the years and therefore theoverall performance has improved considerably �——1 ComputerEngineering Department, University of Technology, IraqEmail: alikamal1@yahoo.comIJSER 2016http://www.ijser.org1

INTERNATIONAL JOURNAL OF SCIENTIFIC & ENGINEERING RESEARCH, VOLUME 7, ISSUE 8, AUGUST-2016ISSN 2229-5518Figure 1.1: Basic block diagram of a digital communicationsystemII. DIGITAL COMMUNICATION SYSTEMIt is attainable to expand our basic ‘three-entity’ descriptionof an electronic communication system in multiple ways inwhich. as an example, Fig. 2.1 shows a somewhat elaboratediagram expressly showing the vital processes of‘modulation demodulation’, ‘source coding-decoding’ and‘channel cryptography – decoding’. A reader might havemultiple queries with reference to this sort of abstraction. asan example, once ‘information’ has got to be sent over anoutsized distance, it's a standard information that the signalought to be amplified in terms of power and so began thephysical transmission medium. Diagrams of the kind in Figs.1.1 and 2.1 have no explicit reference to such issues.However, the issue here is more of suitable representation ofa system for clarity rather than a module-by-modulereplication of an operational digital communication system.‘modulation channel’. We will see later that a modulationchannel usually accepts modulated signals as analogwaveforms at its inputs and delivers another version of themodulated signal in the form of analog waveforms. Suchchannels are also referred as ‘waveform channels’. The‘channel’ in Fig. 1.1, on the other hand, appears to acceptsome ‘encoded’ information from the source and deliversome ‘decoded’ information to the sink. Both the figures arepotentially useful for describing the same digitalcommunication system. On comparison of the two figures,the reader is encouraged to infer that the ‘channel’ in Fig.1.1 includes the ‘modulation channel’ and the modulationdemodulation operations of Fig. 2.1 The ‘channel’ of Fig.1.1 is widely denoted as a ‘discrete channel’, implying thatit accepts discrete-time-discrete-amplitude signals and alsodelivers discrete-time discrete-amplitude signals [2].III. MODULATION TECHNIQUEA. Amplitude-Shift Keying (ASK) ModulationThe transmission of digital signals is increasing at a speedyrate. Low-frequency analogue signals area unit typicallyborn-again to digital format (PAM) before transmission. Thesupply signals area unit typically noted as baseband signals.Of course, we will send analogue and digital signals directlyover a medium. From electro-magnetic theory, foreconomical radiation of current from associate degreeantenna it should be a minimum of within the order ofmagnitude of a wavelength in size;c f λ , wherever c is that the rate of sunshine, f is that thesignal frequency and λ is that the wavelength. For a 1kHzaudio signal, the wavelength is three hundred kilometer.associate degree antenna of this size isn't sensible foreconomical transmission. The low-frequency signal iscommonly frequency-translated to the next frequency varyfor economical transmission. the method is namedmodulation. the utilization of the next frequency varyreduces antenna size.In the modulation method, the baseband signals represent themodulating signal and therefore the high-frequency carriersignal may be a curved wave. There are a unit 3 basic waysthat of modulating a undulation carrier. For binary digitalmodulation, they're referred to as binary amplitude-shiftkeying (BASK), binary frequency-shift keying (BFSK) andbinary phase-shift keying (BPSK). Modulation conjointlyresults in the likelihood of frequency multiplexing. in a veryfrequency-multiplexed system, individual signals area unittransmitted over adjacent, non-overlapping frequencybands. they're thus transmitted in parallel and at the sametime in time. If we tend to operate at higher carrierfrequencies, a lot of information measure is obtainable forfrequency-multiplexing a lot of signals.IJSERFigure 2.1: A possible breakup of the pervious diagram(following Shannon’s ideas)To elaborate this potentially useful style of representation,let us note that we have hardly discussed about the thirdentity of our model, viz. the ‘channel’. One can defineseveral types of channel. For example, the ‘channel’ in Fig.2.1 should more appropriately be called as a ‘modulationchannel’ with an understanding that the actual transmissionmedium (called ‘physical channel’), any electromagnetic (orotherwise) transmission- reception operations, amplifiers atthe transmission and reception ends and any other necessarysignal processing units are combined together to form thisIJSER 2016http://www.ijser.org2

INTERNATIONAL JOURNAL OF SCIENTIFIC & ENGINEERING RESEARCH, VOLUME 7, ISSUE 8, AUGUST-2016ISSN 2229-5518A binary amplitude-shift keying (BASK) signal is outlinedbys(t) A m(t) cos2πf c t,0 t TWhere A is constant, m(t) 1 or 0 , f c is the carrierfrequency and T is the bit duration. It has a power P 𝐴𝐴2 /2, so that A 2𝑃𝑃 this equation can be written asS(t) 2𝑃𝑃 cos2πf c t0 t T 𝑃𝑃𝑃𝑃 2/𝑇𝑇 cos2πf c t 𝐸𝐸 2/𝑇𝑇cos2πf c t0 t TFigure 3.2: BFSK Modulation0 t TThe output of the Matlab code for BASK modulationshown in figure (3.1) has the following parameters: Carrierfrequency 8 with Message frequency 4C. Phase-Shift Keying (PSK) ModulationPhase-shift keying (PSK) may be a digital modulationtheme that conveys information by dynamical, ormodulating, the section of a reference signal (the carrierwave). Any digital modulation theme uses a finite range ofdistinct signals to represent digital informationA binary phase-shift keying (BPSK) signal can be definedby0 t Ts(t) A m(t) cos 2πf c tIJSERwhere A is a constant, m (t) 1 or -1, f c is the carrierfrequency, and T is the bit duration. The signal has a powerP A2/2, so that A 2𝑃𝑃 .The output of the Matlab code for BPSK modulation shownin figure (3.3) has the following parameters: Carrierfrequency 8 with Message frequency 4Figure 3.1: BASK ModulationB. Frequency-Shift Keying (FSK) ModulationFrequency-shift keying (FSK) may be a modulation themeduring which digital data is transmitted through distinctfrequency changes of a radio emission. the only FSK isbinary FSK (BFSK). BFSK uses a combine of distinctfrequencies to transmit binary (0s and 1s) dataA binary frequency-shift keying (BFSK) signal can bedefined by𝐴𝐴 𝑐𝑐𝑐𝑐𝑐𝑐2𝜋𝜋𝑓𝑓0 𝑡𝑡S(t) 𝐴𝐴 𝑐𝑐𝑐𝑐𝑐𝑐2𝜋𝜋𝑓𝑓1 𝑡𝑡where A is a constant, f 0 and f 1 are the transmittedfrequencies, and T is the bitduration. duration. The output of the Matlab code for BFSKmodulation shown in figure (3.2) has the followingparameters: 1st Carrier frequency 16, 2nd Carrierfrequency 8 with Message frequency 4IJSER 2016http://www.ijser.orgFigure 3.3: BPSK Modulation3

INTERNATIONAL JOURNAL OF SCIENTIFIC & ENGINEERING RESEARCH, VOLUME 7, ISSUE 8, AUGUST-2016ISSN 2229-5518D. M-ary Phase-Shift Keying (M - PSK)An M-ary phase-shift keying (M-PSK) signal can be definedbys(t) 𝐴𝐴 cos 2𝜋𝜋𝑓𝑓𝑐𝑐 𝑡𝑡 𝜃𝜃𝑗𝑗 𝜃𝜃 ′ ,0where 𝜃𝜃𝑗𝑗 2𝜋𝜋𝑀𝑀𝑖𝑖0 𝑡𝑡 �𝑒𝑒𝑒𝑒𝑒𝑒for i 0, 1, ., M - 1. Here, A is a constant, f c is the carrierfrequency, θ' is the initial phase angle, and T is the symbolduration.Figure 3.5: 8PSK ModulationIV. BIT ERROR RATEThe bit error rate (BER), or perhaps more appropriately thebit error ratio, is the number of bits received in errordivided by the total number of bits transferred. We canestimate the BER by calculating the probability that a bitwill be incorrectly received due to noise.IJSERA. BPSK BERThe output of the Matlab code for BPSK BER shown infigure (4.1) has the following parameters: SNR from 1 to20, Number of Bit 1000000 and Energy Bit 1The output of the Matlab code for QPSK modulationshown in figure (3.4) has the following parameters: Carrierfrequency 8Figure 4.1: BPSK Bit Error RateFigure 3.4: QPSK ModulationThe output of the Matlab code for 8PSK modulation shownin figure (3.5) has the following parameters: Carrierfrequency 8 with Message input [0 2 5 1 6 3 4 7]The Matlab Simulink block diagram of the for BPSKshown in figure (4.2) with transmitted and received bits infigure (4.3) and the BER performance in figure (4.4)IJSER 2016http://www.ijser.org4

INTERNATIONAL JOURNAL OF SCIENTIFIC & ENGINEERING RESEARCH, VOLUME 7, ISSUE 8, AUGUST-2016ISSN 2229-5518Figure 4.2: BPSK Block DiagramFigure 4.5: QPSK Bit Error RateThe Matlab Simulink block diagram of the for QPSKshown in figure (4.6) with transmitted and received bits infigure (4.7) and the BER performance in figure (4.8)IJSERFigure 4.3: BPSK Transmitted and Received BitsFigure 4.6: QPSK Block DiagramFigure 4.4: BPSK BER PerformanceB. QPSK BERThe output of the Matlab code for QPSK BER shown infigure (4.5) has the following parameters: SNR from 1 to20 , Number of Bit 1000000 and Energy Bit 1Figure 4.7: QPSK Transmitted and Received BitsIJSER 2016http://www.ijser.org5

INTERNATIONAL JOURNAL OF SCIENTIFIC & ENGINEERING RESEARCH, VOLUME 7, ISSUE 8, AUGUST-2016ISSN 2229-5518Figure 4.11: 8PSK Transmitted and Received BitsFigure 4.8: QPSK BER PerformanceC. 8PSK BERThe output of the Matlab code for 8PSK BER shown infigure (4.9) has the following parameters: SNR from 1 to20 , Number of Bit 1000000 and Energy Bit 1Figure 4.12: 8PSK BER Performanceusing Matlab Simulink for modeling the modulation processand Bit Error Rate performance by using the following blockparameter showing in table 3.1IJSERTable 3.1: Input Parameter Table of the Matlab SimulinkBlockBlock ure 4.9: 8PSK Bit Error RateThe Matlab Simulink block diagram of the for QPSKshown in figure (4.10) with transmitted and received bits infigure (4.11) and the BER performance in figure (4.12)AWGNChannelMPSKDemodulatorBasebandError RateCalculationParameter NameBPSK QPSK 8PSKM-ary NumberInitial SeedSample TimeSample per FrameOutput data type2 4 83711e6DoubleM-ary NumberPhase offset (rad)Constellation orderingInput TypeOutput Type2 4 8Pi/2 Pi/4 Pi/8BinaryIntegerDoubleInitial SeedModeEb/No (dB)Number of bit per SymbolInput Signal Power (Watt)Symbol Period37Signal to Noise Ratio(Eb/No)EbNodB11M-ary NumberPhase offset (rad)Constellation orderingOutput Type2 4 8Pi/2 Pi/4 Pi/8BinaryIntegerReceive DelayComputation DelayComputation ModeOutput DataVariable NameStop SimulationTarget Number of ErrorsMaximum Number ofSymbols00Entire FrameWorkspaceBER DATACheckedInf1e6Figure 4.10: 8PSK Block DiagramIJSER 2016http://www.ijser.org6

INTERNATIONAL JOURNAL OF SCIENTIFIC & ENGINEERING RESEARCH, VOLUME 7, ISSUE 8, AUGUST-2016ISSN 2229-5518V. CONVOLUTIONAL ENCODER TCM [3]A Convolutional encoder accepts a sequence of n bits and itproduces at its output 𝑙𝑙 binary coded digits at any time. Ingeneral, a convolutional encoder with a memory of L bitsmay be considered as a finite-state machine (or finitememory system rather than memory less system, as in thecase of the block encoder) with 2𝑙𝑙 possible states. The stateof the encoder at any time instant is determined by thecontents of its store (delay unit) at that time instant.Let the n input digits form the n-component vector. . . . . . (5.1)𝑎𝑎𝑖𝑖 [𝑎𝑎𝑖𝑖,1 𝑎𝑎𝑖𝑖,2 . . . . . . . . . 𝑎𝑎𝑖𝑖,𝑛𝑛 ]And let the 𝑙𝑙 output digits form the 𝑙𝑙-component vector. . . . . . (5.2)𝛽𝛽𝑖𝑖 [ 𝛽𝛽𝑖𝑖,0 𝛽𝛽𝑖𝑖,1 . . . . . . . . .𝛽𝛽𝑖𝑖,𝑙𝑙 1 ]Also let the state of the encoder be defined as the Lcomponent vector. . . . . . (5.3)𝜇𝜇𝑖𝑖 [ 𝜇𝜇𝑖𝑖,0 𝜇𝜇𝑖𝑖,1 . . . . . . . . .𝜇𝜇𝑖𝑖,𝐿𝐿 1 ]Where the binary digits 𝛼𝛼𝑖𝑖,ℎ ,𝛽𝛽𝑖𝑖,ℎ and 𝜇𝜇𝑖𝑖,ℎ may take any oneof their two possible values 0 and 1.The operation of the convolutional encoder may now bedescribed as follows: for each input sequence 𝛼𝛼𝑖𝑖 ,the encodergenerates the sequence 𝛽𝛽𝑖𝑖 at its output ,while changing itsstate from 𝜇𝜇𝑖𝑖 to its next state 𝜇𝜇𝑖𝑖 1 .since for every n inputbits , 𝑙𝑙 bits are produced by the encoder ,so the rate of theconvolutional encoder is R n/ 𝑙𝑙.As an example, Figure (5.1) shows a 4-state convolutionalthe minimum squared Euclidean distance sometime calledthe free Euclidean distance is defined asfor all I,j. . . . . .(5.4)𝑑𝑑12 𝑀𝑀𝑀𝑀𝑀𝑀𝑖𝑖 𝑗𝑗 . 𝑆𝑆𝑖𝑖 -𝑆𝑆𝑗𝑗 2Where 𝑆𝑆𝑖𝑖 and 𝑆𝑆𝑗𝑗 assume all valid pairs of coded sequencesthat the convolutional encoder/modulator combination canproduce and excludes all the cases whrer the two sequencesare identical . and 𝑆𝑆𝑖𝑖 -𝑆𝑆𝑗𝑗 is the unitary distance between thetwo sequences 𝑆𝑆𝑖𝑖 and 𝑆𝑆𝑗𝑗The asymptotic coding gain of the coded system over thecorresponding uncoded system is given by2). . . . . . (5.5)𝐺𝐺𝑐𝑐 (dB) 10𝐿𝐿𝐿𝐿𝐿𝐿10 (𝑑𝑑𝑓𝑓2 /𝑑𝑑𝑢𝑢𝑢𝑢Where 𝑑𝑑𝑓𝑓 is given by Eq. 5.4, and 𝑑𝑑𝑢𝑢𝑢𝑢 is the minimumEuclidean distance of the uncoded system .Here Eq.5.5assume that the average transmitted signal energy of thecoded and uncoded system is the same.For an example to find the 𝑑𝑑𝑓𝑓 and 𝐺𝐺𝑐𝑐 for a coded 4-PSKsignal with signal constellation (M 4) .let us consider theencoder in Figure (5.2) and its state-transition diagram inFigure(5.3).The 𝑑𝑑𝑓𝑓 can be calculated by assuming the correct state asthe all-zero state. . . . . . (5.6)𝑑𝑑𝑓𝑓2 𝑑𝑑 2 (0,3) 𝑑𝑑 2 (0,0) 𝑑𝑑 2 (0,2) 2 0 4 6Where 𝑑𝑑 2 (i,j) is the square Euclidean distance between thesignal points i and j , and I (or j) is the decimal representationof the output coded digits.The asymptotic coding gain of the coded 4-PSK ( in this2 4 isexample) over the uncoded 2-PSK with 𝑑𝑑𝑢𝑢𝑢𝑢. . . . . . (5.7)𝐺𝐺𝑐𝑐 10 𝐿𝐿𝐿𝐿𝐿𝐿10 (6/4) 1.7609 dBThus an advantage of about 1.76 dB in tolerance to AWGNcan be obtain with codingViterbi DecoderThe Viterbi decoding technique is one approach to themaximum likelihood detection of convolutional codes ingeneral, the Viterbi decoder operates by tracing through atrellis identical to that at the encoder in an attempt to emulatethe encoder’s behavior. At any given instant the decoderdoes not know the state of the encoder and does not try todecode this immediately. The decoder examines all possiblebranches to each state in the trellis stage. For each state .itcomputes a likelihood score, known as the branch cost(branch metric), from the received data and the datacorresponding to each branch.Each state has associated with it accost, which is the sumof the surviving branches cost up to that state (the survivingbranches are the branches which produce the smallest newstate cost). To determine the surviving branches, thebranches cost is added to the state cost in the previous stageof the trellis.After evaluating a number of stages of the trellis thesurviving paths in the latest stage will originate (with a highprobability) from a single state in the first stage of the trellis.After this. The most likely state of the encoder in the firststage will be known, and hence it can be deduced theoriginal input data, even though a decision has not yet beenmade for the latestIJSERIJSER 2016http://www.ijser.orgFigure 5.1: Four-State, rate ½ convolutional encoderFigure 5.2: General Structure of TCM7

INTERNATIONAL JOURNAL OF SCIENTIFIC & ENGINEERING RESEARCH, VOLUME 7, ISSUE 8, AUGUST-2016ISSN 2229-5518The Matlab Simulink block diagram of the for T

Figure 1.1: Basic block diagram of a digital communication system . II. D. IGITAL . C. OMMUNICATION . S. YSTEM. It is attainable to expand our basic ‘three-entity’ description of an electronic communication system in multiple ways in which. as an example, Fig. 2.1 shows a somewhat elaborate diagram expressly showing the vital processes of

Related Documents:

Texts of Wow Rosh Hashana II 5780 - Congregation Shearith Israel, Atlanta Georgia Wow ׳ג ׳א:׳א תישארב (א) ׃ץרֶָֽאָּהָּ תאֵֵ֥וְּ םִימִַׁ֖שַָּה תאֵֵ֥ םיקִִ֑לֹאֱ ארָָּ֣ Îָּ תישִִׁ֖ארֵ Îְּ(ב) חַורְָּ֣ו ם

International Journal of Scientific and Engineering Research, Volume 11, Issue 12, December 2020 1052 ISSN 2229-5518 IJSER 2020 http://www.ijser.org

Hambessa for their kind cooperation and encouragement in the final implementation of the thesis work. IJSER. International Journal of Scientific & Engineering Research Volume 8, Issue 6, June-2017 ISSN 2229-5518 . Space vector pulse width modulation . Pulse width modulation . Back electromagnetic force -axis synchronous current

based home automation system for remote control of home appliances is designed. 1.1 OVERVIEW OF THE SMART HOME The basic block diagram of the smart home system is shown in figure 1. A micro-controller is used to obtain values of physical conditions through sensors connected to it [4]. These integrated sensors such as the temperature . IJSER

Steel Industries and Six Sigma . Sandeep B Jadhav. 1. 2 Ganesh P Jadhav. Prof.S.N.Teli. 3 . 1. Saraswati College Of Engineering, Navi Mumbai, India . 22 127 valve body 200 36.6 200 36.6 0 23 219 mb cap 285 19.38 281 19.38 4 : IJSER. Steel Industries and Six Sigma International Journal of Scientific & Engineering Research Volume 5, Issue 12 .

1 INTRODUCTION . eologic mapping on the field is one of the main functions of a geologist, which is the basis of understanding the geologic history of an area [1]. Rocks after formation are subjected to weathering be it . Systematic geological mapping

experiment. Due to these properties of SNKr10, we can say that this bacterial is a potent bio-control agent and can be used as bio-fertilizer in sustainable agriculture. Key. words: Antimicrobial. activity, Biocontrol agent, GC-MS, IAA, Siderophore. 1. Introduction . Phyllosphere involves the total above-ground surfaces

Quantum Computing: An Introduction . Megha Khandelwal and Subho Sankar Chatterjee. 1. meghaworld29@gmail.com. 2. subhochatterjee21@yahoo.com. Abstract — Quantum computing is a subject that assembles ideas from classical quantum physics, information theory, and computer science. This paper describes the connection between information theory .