Counter Space STOP Bit Encoding for Wireless Data Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems face challenges in efficiently encoding and transmitting binary string values over resource grids, particularly in managing resource usage and data transmission frequency across different use cases.
Innovation Solution
The proposed solution involves an apparatus with a processor and memory configured to obtain M binary string values, encode STOP bits over a counter space within a resource grid, and transmit these encoded bits. The counter space is defined by a predetermined size in both the time and frequency domains, with counter values associated with resource elements according to a specific rule.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If binary string values are transmitted using conventional encoding methods, then data can be transmitted, but the number of bits required is large and signal power is high
Solution Approach 1:
The patent segments the binary string data into multiple shorter binary strings, where each binary string is represented by a STOP bit position in a counter space. Instead of transmitting all bits of each binary string, only the position information (counter value) is transmitted, significantly reducing the number of bits required and lowering signal power requirements.
Solution Approach 2:
The patent introduces a new dimension by mapping binary string values to positions in a counter space rather than transmitting the binary bits directly. The counter values represent positions in a resource grid, transforming the transmission from bit-level to position-level encoding, which reduces the quantity of transmitted data and associated signal power.
2Productivity
If conventional data transmission methods are used, then data can be transmitted, but resource usage efficiency is low
Solution Approach 1:
The patent divides the resource grid into a counter space with predetermined size in time and frequency domains, where each resource element corresponds to a counter value. Binary strings are encoded by placing STOP bits at specific counter positions, allowing efficient resource utilization and reducing the quantity of transmitted bits while improving productivity.
Solution Approach 2:
The patent changes the encoding parameter from transmitting actual binary bit sequences to transmitting counter position values that represent binary string values. This parameter change from bit-level to position-level encoding improves resource usage efficiency by reducing the number of transmitted bits.
3Loss of information
If M binary string values are transmitted individually, then all data can be conveyed, but transmission overhead is high
Solution Approach 1:
The patent merges multiple binary string transmissions into a unified counter space encoding scheme. Multiple binary string values are represented by multiple STOP bit positions within the same counter space, allowing all data to be conveyed while reducing transmission overhead through consolidated encoding rather than individual transmissions.
Solution Approach 2:
The counter space encoding mechanism serves multiple functions simultaneously: it encodes multiple binary string values, maintains data completeness through unique counter value mappings, and reduces transmission overhead by using position-based representation. This universal encoding approach handles various data quantities efficiently within a single framework.
Data Source
AI summary
Solutions using a counter space and STOP bits to transmit data are disclosed. The counter space is a portion of a resource grid having a predetermined size in the time domain and in the frequency domain, wherein counter values are associated with respective resource elements of the counter space according to a predetermined rule. By means of the counter space and counter values, it is possible to transmit M binary string values of M binary strings of a predetermined length N by encoding STOP bits over respective resource elements of the counter space, and transmitting the encoded STOP bits. At a receiving side, the encoded STOP bits are decoded to M binary string values to obtain M binary strings of the predetermined length N.