q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
THE JOURNEY THROUGH TIME

Explore Black History

Explore the people, places, events, achievements, struggles and stories that shaped our journey.

✊🏾

Civil Rights

Movements, leaders, victories and the continuing fight for equality.

⚙️

Black Inventors

Innovation, patents, science, technology and world-changing contributions.

🏆

Sports

Pioneers, champions, Negro Leagues, records, activism and excellence.

♟️

People

Meet the people whose lives, choices and achievements shaped the journey.

📍

Places

Black towns, communities, institutions and places where history happened.

📜

Events

Moments that changed communities, movements, institutions and the nation.

Enter a person, place, event, or topic.
MY'STORY

The MOVE Fire

This is a personal recollection on the Move fire on May 13, 1985 Philadelphia police fired thousands of rounds at the MOVE house, city officials approved dropping an explosive device on the roof, the resulting fire was allowed to burn, 11 people—including five children—died, and 61 homes were destroyed. Philadelphia City Council later called it a “brutal attack carried out by the City of Philadelphia on its own citizens” and acknowledged that no individual faced criminal consequences for the bombing. One timeline correction worth preserving for the BHP record: the major previous MOVE-police confrontation was August 8, 1978, about seven years before the bombing, not a year or two earlier. Officer James Ramp was killed, other police and firefighters were wounded, nine MOVE members were later convicted, and television cameras recorded police beating Delbert Africa during his arrest. The 1985 MOVE Commission later specifically criticized city planners for failing to adequately use lessons from that 1978 confrontation. And that actually strengthens the point you’re making: 1985 did not happen without precedent or institutional memory. There had already been a deadly confrontation with MOVE, years of conflict, negotiations and police involvement before Osage Avenue.

MORE →
BLACK FACTS
The Truths They Never Taught You...

Ruler of the Mali Empire in the 14th century

Mansa Musa was the ruler of the Mali Empire in West Africa. Details recorded here should be sourced; unknown information is left blank.

MORE →
BHP gathered finds from its connected research sources. Showing the 4 strongest Black History matches.
← BACK TO RESULTS
Wikipedia

Bit stuffing

In data transmission and telecommunications, bit stuffing (also known—uncommonly—as positive justification) is the insertion of non-information bits into data. Stuffed bits should not be confused with overhead bits.

Bit stuffing refers to adding extra bits that do not contain any actual information into the data stream. These stuffed bits are different from overhead bits. Overhead bits are also non-data bits, but they are required for transmission, such as those used in headers, checksums, and other control information.[1]

Bit stuffing is used for various purposes, such as for bringing bit streams that do not necessarily have the same or rationally related bit rates up to a common rate, or to fill buffers or frames. The location of the stuffing bits is communicated to the receiving end of the data link, where these extra bits are removed to return the bit streams to their original bit rates or form. Bit stuffing may be used to synchronize several channels before multiplexing or to rate-match two single channels to each other.

Another use of bit stuffing is for run length limited coding: to limit the number of consecutive bits of the same value in the data to be transmitted. A bit of the opposite value is inserted after the maximum allowed number of consecutive bits. Since this is a general rule the receiver doesn't need extra information about the location of the stuffing bits in order to do the de-stuffing. This is done to create additional signal transitions to ensure reliable reception or to escape special reserved code words such as frame sync sequences when the data happens to contain them. This technique is particularly useful in situations where data frames are transmitted over unreliable channels, such as wireless networks or noisy copper wires.[2]

Bit stuffing in CAN after five equal bits

Bit stuffing does not ensure that the payload is intact (i.e. not corrupted by transmission errors); it is merely a way of attempting to ensure that the transmission starts and ends at the correct places. Error detection and correction techniques are used to check the frame for corruption after its delivery and, if necessary, the frame will be re-sent.

Zero-bit insertion

[edit]

The NRZI coding scheme transmits a 0 bit as a signal transition, and a 1 bit as no change. In this case, bit stuffing is most easily described as the insertion of a 0 bit after a long run of 1 bits.

It was popularized by IBM's SDLC (later renamed HDLC), and is also used in low- and full-speed USB.

