https://urgentcomm.com/wp-content/themes/ucm_child/assets/images/logo/footer-new-logo.png
  • Home
  • News
  • Multimedia
    • Back
    • Multimedia
    • Video
    • Podcasts
    • Galleries
    • IWCE’s Video Showcase
    • Product Guides
  • Commentary
    • Back
    • Commentary
    • Urgent Matters
    • View From The Top
    • All Things IWCE
    • Legal Matters
  • Resources
    • Back
    • Resources
    • Webinars
    • White Papers
    • Reprints & Reuse
  • IWCE
    • Back
    • IWCE
    • Conference
    • Special Events
    • Exhibitor Listings
    • Premier Partners
    • Floor Plan
    • Exhibiting Information
    • Register for IWCE
  • About Us
    • Back
    • About Us
    • Contact Us
    • Advertise
    • Terms of Service
    • Privacy Statement
    • Cookie Policy
  • Related Sites
    • Back
    • American City & County
    • IWCE
    • Light Reading
    • IOT World Today
    • Mission Critical Technologies
    • TU-Auto
  • In the field
    • Back
    • In the field
    • Broadband Push-to-X
    • Internet of Things
    • Project 25
    • Public-Safety Broadband/FirstNet
    • Virtual/Augmented Reality
    • Land Mobile Radio
    • Long Term Evolution (LTE)
    • Applications
    • Drones/Robots
    • IoT/Smart X
    • Software
    • Subscriber Devices
    • Video
  • Call Center/Command
    • Back
    • Call Center/Command
    • Artificial Intelligence
    • NG911
    • Alerting Systems
    • Analytics
    • Dispatch/Call-taking
    • Incident Command/Situational Awareness
    • Tracking, Monitoring & Control
  • Network Tech
    • Back
    • Network Tech
    • Interoperability
    • LMR 100
    • LMR 200
    • Backhaul
    • Deployables
    • Power
    • Tower & Site
    • Wireless Networks
    • Coverage/Interference
    • Security
    • System Design
    • System Installation
    • System Operation
    • Test & Measurement
  • Operations
    • Back
    • Operations
    • Critical Infrastructure
    • Enterprise
    • Federal Government/Military
    • Public Safety
    • State & Local Government
    • Training
  • Regulations
    • Back
    • Regulations
    • Narrowbanding
    • T-Band
    • Rebanding
    • TV White Spaces
    • None
    • Funding
    • Policy
    • Regional Coordination
    • Standards
  • Organizations
    • Back
    • Organizations
    • AASHTO
    • APCO
    • DHS
    • DMR Association
    • ETA
    • EWA
    • FCC
    • IWCE
    • NASEMSO
    • NATE
    • NXDN Forum
    • NENA
    • NIST/PSCR
    • NPSTC
    • NTIA/FirstNet
    • P25 TIG
    • TETRA + CCA
    • UTC
Urgent Communications
  • NEWSLETTER
  • Home
  • News
  • Multimedia
    • Back
    • Video
    • Podcasts
    • Omdia Crit Comms Circle Podcast
    • Galleries
    • IWCE’s Video Showcase
    • Product Guides
  • Commentary
    • Back
    • All Things IWCE
    • Urgent Matters
    • View From The Top
    • Legal Matters
  • Resources
    • Back
    • Webinars
    • White Papers
    • Reprints & Reuse
    • UC eZines
    • Sponsored content
  • IWCE
    • Back
    • Conference
    • Why Attend
    • Exhibitor Listing
    • Floor Plan
    • Exhibiting Information
    • Join the Event Mailing List
  • About Us
    • Back
    • About Us
    • Contact Us
    • Advertise
    • Cookie Policy
    • Terms of Service
    • Privacy Statement
  • Related Sites
    • Back
    • American City & County
    • IWCE
    • Light Reading
    • IOT World Today
    • TU-Auto
  • newsletter
  • In the field
    • Back
    • Internet of Things
    • Broadband Push-to-X
    • Project 25
    • Public-Safety Broadband/FirstNet
    • Virtual/Augmented Reality
    • Land Mobile Radio
    • Long Term Evolution (LTE)
    • Applications
    • Drones/Robots
    • IoT/Smart X
    • Software
    • Subscriber Devices
    • Video
  • Call Center/Command
    • Back
    • Artificial Intelligence
    • NG911
    • Alerting Systems
    • Analytics
    • Dispatch/Call-taking
    • Incident Command/Situational Awareness
    • Tracking, Monitoring & Control
  • Network Tech
    • Back
    • Cybersecurity
    • Interoperability
    • LMR 100
    • LMR 200
    • Backhaul
    • Deployables
    • Power
    • Tower & Site
    • Wireless Networks
    • Coverage/Interference
    • Security
    • System Design
    • System Installation
    • System Operation
    • Test & Measurement
  • Operations
    • Back
    • Critical Infrastructure
    • Enterprise
    • Federal Government/Military
    • Public Safety
    • State & Local Government
    • Training
  • Regulations
    • Back
    • Narrowbanding
    • T-Band
    • Rebanding
    • TV White Spaces
    • None
    • Funding
    • Policy
    • Regional Coordination
    • Standards
  • Organizations
    • Back
    • AASHTO
    • APCO
    • DHS
    • DMR Association
    • ETA
    • EWA
    • FCC
    • IWCE
    • NASEMSO
    • NATE
    • NXDN Forum
    • NENA
    • NIST/PSCR
    • NPSTC
    • NTIA/FirstNet
    • P25 TIG
    • TETRA + CCA
    • UTC
