An APP Algorithm for Fading Channels using Forward-Only Prediction
|
|
- Ethan Austin
- 5 years ago
- Views:
Transcription
1 An APP Algorithm for Fading Channels using Forward-Only Prediction Anders ansson,, or Aulin, and eith M. Chugg Department of Computer Engineering Communication Sciences Institute Chalmers University of echnology University of Southern California Göteborg Los Angeles, CA , USA {ahansson, {hansson, ABSRAC A multiple-antenna receiver is proposed for achieving a diversity effect that partly overcomes the severity of continuous-time frequency-flat Rayleigh fading channels, and fast fading channels in particular. he error performance is further improved by bit interleaving and channel coding, where the encoders/channel is viewed as a serially concatenated system: a convolutional code (CC constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory form a joint inner code. In order to obtain a feasible detector structure, it is desirable to perform iterative decoding, which implies the need for an APP (a posteriori probability algorithm that can operate over fading channels. For this purpose, the well-nown BCJR algorithm (due to Bahl, Coce, Jeline, Raviv [] is generalized to handle channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended, but the chief performance gain is due to space diversity provided by the multiple antennas. INRODUCION Shortly after Berrou et al. announced that interleaved parallel concatenated convolutional codes (PCCC, socalled turbo codes [2], yield performance close to the theoretical Shannon capacity limits, serially concatenated codes (SCC were shown to offer comparable (and in some cases even superior performance [3]. he nearoptimal performance over additive white Gaussian noise (AWGN channels is partly due to the interleaver embedded in the code structure, which forms an overall concatenated code with very large memory. he analysis in [3] revealed that the use of a recursive systematic convolutional encoder (RSC as inner encoder guarantees an interleaver gain [3]. his fact further indicates that continuous phase modulation (CPM [4] should be equally suitable as an inner encoder (CPM is a recursive trellis code, achieving bandwidth efficient modulation at the same time. Such a system, SCCPM, has recently proved to give performance comparable to turbo codes both over AWGN channels [5] as well as over piecewise constant memoryless Rayleigh fading channels [6]. o simplify the treatment of the fading channel, the latter study assumes the detector has somehow attained perfect channel state information (CSI. Even without the ideal assumption of perfect CSI, excellent performance has been achieved for piecewise constant memoryless Rayleigh channels [7]. Such channel models have unfortunately a somewhat limited validity [8]. A few results have also been presented for PCCC over slow and fast Rayleigh fading channels [9]. he encoder proposed in [9] has the drawbac of being highly complex (it consists of two RSCs, two interleavers, one deinterleaver, and one differential encoder, leading to excessive decoding complexity. his paper analyzes an SCCPM system over continuous-time fading channels, i.e., over channels where the rate of variation of the fading process cannot be neglected [0]. o somewhat reduce the receiver complexity, only the most elementary non-trivial CPM member, namely MS (minimum shift eying [], [2] is treated. SYSEM AND CANNEL DESCRIPION An all-zero tail is first appended to the information bits, before the bits are fed to an outer CC. his is done in order to provide perfect nowledge of the terminal state of the outer trellis. Next, the coded pacage of bits is bit interleaved, MS modulated, and transmitted over the equivalent lowpass channel, which comprises D diversity lins. In each lin the transmitted sequence s (; t i of waveforms is perturbed by two time-varying random processes, one is the multiplicative fading vector f ( t (dimension D by, while the other is the additive thermal noise vector n ( t (dimension D by. he variable i in s (; t i refers to the hypothesis label, i.e., {,, 2 + i } [2]. he distorted signal is received by D identical, omnidirectional antenna elements, and can be expressed as follows by using a complex baseband notation [3]: [ r ( t L r ( t] = r( t = s ( t; i f( t + n( t, ( D where superscript denotes the transpose. Note that both f ( t and n ( t are complex-valued. he waveform
2 sequence s (; t i, the fading vector f ( t, and the noise vector n ( t are assumed to be statistically independent. Let us for simplicity assume that the noise vector is composed of independent, stationary, zero-mean, white Gaussian processes. If we in addition assume that noise processes in different diversity lins are equally strong, the noise covariance-function matrix can be written as: { t t+ τ } = N0 E n( n ( I δ( τ, (2 where denotes the ermitian (complex conjugate transpose, N 0 is the double-sided power spectral density, I is the identity matrix, and δ ( denotes Dirac s delta function. Let the propagation geometry be restricted to the horizontal plane, and consider the Fraunhofer region (or the far-field; i.e., assume plane wavefronts. hese two assumptions are reasonable, provided the distance between transmitter and receiver is sufficiently large [4], [5]. If we let x l be the (Euclidean geometrical vector for receiver antenna l, and denotes a unit vector normal to the wavefront impinging from an angle θ, the array response vector (or steering vector can be written as [6]: { j j } = g L g, (3 a ( θ exp η [ η [ D where η is the circular wavenumber, and g denotes scalar product. Now, following [7], the frequency-flat fading vector is zero-mean and has the following covariance-function matrix: { f t f t+ τ } = A θ0 J0( π fmτ s E ( ( (, 2 / θ0 + = ( θ ( θ dθ J0 ( 2 π fmτ / s, 2 a a θ0 where the angle of arrival (AOA has been modeled according to a uniform distribution over [ θ 0, θ 0 + ]. Further, J 0 ( is the zero-order Bessel function of the first ind and f m denotes the maximum Doppler frequency shift normalized to the symbol duration s. Below, we will consider the two fading rates f m = 0.0 and f m = 0., which corresponds to slow and fast fading, respectively. From (4 it is seen that the fading induces infinite memory, i.e., the correlation extends over all time separations. he receiver first extracts N observables in each symbol interval up to, i.e., the received continuous-time process is represented by a sequence of N random variables. he obtained observation vector, say r, could be built up either by sampling or by an orthogonal expansion [0], [8]. In this paper, the observables will be derived by Nyquist sampling the (4 lowpass filtered antenna signals, where the cutoff frequency W of the (ideal lowpass pre-filter is chosen such that the loss of information becomes negligible. he observables are then used for computing soft information that is fed to the inner SISO (soft-input softoutput module [3]. In addition, interleaved extrinsic APPs generated from the outer of the two constituent codes are fed to the inner SISO and used as a priori probabilities. Only in the very first iteration, before APPs have been generated for the outer code, no a priori information is provided. In a similar manner, the inner SISO computes extrinsic APPs that are deinterleaved and used as a priori information in the outer SISO. Information obtained about the inner tail bits is superfluous and simply dropped before deinterleaving. Finally, after a certain number of iterations, the detector arrives at a decision for each information bit. AN APP ALGORIM USING FORWARD-ONLY PREDICION he generation of APPs for the outer trellis is a standard procedure. See [3] for any details. owever, the original BCJR algorithm [] was derived for a discrete memoryless channel (DMC, while the branch metric in our inner tree depends on previously derived observables. his implies the need for a different APP algorithm. he authors of [9] face a similar problem, but their proposal is less general. he APP for edge number l at time index can be written as: b ( i ( r = ( r ( ( l APP( e P e C P e P( e, l, l, l, = C P( b ( i P r b ( i P e b ( i ( r b b (: i e, l b (: i e, l = C P ; ( i = C P ( i P ( i. where C is a normalization constant, b ( i is the bit sequence on hypothesis i, and b ( i : e, l denotes all bit sequences consistent with edge e, l. his quantity can be computed by the following recursive expressions, where the channel memory has been truncated to include only the L + most recent symbol intervals: (@ ( r ; b( r b r r b P i P i ( ( = P( ; ( i P( b ( i P ; ( i L L P( r ; b ( i P( b ( i P r r ; b ( i = P ( i γ (, i MS is not strictly bandlimited. (5 (6
3 and similarly: ( r + ; b + ( r ; b( ( r+ ; b+ ( r ; b ( + Pb ( + ( i P( r+ r ; b ( i ( 2 ; 2 ( + ; + r+ b+ r b ( + Pb ( + ( i P( r+ r+ L; b+ L( i P i P i i = P i i P i i + γ + = P ( i (. i Any realizable detector must truncate the (infinite channel memory and is inevitably suboptimal. owever, the correlation is fortunately a decreasing function of the time lag, which causes the approximation entailed in truncating the memory depth to become increasingly accurate as the truncation length is extended. As soon as the memory is truncated, the tree folds into a trellis. Note that the size of the trellis is determined by the truncation length, which is a design parameter. If the channel is truncated to include only the L + most recent symbol intervals, the modulation and the fading can thus described by a joint (time-invariant trellis having 2 L states. A trellis state is now defined as the L most recent data bits b ( fed to the MS modulator, while the L+ i (7 branches are labeled b Li (. Further, it is possible to terminate the inner trellis by appending L modulated zero tail bits to the transmitted waveform sequence, socalled post-interleaver flushing. From (5, the (approximated APP is finally obtained by summing over all possible sequences consistent with the considered edge. Since sequences that merge in the forward (or bacward direction will have identical branch metrics for all future (or past trellis sections, the summation in (5 can most efficiently be computed by means of the well-nown BCJR recursions []. his was also realized by Gertsman and Lodge [9]. We will now give an expression for the branch metric that proves to be equal to the classical MLSD (maximum-lielihood sequence detection metric [20]. Alternatively, using a set of linear prediction filters yield an equivalent result [20], [2], [22] (an approach taen in [9]. Let Z Li ( be a diagonal matrix comprising sam- ples of the unperturbed message sequence s L(; t i, and let F L denote the covariance matrix for samples of the fading process f ( t taen from time L up to, i.e., let F L be a discrete-time representation of (4. Since MS has constant envelope, i.e., ( i ( ( Es Z L i Z L = I, (8 s where E s is the symbol energy, it is possible to factorize the conditional covariance matrix for observables derived during symbol intervals L up to (the variance of each complex-valued noise sample is 2WN0 [23]: { ( i } s 0 ( L L L L C ( E r r b ( = Z L( i F L + 2 WN I Z L( i. Es Note that the determinant of C Li ( does not depend on the hypothesis i (due to the constant envelope, which leads to the following form of the (conditional loglielihood function: { p( r r L b L i } ( ( i ( ( i log ; ( L L L L L L (9 r C ( r r C ( r. (0 It is interesting to note that the forward and bacward recursions use the same branch metric. Recently, socalled bi-directional algorithms have proved to achieve a performance gain for channels where the parametric uncertainty is modeled as a Gauss-Marov process [24]. NUMERICAL RESULS Error performance in terms of bit error rate ( versus signal-to-noise ratio (SNR has been obtained from Monte-Carlo simulations with a minimum bit error limit of 000 errors. Samples of the fading vector f ( t were generated by means of a method similar to the one described in [25] (the correlation coefficients were derived by Cholesy decomposition. Moreover, we investigated systems with a (7,5 convolutional encoder and a 024 o bit interleaver, assuming the mean AOA θ 0 = 45 and the azimuth spread 2 = 90 o. Figure shows the five first iterations for a twoelement array with antenna separation 0.5 carrier wavelengths, operating over a fading channel with bandwidth f m = 0.. Clearly, the receiver gains from increasing the exploited channel memory. Specifically, the iteration gain becomes more significant for large truncation lengths L, but recall from (0 that this performance improvement is achieved at the cost of considerably higher detection complexity. Figure 2 shows the three first iterations and assumes f m = 0.. hree different antenna constellation were investigated: a single antenna, a two-element array with antenna separation 0.5 carrier wavelengths, and a fourelement array with the elements equidistantly placed at a
4 circle with diameter 0.5 carrier wavelengths. Even though there is little to gain from running more than two iterations, there is obviously much to gain from spacediversity; the error performance of our proposed array receiver is superior to previously published results obtained for fast fading channels [20], [9]. An explanation to the moderate iteration gain is that only hard decisions are circulating between the inner and outer SISO modules after the second iteration. his might be improved by replacing MS be a CPM scheme with larger memory, thus obtaining a stronger inner code. In figure 3, the two fading bandwidths f m = 0.0 and f m = 0. have been investigated for a single-antenna receiver, as well as for a two-element array with antenna separation 0.5 wavelengths. When the fading rate is slow compared with the transmission rate, i.e., when f m = 0.0, iterating more than two times is seen to become somewhat more powerful. Figure : Error performance for various truncation lengths runcation Length L=2 L=4 L=6 D= (Single Antenna D=2 (2 Element Array D=4 (4 Element Array Figure 2: Error performance for various antenna constellations Figure 3: Error performance for various fading bandwidths and antennas. CONCLUSIONS his paper has generalized the BCJR algorithm to be valid for fading channels. Moreover, numerical results indicated that iterative decoding offers a limited performance gain for fast fading channels, because most of the improvement is achieved in the second iteration. With a large truncation length L, the performance is significantly improved but the cost is unfortunately high decoding complexity. owever, a comparable or even superior gain is easily achieved by using additional receiver antenna elements. Stimulated by the good results in [24], the authors are currently woring on generalizing the bi-directional algorithms to handle the more general channel model that was used in this paper. REFERENCES D=, f m =0. D=, f m =0.0 D=2, f m =0. D=2, f m =0.0 [] L. R. Bahl, J. Coce, F. Jeline, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate, IEEE rans. Inform. heory, vol. 20, pp , Mar [2] C. Berrou, A. Glavieux, and P. hitimajshima, Near Shannon limit error-correcting coding and decoding: urbo codes, Proc. IEEE International Conf. Commun. (ICC 93, pp , Geneva, May 993. [3] S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, Serial concatenation of interleaved codes, IEEE rans. Inform. heory, vol. 44, no. 3, pp , May 998. [4]. Aulin, CPM A Power and Bandwidth Efficient Digital Constant Envelope Modulation Scheme, Ph. D. dissertation, University of Lund, Sweden, Nov. 979.
5 [5] P. Moqvist and. Aulin, Power and bandwidth efficient serially concatenated CPM with iterative decoding, Proc. IEEE Global elecommun. Conf. (GLOBECOM 00, San Francisco, Nov./Dec [6] C. Brutel and J. Boutros, Serial concatenation of interleaved convolutional codes and M-ary continuous phase modulations, Ann. élécommunications, vol. 54, no. 3/4, pp , Mar./Apr [7] M. Peleg and S. Shamai (Shitz, Efficient Communication over memoryless Rayleigh fading channels with turbo coding/decoding, Proc. IEEE International Conf. Commun. (ICC 99, pp , Vancouver, June 999. [8] E. Biglieri, J. Proais, and S. Shamai (Shitz, Fading Channels: Information-theoretic and communication aspects, IEEE rans. Inform. heory, vol. 44, no. 6, pp , Oct [9] I. D. Marsland and P.. Mathiopoulos, Multiple differential detection of parallel concatenated convolutional (turbo codes in correlated fast Rayleigh fading, IEEE J. Select. Areas Comm., vol. 6, no. 2, pp , Feb [0] U. ansson and. Aulin, Aspects on single symbol signaling on the frequency flat Rayleigh fading channel, IEEE rans. Commun., vol. 47, no. 6, pp , June 999. [] S. Pasupathy, Minimum shift eying. A spectrally efficient modulation, IEEE Commun. Mag., pp. 4 22, July 979. [2] B. Rimoldi, A decomposition approach to CPM, IEEE rans. Inform. heory, vol. 34, no. 2, pp , Mar [3] J. G. Proais, Digital Communications, 3 rd ed., McGraw-ill, 995. [4] P. C. F. Eggers, Angular propagation descriptions relevant for base station adaptive antenna operation, luwer Personal Commun., vol., no., pp. 3 29, Oct [5] C. A. Balanis, Antenna heory: Analysis and Design, arper & Row, 982. [6] S. R. Saunders, Antenna and Propagation for Wireless Communication Systems, John Wiley & Sons, 999. [7] A. F. Naguib, Adaptive Antennas for CDMA Wireless Networs, Ph. D. dissertation, Stanford University, Aug [8] A. ansson and. Aulin, On antenna array receiver principles for space-time-selective Rayleigh fading channels, IEEE rans. Commun., vol. 48, no. 4, pp , Apr [9] M. Gertsman and J. Lodge, Symbol-by-symbol MAP demodulation of CPM and PS signals on Rayleigh flat-fading channels, IEEE rans. Commun., vol. 45, no. 7, pp , July 997. [20] U. ansson, Efficient Digital Communication over the ime Continuous Rayleigh Fading Channel, Ph. D. dissertation, Chalmers Univ. ech., Dec [2] J.. Lodge and M. L. Moher, Maximum lielihood sequence estimation of CPM signals transmitted over Rayleigh flat-fading channels, IEEE rans. Commun., vol. 38, no. 6, pp , June 990. [22] X. Yu and S. Pasupathy, Innovations-based MLSE for Rayleigh fading channels, IEEE rans. Commun., vol. 43, no. 2/3/4, pp , Feb./Mar./Apr [23] C. Schlegel, rellis Coding, IEEE Press, 997. [24] A. Anastasopoulos,. Chugg, Adaptive soft-input soft-output algorithms for iterative detection with parametric uncertainty, IEEE rans. Commun., vol. 48, no. 0, pp , Oct [25] A. ansson and. Aulin, Generation of N correlated Rayleigh fading processes for the simulation of space-time-selective radio channels, Proc. European Wireless 99, Munich, pp , Oct. 999.
A rate one half code for approaching the Shannon limit by 0.1dB
100 A rate one half code for approaching the Shannon limit by 0.1dB (IEE Electronics Letters, vol. 36, no. 15, pp. 1293 1294, July 2000) Stephan ten Brink S. ten Brink is with the Institute of Telecommunications,
More informationSNR Estimation in Nakagami-m Fading With Diversity Combining and Its Application to Turbo Decoding
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 11, NOVEMBER 2002 1719 SNR Estimation in Nakagami-m Fading With Diversity Combining Its Application to Turbo Decoding A. Ramesh, A. Chockalingam, Laurence
More informationSNR Estimation in Nakagami Fading with Diversity for Turbo Decoding
SNR Estimation in Nakagami Fading with Diversity for Turbo Decoding A. Ramesh, A. Chockalingam Ý and L. B. Milstein Þ Wireless and Broadband Communications Synopsys (India) Pvt. Ltd., Bangalore 560095,
More informationStudy of Turbo Coded OFDM over Fading Channel
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 3, Issue 2 (August 2012), PP. 54-58 Study of Turbo Coded OFDM over Fading Channel
More informationNotes 15: Concatenated Codes, Turbo Codes and Iterative Processing
16.548 Notes 15: Concatenated Codes, Turbo Codes and Iterative Processing Outline! Introduction " Pushing the Bounds on Channel Capacity " Theory of Iterative Decoding " Recursive Convolutional Coding
More informationEFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS
EFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS Manjeet Singh (ms308@eng.cam.ac.uk) Ian J. Wassell (ijw24@eng.cam.ac.uk) Laboratory for Communications Engineering
More informationThe BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying
The BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying Rohit Iyer Seshadri, Shi Cheng and Matthew C. Valenti Lane Dept. of Computer Sci. and Electrical Eng. West Virginia University Morgantown,
More informationMaster s Thesis Defense
Master s Thesis Defense Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry Kanagaraj Damodaran August 14, 2008 Committee Dr. Erik Perrins (Chair) Dr. Victor Frost Dr. James
More informationMaster s Thesis Defense
Master s Thesis Defense Comparison of Noncoherent Detectors for SOQPSK and GMSK in Phase Noise Channels Afzal Syed August 17, 2007 Committee Dr. Erik Perrins (Chair) Dr. Glenn Prescott Dr. Daniel Deavours
More informationOn the performance of Turbo Codes over UWB channels at low SNR
On the performance of Turbo Codes over UWB channels at low SNR Ranjan Bose Department of Electrical Engineering, IIT Delhi, Hauz Khas, New Delhi, 110016, INDIA Abstract - In this paper we propose the use
More informationPERFORMANCE OF TWO LEVEL TURBO CODED 4-ARY CPFSK SYSTEMS OVER AWGN AND FADING CHANNELS
ISTANBUL UNIVERSITY JOURNAL OF ELECTRICAL & ELECTRONICS ENGINEERING YEAR VOLUME NUMBER : 006 : 6 : (07- ) PERFORMANCE OF TWO LEVEL TURBO CODED 4-ARY CPFSK SYSTEMS OVER AWGN AND FADING CHANNELS Ianbul University
More informationParallel Concatenated Turbo Codes for Continuous Phase Modulation
Parallel Concatenated Turbo Codes for Continuous Phase Modulation Mark R. Shane The Aerospace Corporation El Segundo, CA mark.r.shane@aero.org Richard D. Wesel Electrical Engineering Department University
More informationTHE idea behind constellation shaping is that signals with
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 3, MARCH 2004 341 Transactions Letters Constellation Shaping for Pragmatic Turbo-Coded Modulation With High Spectral Efficiency Dan Raphaeli, Senior Member,
More informationLow Complexity Decoding of Bit-Interleaved Coded Modulation for M-ary QAM
Low Complexity Decoding of Bit-Interleaved Coded Modulation for M-ary QAM Enis Aay and Ender Ayanoglu Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer
More informationPerformance of Nonuniform M-ary QAM Constellation on Nonlinear Channels
Performance of Nonuniform M-ary QAM Constellation on Nonlinear Channels Nghia H. Ngo, S. Adrian Barbulescu and Steven S. Pietrobon Abstract This paper investigates the effects of the distribution of a
More informationDifferentially-Encoded Turbo Coded Modulation with APP Channel Estimation
Differentially-Encoded Turbo Coded Modulation with APP Channel Estimation Sheryl Howard Dept of Electrical Engineering University of Utah Salt Lake City, UT 842 email: s-howard@eeutahedu Christian Schlegel
More informationTURBOCODING PERFORMANCES ON FADING CHANNELS
TURBOCODING PERFORMANCES ON FADING CHANNELS Ioana Marcu, Simona Halunga, Octavian Fratu Telecommunications Dept. Electronics, Telecomm. & Information Theory Faculty, Bd. Iuliu Maniu 1-3, 061071, Bucharest
More informationBit-Interleaved Coded Modulation: Low Complexity Decoding
Bit-Interleaved Coded Modulation: Low Complexity Decoding Enis Aay and Ender Ayanoglu Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer Science The Henry
More informationIterative Demodulation and Decoding of DPSK Modulated Turbo Codes over Rayleigh Fading Channels
Iterative Demodulation and Decoding of DPSK Modulated Turbo Codes over Rayleigh Fading Channels Bin Zhao and Matthew C. Valenti Dept. of Comp. Sci. & Elect. Eng. West Virginia University Morgantown, WV
More informationDepartment of Electronic Engineering FINAL YEAR PROJECT REPORT
Department of Electronic Engineering FINAL YEAR PROJECT REPORT BEngECE-2009/10-- Student Name: CHEUNG Yik Juen Student ID: Supervisor: Prof.
More informationDecoding of Block Turbo Codes
Decoding of Block Turbo Codes Mathematical Methods for Cryptography Dedicated to Celebrate Prof. Tor Helleseth s 70 th Birthday September 4-8, 2017 Kyeongcheol Yang Pohang University of Science and Technology
More informationComparison Between Serial and Parallel Concatenated Channel Coding Schemes Using Continuous Phase Modulation over AWGN and Fading Channels
Comparison Between Serial and Parallel Concatenated Channel Coding Schemes Using Continuous Phase Modulation over AWGN and Fading Channels Abstract Manjeet Singh (ms308@eng.cam.ac.uk) - presenter Ian J.
More informationBERROU et al. introduced turbo codes in 1993 [1], which
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 4, NO. 2, MARCH 2005 397 Blind Equalization of Turbo Trellis-Coded Partial-Response Continuous-Phase Modulation Signaling Over Narrow-Band Rician Fading
More informationDESIGN OF CHANNEL CODING METHODS IN HV PLC COMMUNICATIONS
DESIGN OF CHANNEL CODING MEHODS IN HV PLC COMMUNICAIONS Aljo Mujčić, Nermin Suljanović, Matej Zajc, Jurij F. asič University of Ljubljana, Faculty of Electrical Engineering, Digital Signal Processing Laboratory
More informationPerformance of Parallel Concatenated Convolutional Codes (PCCC) with BPSK in Nakagami Multipath M-Fading Channel
Vol. 2 (2012) No. 5 ISSN: 2088-5334 Performance of Parallel Concatenated Convolutional Codes (PCCC) with BPSK in Naagami Multipath M-Fading Channel Mohamed Abd El-latif, Alaa El-Din Sayed Hafez, Sami H.
More informationPerformance comparison of convolutional and block turbo codes
Performance comparison of convolutional and block turbo codes K. Ramasamy 1a), Mohammad Umar Siddiqi 2, Mohamad Yusoff Alias 1, and A. Arunagiri 1 1 Faculty of Engineering, Multimedia University, 63100,
More informationDifferentially-Encoded Turbo Coded Modulation with APP Channel Estimation
Differentially-Encoded Turbo Coded Modulation with APP Channel Estimation Sheryl Howard Dept. of Electrical & Computer Engineering University of Alberta Edmonton, AB Canada T6G 2V4 Email: sheryl@ee.ualberta.ca
More informationInternational Journal of Wireless & Mobile Networks (IJWMN) Vol.2, No.4, November 2010
International Journal of Wireless & Mobile Networs (IJWMN) Vol., No.4, November 010 Turbo Detection in Rayleigh flat fading channel with unnown statistics Mohamed Lassaad AMMARI 1, Paul Fortier and Huu
More informationCOMMUNICATION SYSTEMS
COMMUNICATION SYSTEMS 4TH EDITION Simon Hayhin McMaster University JOHN WILEY & SONS, INC. Ш.! [ BACKGROUND AND PREVIEW 1. The Communication Process 1 2. Primary Communication Resources 3 3. Sources of
More informationIterative Equalizatioflecoding of TCM for Frequency-Selective Fading Channels *
Iterative Equalizatioflecoding of TCM for Frequency-Selective Fading Channels * Achilleas Anastasopoulos and Keith M. Chugg Communication Sciences Institute Electrical Engineering-Systems Dept. University
More informationECE 6640 Digital Communications
ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part
More informationAntennas and Propagation. Chapter 6b: Path Models Rayleigh, Rician Fading, MIMO
Antennas and Propagation b: Path Models Rayleigh, Rician Fading, MIMO Introduction From last lecture How do we model H p? Discrete path model (physical, plane waves) Random matrix models (forget H p and
More informationRobustness of Space-Time Turbo Codes
Robustness of Space-Time Turbo Codes Wei Shi, Christos Komninakis, Richard D. Wesel, and Babak Daneshrad University of California, Los Angeles Los Angeles, CA 90095-1594 Abstract In this paper, we consider
More informationInterference Mitigation in MIMO Interference Channel via Successive Single-User Soft Decoding
Interference Mitigation in MIMO Interference Channel via Successive Single-User Soft Decoding Jungwon Lee, Hyukjoon Kwon, Inyup Kang Mobile Solutions Lab, Samsung US R&D Center 491 Directors Pl, San Diego,
More informationTurbo Codes for Pulse Position Modulation: Applying BCJR algorithm on PPM signals
Turbo Codes for Pulse Position Modulation: Applying BCJR algorithm on PPM signals Serj Haddad and Chadi Abou-Rjeily Lebanese American University PO. Box, 36, Byblos, Lebanon serj.haddad@lau.edu.lb, chadi.abourjeily@lau.edu.lb
More informationPerformance Evaluation of different α value for OFDM System
Performance Evaluation of different α value for OFDM System Dr. K.Elangovan Dept. of Computer Science & Engineering Bharathidasan University richirappalli Abstract: Orthogonal Frequency Division Multiplexing
More informationAn Improved Rate Matching Method for DVB Systems Through Pilot Bit Insertion
Research Journal of Applied Sciences, Engineering and Technology 4(18): 3251-3256, 2012 ISSN: 2040-7467 Maxwell Scientific Organization, 2012 Submitted: December 28, 2011 Accepted: March 02, 2012 Published:
More informationAdvanced channel coding : a good basis. Alexandre Giulietti, on behalf of the team
Advanced channel coding : a good basis Alexandre Giulietti, on behalf of the T@MPO team Errors in transmission are fowardly corrected using channel coding e.g. MPEG4 e.g. Turbo coding e.g. QAM source coding
More informationLinear Turbo Equalization for Parallel ISI Channels
860 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 6, JUNE 2003 Linear Turbo Equalization for Parallel ISI Channels Jill Nelson, Student Member, IEEE, Andrew Singer, Member, IEEE, and Ralf Koetter,
More informationImpact of Antenna Geometry on Adaptive Switching in MIMO Channels
Impact of Antenna Geometry on Adaptive Switching in MIMO Channels Ramya Bhagavatula, Antonio Forenza, Robert W. Heath Jr. he University of exas at Austin University Station, C0803, Austin, exas, 787-040
More informationPerformance Analysis of Maximum Likelihood Detection in a MIMO Antenna System
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 2, FEBRUARY 2002 187 Performance Analysis of Maximum Likelihood Detection in a MIMO Antenna System Xu Zhu Ross D. Murch, Senior Member, IEEE Abstract In
More informationContents Chapter 1: Introduction... 2
Contents Chapter 1: Introduction... 2 1.1 Objectives... 2 1.2 Introduction... 2 Chapter 2: Principles of turbo coding... 4 2.1 The turbo encoder... 4 2.1.1 Recursive Systematic Convolutional Codes... 4
More informationSPACE TIME coding for multiple transmit antennas has attracted
486 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 3, MARCH 2004 An Orthogonal Space Time Coded CPM System With Fast Decoding for Two Transmit Antennas Genyuan Wang Xiang-Gen Xia, Senior Member,
More informationVOL. 3, NO.11 Nov, 2012 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.
Effect of Fading Correlation on the Performance of Spatial Multiplexed MIMO systems with circular antennas M. A. Mangoud Department of Electrical and Electronics Engineering, University of Bahrain P. O.
More informationECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010)
ECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010) Instructor: Kevin Buckley, Tolentine 433a, 610-519-5658 (W), 610-519-4436 (F), buckley@ece.vill.edu,
More informationCoding and Analysis of Cracked Road Image Using Radon Transform and Turbo codes
Coding and Analysis of Cracked Road Image Using Radon Transform and Turbo codes G.Bhaskar 1, G.V.Sridhar 2 1 Post Graduate student, Al Ameer College Of Engineering, Visakhapatnam, A.P, India 2 Associate
More informationBridging the Gap Between Parallel and Serial Concatenated Codes
Bridging the Gap Between Parallel and Serial Concatenated Codes Naveen Chandran and Matthew C. Valenti Wireless Communications Research Laboratory West Virginia University Morgantown, WV 26506-6109, USA
More informationCALIFORNIA STATE UNIVERSITY, NORTHRIDGE FADING CHANNEL CHARACTERIZATION AND MODELING
CALIFORNIA STATE UNIVERSITY, NORTHRIDGE FADING CHANNEL CHARACTERIZATION AND MODELING A graduate project submitted in partial fulfillment of the requirements For the degree of Master of Science in Electrical
More informationTHE EFFECT of multipath fading in wireless systems can
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 47, NO. 1, FEBRUARY 1998 119 The Diversity Gain of Transmit Diversity in Wireless Systems with Rayleigh Fading Jack H. Winters, Fellow, IEEE Abstract In
More informationComparison of MAP decoding methods for turbo codes
POSTER 2016, PRAGUE MAY 24 1 Comparison of MAP decoding methods for turbo codes Vitor ĎURČEK 1, Tibor PETROV 2 1,2 Dept. of Telecommunications and Multimedia, Faculty of Electrical Engineering, University
More informationPERFORMANCE ANALYSIS OF DIFFERENT M-ARY MODULATION TECHNIQUES IN FADING CHANNELS USING DIFFERENT DIVERSITY
PERFORMANCE ANALYSIS OF DIFFERENT M-ARY MODULATION TECHNIQUES IN FADING CHANNELS USING DIFFERENT DIVERSITY 1 MOHAMMAD RIAZ AHMED, 1 MD.RUMEN AHMED, 1 MD.RUHUL AMIN ROBIN, 1 MD.ASADUZZAMAN, 2 MD.MAHBUB
More informationn Based on the decision rule Po- Ning Chapter Po- Ning Chapter
n Soft decision decoding (can be analyzed via an equivalent binary-input additive white Gaussian noise channel) o The error rate of Ungerboeck codes (particularly at high SNR) is dominated by the two codewords
More informationFOR applications requiring high spectral efficiency, there
1846 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 11, NOVEMBER 2004 High-Rate Recursive Convolutional Codes for Concatenated Channel Codes Fred Daneshgaran, Member, IEEE, Massimiliano Laddomada, Member,
More informationLow complexity iterative receiver for Linear Precoded OFDM
Low complexity iterative receiver for Linear Precoded OFDM P.-J. Bouvet, M. Hélard, Member, IEEE, and V. Le Nir France Telecom R&D 4 rue du Clos Courtel, 3551 Cesson-Sévigné, France Email: {pierrejean.bouvet,maryline.helard}@francetelecom.com
More informationMULTIPATH fading could severely degrade the performance
1986 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 53, NO. 12, DECEMBER 2005 Rate-One Space Time Block Codes With Full Diversity Liang Xian and Huaping Liu, Member, IEEE Abstract Orthogonal space time block
More informationOn Performance Improvements with Odd-Power (Cross) QAM Mappings in Wireless Networks
San Jose State University From the SelectedWorks of Robert Henry Morelos-Zaragoza April, 2015 On Performance Improvements with Odd-Power (Cross) QAM Mappings in Wireless Networks Quyhn Quach Robert H Morelos-Zaragoza
More informationAN INTRODUCTION TO ERROR CORRECTING CODES Part 2
AN INTRODUCTION TO ERROR CORRECTING CODES Part Jack Keil Wolf ECE 54 C Spring BINARY CONVOLUTIONAL CODES A binary convolutional code is a set of infinite length binary sequences which satisfy a certain
More informationNear-Capacity Iteratively Decoded Binary Self-Concatenated Code Design Using EXIT Charts
Near-Capacity Iteratively Decoded Binary Self-Concatenated Code Design Using EXIT Charts Muhammad Fasih Uddin Butt 1,2, Raja Ali Riaz 1,2, Soon Xin Ng 1 and Lajos Hanzo 1 1 School of ECS, University of
More informationELEC E7210: Communication Theory. Lecture 11: MIMO Systems and Space-time Communications
ELEC E7210: Communication Theory Lecture 11: MIMO Systems and Space-time Communications Overview of the last lecture MIMO systems -parallel decomposition; - beamforming; - MIMO channel capacity MIMO Key
More informationDetection and Estimation of Signals in Noise. Dr. Robert Schober Department of Electrical and Computer Engineering University of British Columbia
Detection and Estimation of Signals in Noise Dr. Robert Schober Department of Electrical and Computer Engineering University of British Columbia Vancouver, August 24, 2010 2 Contents 1 Basic Elements
More informationAmplitude and Phase Distortions in MIMO and Diversity Systems
Amplitude and Phase Distortions in MIMO and Diversity Systems Christiane Kuhnert, Gerd Saala, Christian Waldschmidt, Werner Wiesbeck Institut für Höchstfrequenztechnik und Elektronik (IHE) Universität
More informationNear-Optimal Low Complexity MLSE Equalization
Near-Optimal Low Complexity MLSE Equalization Abstract An iterative Maximum Likelihood Sequence Estimation (MLSE) equalizer (detector) with hard outputs, that has a computational complexity quadratic in
More informationOutline. Communications Engineering 1
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband channels Signal space representation Optimal
More informationTURBO codes are an exciting new channel coding scheme
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 46, NO. 11, NOVEMBER 1998 1451 Turbo Codes for Noncoherent FH-SS With Partial Band Interference Joseph H. Kang, Student Member, IEEE, and Wayne E. Stark, Fellow,
More informationSPLIT MLSE ADAPTIVE EQUALIZATION IN SEVERELY FADED RAYLEIGH MIMO CHANNELS
SPLIT MLSE ADAPTIVE EQUALIZATION IN SEVERELY FADED RAYLEIGH MIMO CHANNELS RASHMI SABNUAM GUPTA 1 & KANDARPA KUMAR SARMA 2 1 Department of Electronics and Communication Engineering, Tezpur University-784028,
More informationChapter 3 Convolutional Codes and Trellis Coded Modulation
Chapter 3 Convolutional Codes and Trellis Coded Modulation 3. Encoder Structure and Trellis Representation 3. Systematic Convolutional Codes 3.3 Viterbi Decoding Algorithm 3.4 BCJR Decoding Algorithm 3.5
More informationPerformance of Channel Coded Noncoherent Systems: Modulation Choice, Information Rate, and Markov Chain Monte Carlo Detection
Performance of Channel Coded Noncoherent Systems: Modulation Choice, Information Rate, and Markov Chain Monte Carlo Detection Rong-Rong Chen, Member, IEEE, Ronghui Peng, Student Member, IEEE 1 Abstract
More informationCOMBINING GALOIS WITH COMPLEX FIELD CODING FOR HIGH-RATE SPACE-TIME COMMUNICATIONS. Renqiu Wang, Zhengdao Wang, and Georgios B.
COMBINING GALOIS WITH COMPLEX FIELD CODING FOR HIGH-RATE SPACE-TIME COMMUNICATIONS Renqiu Wang, Zhengdao Wang, and Georgios B. Giannakis Dept. of ECE, Univ. of Minnesota, Minneapolis, MN 55455, USA e-mail:
More informationAdaptive Wireless. Communications. gl CAMBRIDGE UNIVERSITY PRESS. MIMO Channels and Networks SIDDHARTAN GOVJNDASAMY DANIEL W.
Adaptive Wireless Communications MIMO Channels and Networks DANIEL W. BLISS Arizona State University SIDDHARTAN GOVJNDASAMY Franklin W. Olin College of Engineering, Massachusetts gl CAMBRIDGE UNIVERSITY
More informationFOR wireless applications on fading channels, channel
160 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 16, NO. 2, FEBRUARY 1998 Design and Analysis of Turbo Codes on Rayleigh Fading Channels Eric K. Hall and Stephen G. Wilson, Member, IEEE Abstract
More informationBER PERFORMANCE AND OPTIMUM TRAINING STRATEGY FOR UNCODED SIMO AND ALAMOUTI SPACE-TIME BLOCK CODES WITH MMSE CHANNEL ESTIMATION
BER PERFORMANCE AND OPTIMUM TRAINING STRATEGY FOR UNCODED SIMO AND ALAMOUTI SPACE-TIME BLOC CODES WITH MMSE CHANNEL ESTIMATION Lennert Jacobs, Frederik Van Cauter, Frederik Simoens and Marc Moeneclaey
More informationTheory of Telecommunications Networks
Theory of Telecommunications Networks Anton Čižmár Ján Papaj Department of electronics and multimedia telecommunications CONTENTS Preface... 5 1 Introduction... 6 1.1 Mathematical models for communication
More informationSoft-Output MLSE for IS-136 TDMA
Soft-Output MLSE for IS-136 TDMA ABSTRACT - An inner estimator for concatenated maximum a posteriori decoding of convolutionally encoded DQPSK affected by time- and frequency-selective fading is derived
More informationMaximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm
Maximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm Presented to Dr. Tareq Al-Naffouri By Mohamed Samir Mazloum Omar Diaa Shawky Abstract Signaling schemes with memory
More informationUniversity of Bristol - Explore Bristol Research
Lillie, A. G., Prado-Miguelez, A., Nix, A. R., & McGeehan, J. P. (2002). A comparison of multi-carrier OFDM and single carrier iterative equalisation for future high performance wireless local area networks.
More informationSerially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry
Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry c 2008 Kanagaraj Damodaran Submitted to the Department of Electrical Engineering & Computer Science and the Faculty of
More informationTHE common viewpoint of multiuser detection is a joint
590 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 47, NO. 4, APRIL 1999 Differentially Coherent Decorrelating Detector for CDMA Single-Path Time-Varying Rayleigh Fading Channels Huaping Liu and Zoran Siveski,
More informationDEGRADED broadcast channels were first studied by
4296 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 9, SEPTEMBER 2008 Optimal Transmission Strategy Explicit Capacity Region for Broadcast Z Channels Bike Xie, Student Member, IEEE, Miguel Griot,
More informationFundamentals of Digital Communication
Fundamentals of Digital Communication Network Infrastructures A.A. 2017/18 Digital communication system Analog Digital Input Signal Analog/ Digital Low Pass Filter Sampler Quantizer Source Encoder Channel
More informationBook Review. Dobri Atanassov Batovski
A Conceptual Review of Digital Communication Systems (Author: Simon Haykin, 2014) Haykin, S. 2014. Digital Communication Systems. John Wiley & Sons, Inc., Hoboken, NJ, USA. Available: .
More informationIterative Decoding for MIMO Channels via. Modified Sphere Decoding
Iterative Decoding for MIMO Channels via Modified Sphere Decoding H. Vikalo, B. Hassibi, and T. Kailath Abstract In recent years, soft iterative decoding techniques have been shown to greatly improve the
More informationImproved concatenated (RS-CC) for OFDM systems
Improved concatenated (RS-CC) for OFDM systems Mustafa Dh. Hassib 1a), JS Mandeep 1b), Mardina Abdullah 1c), Mahamod Ismail 1d), Rosdiadee Nordin 1e), and MT Islam 2f) 1 Department of Electrical, Electronics,
More informationDigital Communications I: Modulation and Coding Course. Term Catharina Logothetis Lecture 12
Digital Communications I: Modulation and Coding Course Term 3-8 Catharina Logothetis Lecture Last time, we talked about: How decoding is performed for Convolutional codes? What is a Maximum likelihood
More informationNONCOHERENT detection of digital signals is an attractive
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 47, NO. 9, SEPTEMBER 1999 1303 Noncoherent Sequence Detection of Continuous Phase Modulations Giulio Colavolpe, Student Member, IEEE, and Riccardo Raheli, Member,
More informationNSC E
NSC91-2213-E-011-119- 91 08 01 92 07 31 92 10 13 NSC 912213 E 011 119 NSC 91-2213 E 036 020 ( ) 91 08 01 92 07 31 ( ) - 2 - 9209 28 A Per-survivor Kalman-based prediction filter for space-time coded systems
More informationMulti-Path Fading Channel
Instructor: Prof. Dr. Noor M. Khan Department of Electronic Engineering, Muhammad Ali Jinnah University, Islamabad Campus, Islamabad, PAKISTAN Ph: +9 (51) 111-878787, Ext. 19 (Office), 186 (Lab) Fax: +9
More informationCoding for the Slepian-Wolf Problem With Turbo Codes
Coding for the Slepian-Wolf Problem With Turbo Codes Jan Bajcsy and Patrick Mitran Department of Electrical and Computer Engineering, McGill University Montréal, Québec, HA A7, Email: {jbajcsy, pmitran}@tsp.ece.mcgill.ca
More informationBER and PER estimation based on Soft Output decoding
9th International OFDM-Workshop 24, Dresden BER and PER estimation based on Soft Output decoding Emilio Calvanese Strinati, Sébastien Simoens and Joseph Boutros Email: {strinati,simoens}@crm.mot.com, boutros@enst.fr
More informationImprovement Of Block Product Turbo Coding By Using A New Concept Of Soft Hamming Decoder
European Scientific Journal June 26 edition vol.2, No.8 ISSN: 857 788 (Print) e - ISSN 857-743 Improvement Of Block Product Turbo Coding By Using A New Concept Of Soft Hamming Decoder Alaa Ghaith, PhD
More informationPerformance of Hybrid Concatenated Trellis Codes CPFSK with Iterative Decoding over Fading Channels
Performance of Hybrid Concatenated Trellis Codes CPFSK with Iterative Decoding over Fading Channels Labib Francis Gergis Misr Academy for Engineering and Technology Mansoura, Egypt IACSIT Senior Member,
More informationA low cost soft mapper for turbo equalization with high order modulation
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2012 A low cost soft mapper for turbo equalization
More informationLow Power Implementation of Turbo Code with Variable Iteration
International Journal of Electronics Communication Engineering. ISSN 0974-2166 Volume 4, Number 1 (2011), pp.41-48 International Research Publication House http://www.irphouse.com Low Power Implementation
More information_ MAPequalizer _ 1: COD-MAPdecoder. : Interleaver. Deinterleaver. L(u)
Iterative Equalization and Decoding in Mobile Communications Systems Gerhard Bauch, Houman Khorram and Joachim Hagenauer Department of Communications Engineering (LNT) Technical University of Munich e-mail:
More informationADAPTIVITY IN MC-CDMA SYSTEMS
ADAPTIVITY IN MC-CDMA SYSTEMS Ivan Cosovic German Aerospace Center (DLR), Inst. of Communications and Navigation Oberpfaffenhofen, 82234 Wessling, Germany ivan.cosovic@dlr.de Stefan Kaiser DoCoMo Communications
More informationdesigning the inner codes Turbo decoding performance of the spectrally efficient RSCC codes is further evaluated in both the additive white Gaussian n
Turbo Decoding Performance of Spectrally Efficient RS Convolutional Concatenated Codes Li Chen School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China Email: chenli55@mailsysueducn
More informationJoint Transmitter-Receiver Adaptive Forward-Link DS-CDMA System
# - Joint Transmitter-Receiver Adaptive orward-link D-CDMA ystem Li Gao and Tan. Wong Department of Electrical & Computer Engineering University of lorida Gainesville lorida 3-3 Abstract A joint transmitter-receiver
More informationChannel. Muhammad Ali Jinnah University, Islamabad Campus, Pakistan. Multi-Path Fading. Dr. Noor M Khan EE, MAJU
Instructor: Prof. Dr. Noor M. Khan Department of Electronic Engineering, Muhammad Ali Jinnah University, Islamabad Campus, Islamabad, PAKISTAN Ph: +9 (51) 111-878787, Ext. 19 (Office), 186 (Lab) Fax: +9
More informationNear-Optimal Low Complexity MLSE Equalization
Near-Optimal Low Complexity MLSE Equalization HC Myburgh and Jan C Olivier Department of Electrical, Electronic and Computer Engineering, University of Pretoria RSA Tel: +27-12-420-2060, Fax +27 12 362-5000
More informationNovel BICM HARQ Algorithm Based on Adaptive Modulations
Novel BICM HARQ Algorithm Based on Adaptive Modulations Item Type text; Proceedings Authors Kumar, Kuldeep; Perez-Ramirez, Javier Publisher International Foundation for Telemetering Journal International
More informationCombined Transmitter Diversity and Multi-Level Modulation Techniques
SETIT 2005 3rd International Conference: Sciences of Electronic, Technologies of Information and Telecommunications March 27 3, 2005 TUNISIA Combined Transmitter Diversity and Multi-Level Modulation Techniques
More information