After a long sequence of 1 bits there would be no transitions in the transmitted data, and it would be possible for the transmitter and receiver clocks to lose synchronisation. By inserting a 0 after five (SDLC) or six (USB) consecutive 1 bits the transmitter guarantees a maximum of six (SDLC) or seven (USB) bit times between transitions. The receiver can synchronise its clock against the transitions to ensure proper data recovery.

In SDLC the transmitted bit sequence "01111110" containing six adjacent 1 bits is the flag byte. Bit stuffing ensures that this pattern can never occur in normal data, so it can be used as a marker for the beginning and end of the frame without any possibility of being confused with normal data.[3]

The main disadvantage of bit-stuffing is that the code rate is unpredictable; it depends on the data being transmitted.

Source: from Federal Standard 1037C in support of MIL-STD-188

See also

[edit]

References

[edit]
  1. ^ "Bit Stuffing in Computer Network". GeeksforGeeks. 2018-06-14. Retrieved 2025-11-07.
  2. ^ "Understanding Bit Stuffing Program in C: Implementation and Real-World Applications". www.ccbp.in. Retrieved 2025-11-07.
  3. ^ Kevin R. Fall and W. Richard Stevens, TCP/IP Illustrated Volume 1: The Protocols, Second Edition, Addison-Wesley, 2012, Kindle Edition loc 3505

Source: Wikipedia. Article content is retrieved live through the MediaWiki API.

No preview image
Wikipedia

Bit stuffing

In data transmission and telecommunications, bit stuffing (also known—uncommonly—as positive justification) is the insertion of non-information bits into data. Stuffed bits should not be confused with overhead bits. Bit stuffing refers to adding extra bits that do not contain any actual information into the data stream. These stuffed bits are different from overhead bits. Overhead bits are also non-data bits, but they are required for transmission, such as those used in headers, checksums, and other control information. Bit stuffing is used for various purposes, such as for bringing bit streams that do not necessarily have the same or rationally related bit rates up to a common rate, or to fill buffers or frames. The location of the stuffing bits is communicated to the receiving end of the data link, where these extra bits are removed to return the bit streams to their original bit rates or form. Bit stuffing may be used to synchronize several channels before multiplexing or to rate-match two single channels to each other. Another use of bit stuffing is for run length limited coding: to limit the number of consecutive bits of the same value in the data to be transmitted. A bit of the opposite value is inserted after the maximum allowed number of consecutive bits. Since this is a general rule the receiver doesn't need extra information about the location of the stuffing bits in order to do the de-stuffing. This is done to create additional signal transitions to ensure reliable reception or to escape special reserved code words such as frame sync sequences when the data happens to contain them. This technique is particularly useful in situations where data frames are transmitted over unreliable channels, such as wireless networks or noisy copper wires. Bit stuffing does not ensure that the payload is intact (i.e. not corrupted by transmission errors); it is merely a way of attempting to ensure that the transmission starts and ends at the correct places. Error detection and correction techniques are used to check the frame for corruption after its delivery and, if necessary, the frame will be re-sent.

MORE →
No preview image
Wikipedia

Bit-oriented protocol

A bit-oriented protocol is a communications protocol that sees the transmitted data as an opaque stream of bits with no semantics, or meaning. Control codes are defined in terms of bit sequences instead of characters. Bit oriented protocol can transfer data frames regardless of frame contents. It can also be stated as "bit stuffing". Synchronous framing High-Level Data Link Control may work like this: Each frame begins and ends with a special bit pattern 01111110, called a flag byte. A bit stuffing technique is used to prevent the receiver from detecting the special flag byte in user data e.g. whenever the sender's data link layer encounters 5 consecutive 1 (one) in the data, it automatically stuffs 0 into the outgoing stream.

MORE →
Wikipedia

LocalTalk