acc.com

content


What error-control coding can do

What error-control coding can do

Part 2 of 4 In the November 2005 MRT, we defined terms and introduced basic error-control coding concepts. This month we will cover some of the applications
  • Written by Urgent Communications Administrator
  • 1st January 2006

Part 2 of 4

In the November 2005 MRT, we defined terms and introduced basic error-control coding concepts. This month we will cover some of the applications and limitations of codes and the theory behind their operation.

The traditional role for error-control coding was to make a troublesome channel acceptable by lowering the frequency of error events. The error events could be bit errors, message errors or undetected errors. While reducing the occurrence of undetected errors was one of the first uses of error-control coding, today’s error-detection codes are so effective that the occurrence of undetected errors is, for all practical purposes, eliminated. Today, the role of error-control coding as expanded to include many new applications, including:

  • Reduce the cost of communications systems: Transmitter power is expensive, especially on satellite transponders. Coding can reduce the satellite’s power needs because messages received at close to the thermal noise level can still be recovered correctly.

  • Eliminate interference: As the electromagnetic spectrum becomes more crowded with man-made signals, error-control coding will mitigate the effects of unintentional interference.

Despite these new uses of error-control coding, there are limits to what coding can do. On the Gaussian noise channel, for example, Shannon’s capacity formula sets a lower limit on the signal-to-noise ratio that we must achieve to maintain reliable communications. For strictly power-limited (unlimited bandwidth) channels, Shannon’s lower threshold can be expressed by Eb/N0 equals 0.69, or -1.6 decibels (dB) [1]. In other words, we must maintain an Eb/N0 of at least -1.6 dB to ensure reliable communications, no matter how powerful an error-control code we use.

Many channels, like the land mobile radio channel, are bandwidth limited. For bandwidth-limited channels with Gaussian noise, Shannon’s capacity formula can be written as Equation 1 where r is the spectral bit rate in bits/s/Hz [2].

For example, consider a bandwidth-limited channel operating with uncoded quadrature phase shift keying (2 bits/symbol and a maximum spectral bit rate of r=2 bit/s/Hz) and a required bit error rate (BER) of 10-5. Without coding, this communications system requires an Eb/N0 of 9.6 dB [2]. Shannon’s formula says that to maintain reliable communications at an arbitrarily low BER, we must maintain (for r=2 bits/s/Hz) an Eb/N0 of at least 1.5, or 1.8 dB.

Therefore, if we need to lower the required Eb/N0 by more than 7.8 dB, coding can’t do it. We must resort to other measures, such as increasing transmitter power. In practice, the situation is worse because no practical code achieves Shannon’s lower threshold. Until recently, a more realistic coding gain for this example was 3 dB rather than 7.8 dB. The invention of turbo codes in 1993 allows us to nearly achieve Shannon’s coding limit, but at the price of delay [3]. Consequently, turbo codes are good choices for data channels, but they are impractical for two-way voice channels.

A full understanding of the structure and performance of error-control codes requires a foundation in modern algebra and probability theory, which is beyond the scope of this column. Instead, I’ll appeal to your intuition and common sense. Let’s begin by showing how the encoder and decoder work for binary block codes.

The block encoder takes a block of k bits and replaces it with an n-bit codeword (n is bigger than k). For a binary code, there are 2k possible codewords in the codebook. The channel introduces errors and the received word can be any one of 2n n-bit words of which only 2k are valid codewords. The job of the decoder is to find the codeword that is closest to the received n-bit word. How a practical decoder does this is more than we can cover here, but our examples will use a brute force look-up table method. The decoding spheres represented in Figure 1 on page 35 will be used to illustrate the decoding process.

In Figure 1, each valid codeword is represented by a point surrounded by a sphere of radius t, where t is the number of errors that the code can correct [2]. Note that codewords A and B of Figure 1 are separated by a distance dmin, called the minimum distance of the code. The minimum distance of a code is defined as the smallest number of places that any two codewords in the codebook differ. Usually, codes with large minimum distance are preferred because they can detect and correct more errors.

