Theo G. Swart

Power line communications : theory and applications for narrowband and broadband communications over power lines

List of Contributors. Preface. List of Acronyms. 1 Introduction (The Editors). References. 2 Channel Characterization (P. Amirshahi, F. Canete, K. Dostert, S. Galli, M. Katayama and M. Kavehrad). 2.1 Introduction. 2.2 Channel Modeling Fundamentals. 2.3 Models for Outdoor Channels: LV Case. 2.4 Models for Outdoor Channels: MV Case. 2.5 Models for Indoor Channels. 2.6 Noise and Disturbances. 2.7 MeasuringTechniques. 2.8 PLC Channel EmulationTools. 2.9 Reference Channels for Access Domain. 3 Electromagnetic Compatibility (H. Hirsch and M. Koch). 3.1 Introduction. 3.2 Parameters for EMC Considerations. 3.3 Electromagnetic Emission. 3.4 Electromagnetic Susceptibility. 3.5 EMC Coordination. 3.6 EMC Regulationin Europe. 3.7 Final Remarks. 4 Coupling (P. A. Janse van Rensburg). 4.1 Introduction. 4.2 Filtering Basics. 4.3 Transformer-Capacitor Coupler Design. 4.4 Impedance Adaptation Concepts. 4.5 Experimental Verification. 4.6 Further Possibilities. 5 Digital Transmission Techniques (M. Ardakani, G. Colavolpe, K. Dostert, H. C. Ferreira, D. Fertonani, T. G. Swart, A. M. Tonello, D. Umehara and A. J. H. Vinck). 5.1 Introduction. 5.2 Modulation and Coding for Narrowband PLC Systems. 5.3 Modulation and Coding for Broadband PLC Systems. 5.4 Conclusion. 6 Protocols for PLC Systems (G. Bumiller, H. Hrasnica, L. Lampe, M. Lobashov and T. Stockhammer). 6.1 Introduction. 6.2 Broadband PLC Media Access Control Layer. 6.3 Protocols for PLC Supporting Energy Management Systems. 6.4 Internet Protocol Television Over PLC. 7 Industrial and International Standards on PLC-based Networking Technologies (Galli, M. Koch, H. A. Latchman, S. Lee and V. Oksman). 7.1 Introduction. 7.2 PLC Standardization by Industrial Alliances. 7.3 International Standards on PLC-Networking Technology. 7.4 ETSI and CENELEC Standards. 7.5 International EMC Product Standardization. 8 Systems and Implementations (I. Berganza Valmala, G. Bumiller, H. A. Latchman, M. V. Ribeiro, A. Sendin Escalona, E. R. Wade and L. W. Yonge). 8.1 Introduction. 8.2 PLC Smart Grid Systems. 8.3 PLC Broadband Access Systems. 8.4 Multimedia PLC Systems. 8.5 DC-PLC Systems. 8.6 PLC in Emerging Countries. 9 Conclusions (The Editors). Index.

Permutation trellis codes

We introduce the new concept of permutation trellis codes and present a generalized construction procedure, applying our technique of distance-preserving mappings. Minimum-distance decoding follows naturally, using the Viterbi algorithm. We furthermore investigate the performance of these codes when combined with multitone frequency-shift keying modulation and noncoherent detection in a diversity scheme, to make transmissions robust against narrowband, broadband, and background noise disturbances, such as those encountered in power-line communications.

Power Line Communications: Principles, Standards and Applications from Multimedia to Smart Grid

This second edition of Power Line Communications will show some adjustments in content including new material on PLC for home and industry, PLC for multimedia, PLC for smart grid and PLC for vehicles. Additional chapters include coverage of Channel Characterization, Electromagnetic Compatibility, Coupling, and Digital Transmission Techniques. This book will provide the reader with a wide coverage of the major developments within the field. With contributions from some of the most active researchers on PLC, the book brings together a wealth of international experts on specific PLC topics.

A note on double insertion/deletion correcting codes

By using a run-length representation of sequences, ways to determine suband supersequences are discussed. This is then used in determining the number of sub- and supersequences of a sequence after double insertions or deletions. It is also used in creating subsequence/supersequence books that are searched to find new double insertion/deletion correcting code books with higher cardinalities than those already known.

A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings

A new general upper bound is derived on the sum of the Hamming distances between sequences when mapping from one set of sequences to another. It is shown that a similar upper bound for mappings from binary sequences to permutation sequences is a special case of this upper bound and this is used to evaluate known mappings. Also, new distance-preserving mappings (DPMs) from binary sequences to permutation sequences are presented, based on a multilevel construction. In addition to explicit distance-conserving mappings, distance-increasing, and distance-reducing mappings are also presented. Several of the new DPMs attain the upper bound

Simulation results for permutation Trellis codes using M-ary FSK

It has previously been shown that using the combination of permutation codes and M-ary frequency shift keying has special properties and error correcting capabilities that are suitable for the noise types encountered in power line communications. Furthermore, the permutation codes are used to map onto the outputs of a binary convolutional code to form permutation trellis codes. We investigate and compare the performance of different permutation trellis codes when used with M-FSK for power line communications.

Correction of insertions/deletions using standard convolutional codes and the Viterbi decoding algorithm

We present a new insertion/deletion detection and correcting decoding scheme for convolutional codes that is based on the Viterbi decoding algorithm. Firstly, we show that, when using a coding scheme that utilises a standard rate, R=k/n, convolutional code and n Viterbi decoders in parallel, it is possible to correct up to n-1 consecutive deletions or insertions. Our results show the effectiveness of this scheme to re-establish bit-synchronisation after the deletion of bits. Further, we investigate the correction of multiple deletions or insertions using standard concatenated coding schemes employing convolutional inner codes, and Reed-Solomon outer codes.

Efficient balancing of q-ary sequences with parallel decoding

Balancing of q-ary sequences, using a generalization of Knuths efficient parallel balancing scheme, is considered. It is shown that the new general scheme is as simple as the original binary scheme, which lends itself to parallel decoding of the balanced sequences.

Decoding distance-preserving permutation codes for power-line communications

A new decoding method is presented for permutation codes obtained from distance-preserving mapping algorithms, used in conjunction with M-ary FSK for use on power- line channels. The new approach makes it possible for the permutation code to be used as an inner code with any other error correction code used as an outer code. The memory and number of computations necessary for this method is lower than when using a minimum distance decoding method.

On the distance optimality of permutation mappings

We investigate the optimal Hamming distance that is achievable when mapping binary sequences to permutation sequences. This is used to determine how close to optimum some of the known mappings are. Furthermore, using simulation results we show that mappings found by exhaustive search using optimum distance as criterion perform better than previous known mappings