⚡ electrical engineering

Index Modulation for Modulation on Conjugate-Reciprocal Zeros (IM-MOCZ)

This paper proposes an Index Modulation scheme for Modulation on Conjugate-Reciprocal Zeros (IM-MOCZ) that enhances spectral efficiency and bit error rate performance in short packet communications by splitting the message into codebook selection and conventional MOCZ transmission, utilizing RFMD and DiZeT detectors with a majority-vote rule for reliable decoding.

Original authors: Aidan Corbett, Ebrahim Bedeer

Published 2026-03-03

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Aidan Corbett, Ebrahim Bedeer

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to send a secret message to a friend across a noisy, crowded room. In the world of wireless communication, this "room" is the airwaves, and the "noise" is interference from other signals.

For a long time, sending short, quick messages (like a text notification or a sensor alert) was inefficient. To make sure the message got through, the sender had to shout, "Hello! Can you hear me?" (sending pilot signals) before actually saying the message. In a short conversation, this "hello" takes up almost as much time as the actual message, wasting valuable space.

The Old Way: MOCZ
To solve this, researchers developed a clever trick called MOCZ (Modulation on Conjugate-Reciprocal Zeros). Instead of shouting "Hello," MOCZ encodes information into the shape of a mathematical wave. It's like sending a specific melody. The receiver doesn't need to know the volume or the background noise; it just listens for the specific notes (zeros) in the melody. If the notes are there, the message is received. This is great for short, fast messages because it skips the "Hello."

The New Idea: IM-MOCZ
The paper you shared introduces a new upgrade called IM-MOCZ (Index Modulation on MOCZ). Think of this as taking that melody and adding a secret layer of information to it without making the song any longer.

Here is how it works, using a simple analogy:

The Analogy: The Secret Menu

Imagine a restaurant (the Transmitter) sending an order to the kitchen (the Receiver).

The Standard Order (Conventional MOCZ):
The chef writes down the order: "Burger, Fries, Soda." This takes up 3 slots on the ticket. The kitchen reads the ticket and cooks exactly that.
The New System (IM-MOCZ):
The chef wants to send more information without making the ticket longer. So, they split the order into two parts:
- Part A (The Secret Code): The first few words of the order aren't just food; they tell the kitchen which menu to use.
- Part B (The Actual Food): The rest of the order is the actual food, but it's written using the rules of the specific menu chosen in Part A.

How it works in the paper:

The "Menu" (Codebook): Imagine the restaurant has 16 different menus (Codebooks). Each menu has slightly different rules for how to write "Burger" or "Fries."
The Split: If you have a 10-bit message (a string of 10 zeros and ones):
- The first 4 bits (e.g., 1010) are used to select one of the 16 menus. This is the "Index Modulation." You aren't sending the bits 1010 as food; you are sending them as a pointer to a specific menu.
- The remaining 6 bits are the actual food, written using the rules of that specific menu.
The Result: You sent 10 bits of information, but you only used the space for 6 bits of food! The other 4 bits were hidden in the choice of the menu itself. This makes the system much more efficient (higher Spectral Efficiency).

The Challenge: The Noisy Room

Now, imagine the kitchen is in a very noisy room. The waiter (Receiver) hears the order, but it's garbled. They see a list of ingredients, but they aren't sure which menu was used.

The Detective Work: The waiter has to guess which of the 16 menus was used. They try to read the order assuming it's Menu #1. Does it make sense? Maybe a little. Then they try Menu #2. Does that fit better?
The Penalty Score: For every menu, the waiter calculates a "Penalty Score."
- If the order looks like a perfect match for Menu #3, the penalty is low (0).
- If the order looks weird for Menu #3, the penalty is high.
The Majority Vote: The waiter doesn't just guess once. They look at every single item on the order (every "sector").
- Item 1 says: "This looks like Menu #3."
- Item 2 says: "This looks like Menu #3."
- Item 3 says: "This looks like Menu #3."
- Even if Item 4 is confused, the "Majority Vote" tells the waiter: "Okay, it's definitely Menu #3."

Once the waiter is sure of the menu, they can decode the rest of the order perfectly.

Why is this a big deal?

Faster and Smarter: By hiding extra bits in the "choice of menu," the system sends more data in the same amount of time. It's like packing a suitcase more efficiently.
Better for Short Messages: This is perfect for the Internet of Things (IoT) and emergency communications (URLLC), where messages are tiny but need to be instant and reliable.
The Trade-off: The paper shows that if you try to hide too many bits in the menu choice (making the "food" part too small), it gets harder to guess the right menu in a noisy room. There is a "sweet spot" where you get the most efficiency without making the message too fragile.

In Summary

The authors took a clever way of sending short messages (MOCZ) and added a "secret handshake" (Index Modulation) to it.

Old Way: Send a message.
New Way: Send a message and tell the receiver which rulebook to use to read it, all in the same amount of time.

The result? You get more information through the same "pipe," making our future wireless networks faster and more efficient for things like self-driving cars and smart sensors.

1. Problem Statement

The paper addresses the challenges of Short Packet Communications (SPC) in emerging wireless applications like Ultra-Reliable Low-Latency Communication (URLLC) and the Internet of Things (IoT).

The Bottleneck: Traditional coherent communication methods require significant overhead for channel estimation (pilot signals). In SPC, where the payload is small, this overhead can rival or exceed the data itself, drastically reducing Spectral Efficiency (SE).
The Context: Modulation on Conjugate-Reciprocal Zeros (MOCZ) is a non-coherent scheme designed to eliminate channel estimation overhead. However, standard MOCZ still has limitations in maximizing SE for short packets.
The Goal: To enhance the Spectral Efficiency of MOCZ without compromising reliability or increasing the number of transmitted polynomial coefficients.

