Memory-Based CSK Code Generator for Wireless Spectral Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing binary shift-register based code generators for wireless communications suffer from limitations such as cyclical repeating codes, power spectral density sidelobes, and reduced spectral bandwidth efficiency, which constrain data transport rates and increase interference, especially in high-speed wireless networks like 4G and 5G.
Innovation Solution
A memory-based binary code shift key (CSK) generator that pre-saves non-repeating, orthogonal CSK codes, allowing for the extraction of 16 unique symbol codes per CSK code, eliminating sidelobes and enabling efficient 4-bit data transport with selectable bandwidths, using a single 10 MHz chipping rate and quadrature phase shift keying for improved spectral efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If shift-register based code generators are used, then code generation is continuous and real-time, but the codes become cyclical and repeating which causes power spectral density sidelobes and reduced spectral bandwidth efficiency
Solution Approach 1:
The code generation function is segmented into two independent parts: a memory storage unit that pre-stores non-repeating orthogonal CSK codes, and a code extraction unit that retrieves codes as needed. This segmentation eliminates the cyclical nature of shift-register generation while maintaining continuous code supply for high-speed data transport.
Solution Approach 2:
Codes are pre-generated and stored in memory before transmission. The memory unit pre-saves epochs of non-repeating orthogonal CSK codes, eliminating the need for real-time generation and preventing the cyclical repetition that causes spectral sidelobes. This preliminary action allows deterministic code retrieval synchronized with data transport.
2Device complexity
If shift-register based code generators are used, then code generation is simple and continuous, but spectral bandwidth efficiency is reduced due to cyclical code repetition
Solution Approach 1:
Instead of generating codes continuously through a shift-register mechanism, the system creates copies of pre-generated non-repeating orthogonal CSK codes and stores them in memory. The code extraction unit retrieves these copies as needed, maintaining spectral efficiency while enabling continuous code supply for high-rate data transport.
3Object-generated harmful factors
If non-repeating orthogonal CSK codes are pre-saved to memory, then spectral efficiency is improved and sidelobes are eliminated, but code extraction and synchronization complexity increases
Solution Approach 1:
The code extraction unit is designed with multi-functionality to handle multiple tasks: retrieving codes from memory, extracting individual codes from code sets, determining code indices from transport data, and maintaining synchronization with the transmission system. This universal design manages extraction complexity while enabling deterministic code retrieval for high-speed data transport.
4Productivity
If 16 orthogonal symbol codes are extracted per CSK code for 4-bit data transport, then data transport rate increases, but code detection and extraction precision requirements increase
Solution Approach 1:
The system employs feedback mechanisms in the code detection process to maintain high precision despite extracting multiple symbol codes per CSK code. The feedback ensures accurate identification of code indices from transport data and verifies correct code extraction, enabling reliable 4-bit data transport per CSK code while maintaining detection accuracy.
Data Source
AI summary
Presented is a generator of binary code shift key (CSK) codes pre-saved to memory usable for time synchronous CSK code retrievals with extraction capability for 1 of 16 orthogonal CSK symbol codes under control of a supported communications system. The CSK code generator pre-defines a 1332 root prime number sequence containing 6 unique prime numbers including 221-7s, 222-11s, 221-13s, 223-17s, 222-19s, and 223-23s that receive multiple index shuffles of 1332 indexes. Pairs of 1332 shuffled indexes of prime sequences are then merged and formatted into 100 tier0 100 hex character format codes. Two levels of XORs of hex character format code pairs generate CSK codes that are collected into 10000 code files that are saved to memory. Time-synchronous CSK code retrieval is followed by 1 of 16 CSK orthogonal symbol codes extraction based on new half-byte data values under flow control of the supported communications system.