LocalTalk is a particular implementation of the physical layer of the AppleTalk networking system from Apple Computer. LocalTalk specifies a system of shielded twisted pair cabling, plugged into self-terminating transceivers, running at a rate of 230.4 kbit/s. CSMA/CA was implemented as a random multiple access method. Networking was envisioned in the Macintosh during planning, so the Mac was given expensive RS-422 capable serial ports, first on a nine-pin D-connector, then on a mini-DIN-8 connector. The ports were driven by the Zilog SCC, which could serve as either a standard UART or handle the much more complicated HDLC protocol, which was a packet oriented protocol that incorporated addressing, bit-stuffing, and packet checksumming in hardware. Coupled together with the RS422 electrical connections, this provided a reasonably-high-speed data connection. The 230.4 kbit/s bit rate is the highest in the series of standard serial bit rates (110, 150, 300, 600, 1200, 2400, 4800, 9600, 14400, 19200, 28800, 38400, 57600, 115200, 230400) derived from the 3.6864 MHz clock after the customary divide-by-16. This clock frequency, 3.6864 MHz, was chosen (in part) to support the common asynchronous baud rates up to 38.4 kbit/s using the SCC's internal baud-rate generator. When the SCC's internal PLL was used to lock to the clock embedded in the LocalTalk serial data stream (using its FM0 encoding method) a divide-by-16 setting on the PLL yielded the fastest rate available, namely 230.4 kbit/s. Originally released as "AppleTalk Personal Network", LocalTalk used shielded twisted-pair cable with three-pin mini-DIN connectors. Cables were daisy-chained from transceiver to transceiver. Each transceiver had two three-pin mini-DIN ports, and a "pigtail" cable to connect to the Mac's DE-9 serial connector. Later, when the Mac Plus introduced the eight-pin mini-DIN serial connector, transceivers were updated as well. A variation of LocalTalk called PhoneNET was introduced by Farallon Computing. It used standard unshielded side-by-side telephone wire, with six-position modular connectors (same as the popular RJ11 telephone connectors) connected to a PhoneNET transceiver, instead of the expensive, shielded, twisted-pair cable. In addition to being lower cost, PhoneNET-wired networks were more reliable due to the connections being more difficult to accidentally disconnect. In addition, because it used the "outer" pair of the modular connector, it could travel on many pre-existing phone cables and jacks where just the inner pair was in use for RJ11 telephone service. PhoneNET was also able to use an office's existing phone wire, allowing for entire floors of computers to be easily networked. Farallon introduced a 12-port hub, which made constructing star topology networks of up to 48 devices as easy as adding jacks at the workstations and some jumpers in the phone closet. These factors led to PhoneNET largely supplanting LocalTalk wiring in low-cost networking. The useful life of PhoneNET was extended with the introduction of LocalTalk switching technology by Tribe Computer Works. Introduced in 1990, the Tribe LocalSwitch was a 16-port packet switch designed to speed up overloaded PhoneNET networks. The widespread availability of Ethernet-based networking in the early 1990s led to the swift disappearance of both LocalTalk and PhoneNET. They remained in use for some time in low-cost applications and applications where Ethernet cannot be used. Macintosh Quadra and early models of Power Macintosh supported both 10BASE2 and 10BASE-T via the Apple Attachment Unit Interface (AAUI), and all other Ethernet media via an AAUI–AUI adapter, while still supporting LocalTalk-based networking. For older Macintosh computers that did not have built-in Ethernet, a high-speed SCSI-to-Ethernet adapter was available, and was particularly popular on PowerBooks. This enabled all but the earliest Macintosh models to access a high-speed Ethernet network. With the release of the iMac in 1998 the traditional Mac serial port—and thus, the ability to use both LocalTalk and PhoneNET—disappeared from new models of Macintosh. LocalTalk-to-Ethernet bridges were introduced to allow legacy devices (especially printers) to function on newer networks. For very old Macintosh computers, LocalTalk remains the only option.

MORE →
No preview image
Wikipedia

Channel service unit

In telecommunications, a channel service unit (CSU) is a line bridging device for use with T-carrier, which is used to perform loopback testing; may perform bit stuffing; may also provide a framing and formatting pattern compatible with the network; provides a barrier for electrical interference from either side of the unit; and is the last signal regeneration point, on the loop side, coming from the central office, before the regenerated signal reaches a multiplexer or data terminal equipment (DTE).

MORE →
TOPIC OF THE DAY

Greenwood / Black Wall Street

Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.

MORE →
TRIVIA QUESTION OF THE DAY

Which heavyweight champion was known as the “Brown Bomber”?

Joe Louis.