2. Methodology: The IM-MOCZ Scheme

The authors propose IM-MOCZ, a hybrid scheme that integrates Index Modulation (IM) into the MOCZ framework. The core concept is to split an $N$ -bit message into two distinct streams:

A. Message Splitting and Transmission

Implicit Bits ( $N-K$ bits): The first $N-K$ bits are used to select a specific codebook ( $\zeta_i$ ) from a set of $2^{N-K}$ unique, pre-defined codebooks. This information is conveyed implicitly via the choice of the codebook, not by modulating the signal amplitude or phase directly.
Explicit Bits ( $K$ bits): The remaining $K$ bits are transmitted using conventional MOCZ techniques within the selected codebook. These bits map to $K$ complex zeros in the $z$ -domain.
Codebook Construction: The codebooks are generated by applying a uniform phase rotation ( $\theta_i$ ) to a base conventional MOCZ codebook. This ensures that the $2^{N-K}$ codebooks are distinct and uniformly spaced in the complex plane.
Signal Generation: The $K$ bits are mapped to complex zeros, which are then converted into $K+1$ polynomial coefficients using a modified Toeplitz iterator method. The system transmits $N$ bits using only $K+1$ coefficients (where $K \leq N$ ).

B. Receiver Architecture

The receiver employs a Majority Vote strategy to recover the message, utilizing two detection schemes:

Candidate Evaluation: The receiver evaluates the received signal against all $2^{N-K}$ candidate codebooks.
Detection Schemes:
- Root Finding Minimum Distance (RFMD): Calculates the Euclidean distance between received zeros and expected codebook zeros.
- Direct Zero-Testing (DiZeT): Evaluates the polynomial at expected zero locations to determine if a zero exists there.
Penalty Metrics: For each sector (bit position) and each candidate codebook, a penalty metric is computed. Lower penalties indicate a higher confidence that the received signal matches that specific codebook.
Majority Vote Decision:
- For each of the $K$ sectors, the codebook with the lowest penalty is selected as the "voter."
- The codebook receiving the most votes across all $K$ sectors is declared the winner ( $\hat{\zeta}_i$ ).
- The index of the winning codebook recovers the implicit bits ( $N-K$ ).
- The explicit bits ( $K$ ) are recovered by demapping the detected zeros corresponding to the winning codebook.

3. Key Contributions

Novel Integration: First application of Index Modulation to MOCZ, allowing implicit data transmission via codebook selection without increasing the number of transmitted symbols.
Robust Detection Algorithm: Development of a Majority Vote rule that aggregates decisions from multiple sectors to determine the correct codebook, mitigating the risk of single-sector errors.
Dual Detection Support: The framework supports both RFMD and DiZeT detectors, providing flexibility in implementation complexity and performance.
Complexity Analysis: The paper provides a complexity analysis showing that the receiver complexity is $O(2^{N-K}(V + K))$ , which remains suitable for SPC provided the number of implicit bits ( $N-K$ ) is kept small.

4. Simulation Results

The authors simulated the system over a multipath channel with Additive White Gaussian Noise (AWGN), comparing IM-MOCZ against conventional MOCZ ( $N=K$ ).

Spectral Efficiency (SE) Gains:
- For $N=10, L_{ch}=3$ : SE gains of 18.18% ( $K=8$ ), 44.44% ( $K=6$ ), and 85.71% ( $K=4$ ) were achieved compared to conventional MOCZ.
- For $N=20, L_{ch}=6$ : SE gains of 8.33% ( $K=18$ ), 18.18% ( $K=16$ ), and 30% ( $K=14$ ).
Bit Error Rate (BER) Performance:
- Optimal Range: When $K$ $K$ is large relative to $N$ $N$ (e.g., $K=8$ $K = 8$ or $K=6$ $K = 6$ for $N=10$ $N = 10$ ), IM-MOCZ significantly outperforms conventional MOCZ.
  - At $K=6$ , DiZeT detection provided a 2.6 dB gain in $E_b/N_0$ at a BER of $10^{-4}$ .
  - At $K=8$ , DiZeT provided a 1.2 dB gain.
- Degradation at Low $K$ : When $K$ is too small (e.g., $K=4$ for $N=10$ ), the number of candidate codebooks ( $2^{N-K} = 64$ ) becomes large. A single error in codebook selection causes the loss of all $N-K$ implicit bits, leading to BER performance worse than conventional MOCZ.
- Impact of $N$ : As $N$ increases, the spacing between candidate codebooks decreases, making detection harder and slightly degrading performance compared to smaller $N$ scenarios.

5. Significance

This work demonstrates that Index Modulation is a viable and powerful tool for enhancing non-coherent short-packet communications.

Efficiency: It offers a substantial trade-off improvement, allowing systems to transmit more data within the same bandwidth and time constraints (higher SE) or achieve the same data rate with lower energy (lower $E_b/N_0$ ).
Practicality: The scheme is particularly effective for scenarios where $K$ (explicit bits) is high relative to $N$ , balancing the need for spectral efficiency with the reliability required for URLLC and IoT.
Future Direction: The paper highlights the importance of optimizing the ratio of implicit to explicit bits to avoid the "error propagation" effect inherent in index modulation schemes when the codebook space becomes too large.