Let’s first consider a decoder that can only detect errors, not correct them.

  • Error detection only: The minimum distance of a code is a measure of its error-detection capability. An error-control code can be used to detect all patterns of u errors in any codeword as long as dmin=u + 1. The code also may detect many error patterns with more than u errors, but it is guaranteed to detect all patterns of u errors or less. We’ll assume that the error-detection decoder comprises a look-up table with all 2k valid codewords stored. When an n-bit word is received by the decoder, it checks the look-up table, and if this word is one of the allowable codewords, it flags the n-bit word as error-free and sends the corresponding information bits to the user.

    We’ll use Figure 1 to illustrate three cases: no errors, a detectable error pattern, and an undetectable error pattern.

  • No errors: Assume the encoder sends codeword C, and the channel introduces no errors. Then codeword C also will be received, the decoder will find it in the look-up table and decoding will be successful.

  • Detectable error pattern: This time we send codeword C, and the channel introduces errors such that the n-bit word Y is received. Because Y is not a valid codeword, the decoder will not find it in the table and will therefore flag the received n-bit word as an errored codeword. The decoder does not necessarily know the number or location of the errors, but that’s OK because we only asked the decoder to detect errors. Because the decoder properly detected an errored codeword, decoding is successful.

  • Undetectable error pattern: We send codeword C for the third time, and this time the channel introduces the unlikely (but certainly possible) error pattern that converts codeword C into codeword D. The decoder can’t know that codeword C was sent and must assume that codeword D was sent instead. Because codeword D is a valid codeword, the decoder declares the received n-bit word error-free and passes the corresponding information bits on to the user. This is an example of decoder failure.

    Naturally, we want the decoder to fail rarely, so we choose codes that have a small probability of undetected error. One of the most popular error-detection codes is the shortened Hamming code, also known as the cyclic redundancy check (CRC).

    Comparing the spheres surrounding codewords A and B in Figure 1, we see that the error-correcting capability of a code is given by dmin=2t +1 (this is the minimum separation that prevents overlapping spheres). In other words, a code with dmin=3 can correct all patterns of 1 error, one with dmin=5 can correct all patterns of 2 errors, and so on. A code can be used to correct t errors and detect v additional errors as long as dmin 2t + v + 1. Now refer to Figure 1 and consider the following error-decoding cases: correct decoding, decoding failure and error detection without correction.

  • Correct decoding: Assume that codeword C is sent, and the n-bit word Y is received. Because Y is inside C‘s sphere, the decoder will correct all errors.

  • Decoding failure: This time we send codeword C, and the channel gives us n-bit word Z. The decoder has no way of knowing that codeword C was sent and must decode to D since Z is in D‘s sphere. This is an example of error-correction decoder failure.

  • Error detection without correction: This case shows one way that an error-correction code can be used to also detect errors. We send codeword C and receive n-bit word X. Since X is not inside any sphere, we won’t try to correct it. We do, however, recognize that it is an errored codeword and report this information to the user.

In the last example, we could try to correct n-bit word X to the nearest valid codeword, even though X was not inside any codeword’s sphere. A decoder that attempts to correct all received n-bit words regardless of whether they are in a decoding sphere is called a complete decoder. On the other hand, a decoder that attempts to correct only n-bit words that lie inside a decoding sphere is called an incomplete, or bounded-distance decoder. Bounded-distance decoders are much more common than complete decoders.

Now let’s apply what we’ve learned to a simple error correction code, known as the repetition code. Consider a (5, 1) repetition code that repeats each bit four times. Figure 2 depicts such an encoder.

The decoder takes 5 bits at a time and counts the number of 1s. If there are three or more, the decoder selects 1 for the decoded bit. Otherwise, the decoder selects 0. The minimum distance of this code is 5, so it can correct all patterns of two errors. To compute the error performance of this code, consider a random error channel with a probability of bit error of p. After decoding, the probability of bit error is simply the probability of three or more bit errors in a 5-bit codeword. This probability is computed for several values of p with results listed in Table 1.

Next month: Error-control coding techniques.


Jay Jacobsmeyer is president of Pericle Communications Co., a consulting engineering firm located in Colorado Springs, Colo. He holds bachelor’s and master’s degrees in Electrical Engineering from Virginia Tech and Cornell University, respectively, and has more than 20 years experience as a radio frequency engineer.

References:

  1. C. E. Shannon, “A Mathematical Theory of Communication,” Bell System Technical Journal, vol. 27, pp. 379-423, 1948.

  2. R. E. Blahut, Theory and practice of error control codes, Reading, Massachusetts: Addison-Wesley Publishing Co., 1983.

  3. C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” IEEE Transactions on Communications, pp. 1261-71, October 1996.

