| 000 | 12228nam a2201465 i 4500 | ||
|---|---|---|---|
| 001 | 5751607 | ||
| 003 | IEEE | ||
| 005 | 20191218152121.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 151221s2011 nju ob 001 eng d | ||
| 020 |
_a9780470978481 _qebook |
||
| 020 |
_z9780470972908 _qprint |
||
| 020 |
_z0470978481 _qelectronic |
||
| 024 | 7 |
_a10.1002/9780470978481 _2doi |
|
| 035 | _a(CaBNVSL)mat05751607 | ||
| 035 | _a(IDAMS)0b0000648151125e | ||
| 040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aTK5102.92 _b.H36 2002eb |
|
| 082 | 0 | 0 |
_a003/.54 _221 |
| 245 | 0 | 0 |
_aTurbo coding, turbo equalisation and space-time coding : _bexit-chart aided near-capacity designs for wireless channels / _cby L. Hanzo ... [et al.]. |
| 250 | _a2nd ed. | ||
| 264 | 1 |
_aChichester ; _bWiley, _c2011. |
|
| 264 | 2 |
_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[2011] |
|
| 300 | _a1 PDF (676 pages). | ||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aelectronic _2isbdmedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 500 | _aRev. ed. of: Turbo coding, turbo equalisation, and space-time coding / by L. Hanzo, T.H. Liew, B.L. Yeap. 2002. | ||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | 0 | _aAbout the Authors -- Other Related Wiley-IEEE Press Books -- Acknowledgements -- 1 Historical Perspective, Motivation and Outline -- 1.1 A Historical Perspective on Channel Coding -- 1.2 Motivation for this Book -- 1.3 Organisation of the Book -- 1.4 NovelContributions of the Book -- 2 Convolutional Channel Coding -- 2.1 Brief Channel Coding History -- 2.2 Convolutional Encoding -- 2.3 State and Trellis Transitions -- 2.4 The Viterbi Algorithm -- 2.5 Summary and Conclusions -- 3 Soft Decoding and Performance of BCH Codes -- 3.1 Introduction -- 3.2 BCH codes -- 3.3 Trellis Decoding -- 3.4 Soft-input Algebraic Decoding -- 3.5 Summary and Conclusions -- Part I Turbo Convolutional and Turbo Block Coding -- 4 Turbo Convolutional Coding (J. P. Woodard and L. Hanzo) -- 4.1 Introduction -- 4.2 Turbo Encoder -- 4.3 Turbo Decoder -- 4.4 Turbo-coded BPSK Performance over Gaussian Channels -- -- 4.5 Turbo Coding Performance over Rayleigh Channels -- 4.6 Summary and Conclusions -- 5 Turbo BCH Coding -- 5.1 Introduction -- 5.2 Turbo Encoder -- 5.3 Turbo Decoder -- 5.4 Turbo Decoding Example -- 5.5 MAP Algorithm for Extended BCH Codes -- 5.6 Simulation Results -- 5.7 Summary and Conclusions -- Part II Space-time Block and Space-time Trellis Coding -- 6 Space-time Block Codes -- 6.1 Classification of Smart Antennas -- 6.2 Introduction to Space-time Coding -- 6.3 Background -- 6.4 Space-time Block Codes -- 6.5 Channel-coded Space-time Block Codes -- 6.6 Performance Results -- 6.7 Summary and Conclusions -- 7 Space-time Trellis Codes -- 7.1 Introduction -- 7.2 Space-time Trellis Codes -- 7.3 Space-time-coded Transmission over Wideband Channels -- 7.4 Simulation Results -- 7.5 Space-time-coded Adaptive Modulation for OFDM -- 7.6 Summary and Conclusions -- 8 Turbo-coded Adaptive Modulation versus Space-time Trellis Codes for Transmission over Dispersive Channels -- 8.1 Introduction -- 8.2 System Overview -- 8.3 Simulation Parameters -- 8.4 Simulation Results -- 8.5 Summary and Conclusions. | |
| 505 | 8 | _aPart III Turbo Equalisation -- 9 Turbo-coded Partial-response Modulation -- 9.1 Motivation -- 9.2 The Mobile Radio Channel -- 9.3 Continuous Phase Modulation Theory -- 9.4 Digital Frequency Modulation Systems -- 9.5 State Representation -- 9.6 Spectral Performance -- 9.7 Construction of Trellis-based Equaliser States -- 9.8 Soft-output GMSK Equaliser and Turbo Coding -- 9.9 Summary and Conclusions -- 10 Turbo Equalisation for Partial-response Systems -- 10.1 Motivation -- 10.2 Principle of Turbo Equalisation Using Single/Multiple Decoder(s) -- 10.3 Soft-in/Soft-out Equaliser for Turbo Equalisation -- 10.4 Soft-in/Soft-out Decoder for Turbo Equalisation -- 10.5 Turbo Equalisation Example -- 10.6 Summary of Turbo Equalisation -- 10.7 Performance of Coded GMSK Systems Using Turbo Equalisation -- 10.8 Discussion of Results -- 10.9 Summary and Conclusions -- 11 Comparative Study of Turbo Equalisers -- 11.1 Motivation -- 11.2 SystemOverview -- 11.3 Simulation Parameters -- 11.4 Results and Discussion -- 11.5 Non-iterative Joint Channel Equalisation and Decoding -- 11.6 Summary and Conclusions -- 12 Reduced-complexity Turbo Equaliser -- 12.1 Motivation -- 12.2 Complexity of the Multilevel Full-response Turbo Equaliser -- 12.3 System Model -- 12.4 In-phase/Quadrature-phase Equaliser Principle -- 12.5 Overview of the Reduced-complexity Turbo Equaliser -- 12.6 Complexity of the In-phase/Quadrature-phase Turbo Equaliser -- 12.7 System Parameters -- 12.8 System Performance -- 12.9 Summary and Conclusions -- 13 Turbo Equalisation for Space-time Trellis-coded Systems -- 13.1 Introduction -- 13.2 System Overview -- 13.3 Principle of In-phase/Quadrature-phase Turbo Equalisation -- 13.4 Complexity Analysis -- 13.5 Results and Discussion -- 13.6 Summary and Conclusions -- Part IV Coded and Space-time-Coded Adaptive Modulation: TCM, TTCM, BICM, BICM-ID and MLC -- 14 Coded Modulation Theory and Performance -- 14.1 Introduction -- 14.2 Trellis-coded Modulation -- 14.3 The Symbol-based MAP Algorithm. | |
| 505 | 8 | _a14.4 Turbo Trellis-coded Modulation -- 14.5 Bit-interleaved Coded Modulation -- 14.6 Bit-interleaved Coded Modulation Using Iterative Decoding -- 14.7 Coded Modulation Performance -- 14.8 Near-capacity Turbo Trellis-coded Modulation Design Based on EXIT Charts and Union Bounds -- 14.9 Summary and Conclusions -- 15 Multilevel Coding Theory -- 15.1 Introduction -- 15.2 Multilevel Coding -- 15.3 Bit-interleaved Coded Modulation -- 15.4 Bit-interleaved Coded Modulation Using Iterative Decoding -- 15.5 Conclusion -- 16 MLC Design Using EXIT Analysis -- 16.1 Introduction -- 16.2 Comparative Study of Coded Modulation Schemes -- 16.3 EXIT-chart Analysis -- 16.4 Precoder-aided MLC -- 16.5 Chapter Conclusions -- 17 Sphere Packing-aided Space-time MLC/BICMDesign -- 17.1 Introduction -- 17.2 Space-time Block Code -- 17.3 Orthogonal G2 Design Using Sphere Packing -- 17.4 Iterative Demapping for Sphere Packing -- 17.5 STBC-SP-MLC -- 17.6 STBC-SP-BICM -- 17.7 Chapter Conclusions -- 18 MLC/BICMSchemes for theWireless Internet -- 18.1 Introduction -- 18.2 Multilevel Generalised Low-density Parity-check Codes -- 18.3 An Iterative Stopping Criterion for MLC-GLDPCs -- 18.4 Coding for theWireless Internet -- 18.5 LT-BICM-ID Using LLR Packet Reliability Estimation -- 18.6 Chapter Conclusions -- 19 Near-capacity Irregular BICM-ID Design -- 19.1 Introduction -- 19.2 Irregular Bit-interleaved Coded Modulation Schemes -- 19.3 EXIT-chart Analysis -- 19.4 Irregular Components -- 19.5 Simulation Results -- 19.6 Chapter Conclusions -- 20 Summary and Conclusions -- 20.1 Summary of the Book -- 20.2 Future Work -- 20.3 Concluding Remarks -- Bibliography -- Subject Index -- Author Index. | |
| 506 | 1 | _aRestricted to subscribers or individual electronic text purchasers. | |
| 520 | _aCovering the full range of channel codes from the most conventional through to the most advanced, the second edition of Turbo Coding, Turbo Equalisation and Space-Time Coding is a self-contained reference on channel coding for wireless channels. The book commences with a historical perspective on the topic, which leads to two basic component codes, convolutional and block codes. It then moves on to turbo codes which exploit iterative decoding by using algorithms, such as the Maximum-A-Posteriori (MAP), Log-MAP and Soft Output Viterbi Algorithm (SOVA), comparing their performance. It also compares Trellis Coded Modulation (TCM), Turbo Trellis Coded Modulation (TTCM), Bit-Interleaved Coded Modulation (BICM) and Iterative BICM (BICM-ID) under various channel conditions.The horizon of the content is then extended to incorporate topics which have found their way into diverse standard systems. These include space-time block and trellis codes, as well as other Multiple-Input Multiple-Output (MIMO) schemes and near-instantaneously Adaptive Quadrature Amplitude Modulation (AQAM). The book also elaborates on turbo equalisation by providing a detailed portrayal of recent advances in partial response modulation schemes using diverse channel codes.A radically new aspect for this second edition is the discussion of multi-level coding and sphere-packing schemes, Extrinsic Information Transfer (EXIT) charts, as well as an introduction to the family of Generalized Low Density Parity Check codes.. This new edition includes recent advances in near-capacity turbo-transceivers as well as new sections on multi-level coding schemes and of Generalized Low Density Parity Check codes. Comparatively studies diverse channel coded and turbo detected systems to give all-inclusive information for researchers, engineers and students. Details EXIT-chart based irregular transceiver designs. Uses rich performance comparisons as well as diverse near-capacity design examples. | ||
| 530 | _aAlso available in print. | ||
| 538 | _aMode of access: World Wide Web | ||
| 588 | _aDescription based on PDF viewed 12/21/2015. | ||
| 650 | 0 |
_aSignal processing _xMathematics. |
|
| 650 | 0 | _aCoding theory. | |
| 650 | 0 | _aIterative methods (Mathematics) | |
| 655 | 0 | _aElectronic books. | |
| 695 | _aArray signal processing | ||
| 695 | _aBCH code | ||
| 695 | _aBER | ||
| 695 | _aBICMID design | ||
| 695 | _aBPSK modulation | ||
| 695 | _aBibliographies | ||
| 695 | _aBinary phase shift keying | ||
| 695 | _aBoseChaudhuriHocquenghem code | ||
| 695 | _aCPM theory | ||
| 695 | _aChannel coding | ||
| 695 | _aComplexity theory | ||
| 695 | _aConstellation diagram | ||
| 695 | _aConvolution | ||
| 695 | _aConvolutional codes | ||
| 695 | _aDecoding | ||
| 695 | _aEXIT | ||
| 695 | _aEncoding | ||
| 695 | _aEuclidean distance | ||
| 695 | _aFading | ||
| 695 | _aGMSK system | ||
| 695 | _aGSM | ||
| 695 | _aGaussian channel | ||
| 695 | _aGaussian channels | ||
| 695 | _aGenerators | ||
| 695 | _aHelium | ||
| 695 | _aIndexes | ||
| 695 | _aIterative decoding | ||
| 695 | _aJacobian matrices | ||
| 695 | _aMLC | ||
| 695 | _aMLC/BICM design | ||
| 695 | _aMSP | ||
| 695 | _aMary quadrature amplitude modulation | ||
| 695 | _aMaximum likelihood decoding | ||
| 695 | _aModulation | ||
| 695 | _aMutual information | ||
| 695 | _aOFDM | ||
| 695 | _aPhase change materials | ||
| 695 | _aPhase shift keying | ||
| 695 | _aPolynomials | ||
| 695 | _aReceiving antennas | ||
| 695 | _aSISO algorithms | ||
| 695 | _aSISO equaliser | ||
| 695 | _aSTBC | ||
| 695 | _aSTT codes | ||
| 695 | _aSTTC | ||
| 695 | _aSections | ||
| 695 | _aTEQIQ | ||
| 695 | _aTelecommunication standards | ||
| 695 | _aTrademarks | ||
| 695 | _aTransmitting antennas | ||
| 695 | _aTurbo codes | ||
| 695 | _aViterbi algorithm | ||
| 695 | _aWireless communication | ||
| 695 | _aadaptive quadrature amplitude modulation | ||
| 695 | _abit error rate (BER) | ||
| 695 | _acapacity of wireless channels | ||
| 695 | _achase algorithm | ||
| 695 | _aconvolution coding | ||
| 695 | _aconvolutional codes (CCs) | ||
| 695 | _adigital frequency modulation | ||
| 695 | _aeffective throughput | ||
| 695 | _aextrinsic | ||
| 695 | _aforword error correction (FEC) | ||
| 695 | _aintersymbol interface | ||
| 695 | _aquadrature amplitude modulation | ||
| 695 | _arecursive systematic convolutional (RSC) | ||
| 695 | _asoftoutput viterbi algorithm (SOVA) | ||
| 695 | _aspacetime block codes (STBC) | ||
| 695 | _athirdgeneration (3G) | ||
| 695 | _atrellis diagrams | ||
| 695 | _aturbo convolutional codes | ||
| 695 | _aturbo decoder | ||
| 695 | _aturbo decoding | ||
| 695 | _aturbo encoder | ||
| 695 | _aturbo equalisers | ||
| 695 | _aviterbi algorithm | ||
| 695 | _aviterbi decoding | ||
| 700 | 1 |
_aHanzo, Lajos, _d1952- |
|
| 710 | 2 |
_aJohn Wiley & Sons, _epublisher. |
|
| 710 | 2 |
_aIEEE Xplore (Online service), _edistributor. |
|
| 776 | 0 | 8 |
_iPrint version: _z9780470972908 |
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=5751607 |
| 999 |
_c42299 _d42299 |
||