Wireless Transmitter Throughput Optimization via Rateless Code Block Size Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional wireless scheduling and control techniques rely on accurate channel state information (CSI), which is costly and not always available, leading to inefficient network throughput and decoding errors when CSI is imperfect or unavailable.
Innovation Solution
A wireless transmitter with a cross-layer controller that uses rateless codes and prioritization to optimize throughput without accurate CSI, adapting to channel conditions by controlling time-average block size and power allocation, and selecting receivers based on available CSI or no CSI at all.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If accurate channel state information (CSI) is used for wireless scheduling and control, then throughput can be optimized, but the cost in terms of bandwidth, time, and power increases significantly
Solution Approach 1:
The patent extracts and removes the requirement for accurate CSI from the wireless communication system. By using rateless codes that can decode successfully with a sufficient number of received bits regardless of channel conditions, the system eliminates the need for complex CSI acquisition, feedback, and adaptation mechanisms, thereby reducing bandwidth, time, and power overhead while maintaining throughput optimization.
Solution Approach 2:
The patent changes the fundamental parameter of error correction from fixed-rate codes with predetermined rates to rateless codes with variable block sizes. This parameter change allows the system to adapt to channel conditions implicitly through block size control rather than explicit CSI feedback, reducing the overhead associated with maintaining accurate CSI.
2Device complexity
If fixed-rate channel codes are used with imperfect CSI, then implementation is simpler, but decoding errors increase and throughput decreases
Solution Approach 1:
The patent introduces dynamics into the coding scheme by using rateless codes with variable block sizes that can adapt to channel conditions. Instead of fixed-rate codes with predetermined parameters, the system dynamically adjusts the number of bits to be decoded based on successful reception, improving decoding accuracy under imperfect CSI while keeping implementation relatively simple through the use of LDPC or polar code structures.
3Productivity
If large block-size rateless codes are used, then throughput performance improves, but decoding complexity and delay increase
Solution Approach 1:
The patent applies partial action by controlling the time-average block size to be finite rather than using truly infinite block sizes. This approach achieves most of the throughput benefits of large block sizes while limiting decoding complexity and delay by enforcing a practical constraint on the average block size, balancing performance gains with implementation feasibility.
4Productivity
If rateless codes with infinite block size are used, then throughput approaches optimal performance, but decoding complexity and delay become unmanageable
Solution Approach 1:
The patent uses partial action by enforcing a finite time-average block size constraint on rateless codes. This allows the system to achieve most of the throughput performance benefits of large block sizes while preventing decoding delay from becoming unmanageable, as the average block size is kept within practical limits despite individual blocks potentially being larger.
Data Source
AI summary
A prioritization is determined amongst a group of receivers for receiving signals transmitted from the wireless transmitter, without use of accurate channel state information. A signal is transmitted to each receiver based on an order that is determined by the prioritization. The transmitted signal can be encoded so that the receiver is able to receive the signal regardless of a channel state as between that receiver and the wireless transmitter.