Table 1

Post-Decoding Probability of Bit Error
(5,1) Repetition Code
Input BER Output BER
10-2 9.9 × 10-6
10-3 1.0 × 10-8
10-4 1.0 × 10-11
10-5 1.0 × 10-14
Tags: content Test & Measurement

Most Recent


  • Federal agencies infested by cyberattackers via legit remote-management systems
    It has come to light that hackers cleverly utilized two off-the-shelf remote monitoring and management systems (RMMs) to breach multiple Federal Civilian Executive Branch (FCEB) agency networks in the US last summer. On Jan. 25, the Cybersecurity and Infrastructure Security Agency (CISA), National Security Agency (NSA), and Multi-State Information Sharing and Analysis Center (MS-ISAC) released […]
  • Self-driving cars present terrorism risk, FBI director says
    The rollout of self-driving cars could mean an increased threat of terrorist attacks. That was the alarming warning delivered during a discussion on national security at the World Economic Forum at Davos in Switzerland. While the safety benefits of autonomous vehicles (AVs) have long been touted, the need for caution was highlighted by Federal Bureau […]
  • UK Home Office officially cuts ESN ties with Motorola Solutions, but transition work still needed
    United Kingdom (UK) Home Office and Motorola Solutions officially agreed to terminate their working relationship regarding the Emergency Services Network (ESN), although Motorola Solutions will continue to provide “termination-assistance services” for the project at least through December. Information about the termination agreement was published on the Home Office website on Jan. 13, almost a month […]
  • Ransomware profits decline as victims dig in, refuse to pay
    In another sign that the tide may be finally turning against ransomware actors, ransom payments declined substantially in 2022 as more victims refused to pay their attackers — for a variety of reasons. If the trend continues, analysts expect ransomware actors will start demanding bigger ransoms from larger victims to try and compensate for falling […]

Leave a comment Cancel reply

To leave a comment login with your Urgent Comms account:

Log in with your Urgent Comms account

Or alternatively provide your name, email address below:

Your email address will not be published. Required fields are marked *

Related Content

  • LA-RICS hopes P25 network will be ready in 2023, executive director says
  • L3Harris unveils P25-LTE device that is designed to meet stringent new fire standard
  • New Orleans-area 911 center inks multiyear APEX deal with Carbyne to replace call-handling system
  • Cyber is the new Cold War, and AI is the arms race

Commentary


How 5G is making cities safer, smarter, and more efficient

26th January 2023

3GPP moves Release 18 freeze date to March 2024

18th January 2023

Do smart cities make safer cities?

  • 1
6th January 2023
view all

Events


UC Ezines


IWCE 2019 Wrap Up

13th May 2019
view all

Twitter


UrgentComm

AT&T FirstNet unleashes robotic dogs for emergency services dlvr.it/ShW7p8

27th January 2023
UrgentComm

Federal agencies infested by cyberattackers via legit remote-management systems dlvr.it/ShVhn3

26th January 2023
UrgentComm

How 5G is making cities safer, smarter, and more efficient dlvr.it/ShVS1h

26th January 2023
UrgentComm

MCPTT interworking for critical communications dlvr.it/ShTm3P

26th January 2023
UrgentComm

Self-driving cars present terrorism risk, FBI director says dlvr.it/ShTTHx

26th January 2023
UrgentComm

UK Home Office officially will cut ESN ties with Motorola Solutions in December dlvr.it/ShNjfN

24th January 2023
UrgentComm

Newscan: Police software vendor breach exposes personal data, raid plans dlvr.it/ShN0q2

24th January 2023
UrgentComm

RT @IWCEexpo: We're so excited about our awesome list of speakers! Today we highlight Budge Currier, a 9-1-1 Branch Manager at CAL OES, res…

24th January 2023

Newsletter

Sign up for UrgentComm’s newsletters to receive regular news and information updates about Communications and Technology.

Expert Commentary

Learn from experts about the latest technology in automation, machine-learning, big data and cybersecurity.

Business Media

Find the latest videos and media from the market leaders.

Media Kit and Advertising

Want to reach our digital and print audiences? Learn more here.

DISCOVER MORE FROM INFORMA TECH

  • American City & County
  • IWCE
  • Light Reading
  • IOT World Today
  • Mission Critical Technologies
  • TU-Auto

WORKING WITH US

  • About Us
  • Contact Us
  • Events
  • Careers

FOLLOW Urgent Comms ON SOCIAL

  • Privacy
  • CCPA: “Do Not Sell My Data”
  • Cookie Policy
  • Terms
Copyright © 2023 Informa PLC. Informa PLC is registered in England and Wales with company number 8860726 whose registered and Head office is 5 Howick Place, London, SW1P 1WG.