Uplink Acknowledgement Mapping via Downlink Virtual Resource Blocks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems face significant overhead in uplink acknowledgement (ACK) transmissions due to implicit mapping of ACKs to time/frequency/code resources, which is inefficient, especially for persistent and dynamic scheduling scenarios, leading to increased overhead and incompatibility with control-less operations and VoIP packets.
Innovation Solution
The solution involves mapping downlink (DL) resource allocations to uplink (UL) acknowledgement locations using a cyclically shifted sequence, allowing for implicit and explicit mapping of UL ACK Identifiers (IDs) based on DL virtual resource block (VRB) allocations, reducing overhead and adapting to both persistent and dynamic scheduling scenarios.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If implicit mapping of ACKs to time/frequency/code resources is used, then uplink acknowledgement transmission is achieved, but overhead increases significantly
Solution Approach 1:
The patent merges multiple ACK resources (time, frequency, code dimensions) into a unified resource block structure. By combining these dimensions and applying cyclic shifting, the system reduces the total number of separate ACK resources needed while maintaining reliable acknowledgement transmission across multiple users and channels.
Solution Approach 2:
The patent changes the parameters of ACK resource allocation by introducing cyclic shifting in time, frequency, and code domains. This transforms the static resource allocation into a dynamic parameter-based system where the same physical resources can serve multiple ACK transmissions with different parameter sets, thereby reducing overhead.
2Quantity of substance
If one cyclic shift and resource block combination is mapped per PDCCH, then UL overhead is reduced, but adaptability to control-less operation and persistent assignments is lost
Solution Approach 1:
The patent introduces dynamic cyclic shifting parameters that can be adjusted based on the scheduling type (dynamic or persistent) and control mode (PDCCH-based or control-less). This dynamic parameter adjustment allows the same resource block structure to adapt to different operational modes, maintaining both low overhead and high flexibility.
Solution Approach 2:
The patent creates a universal resource block mapping mechanism that serves multiple functions: it works for both dynamic and persistent scheduling, supports both PDCCH-based and control-less operations, and handles both VoIP and non-VoIP traffic. The cyclic shifting parameters enable this single mechanism to fulfill multiple scheduling requirements.
3Reliability
If multiple ACK instances are reserved per packet, then ACK transmission reliability is improved, but resource overhead increases
Solution Approach 1:
The patent uses cyclic shifting to create multiple virtual copies of ACK resources from a single physical resource block. Instead of allocating separate physical resources for each ACK instance, the system generates multiple usable ACK instances by applying different cyclic shifts to the same underlying resource, thereby maintaining reliability without increasing actual resource overhead.
Data Source
AI summary
An acknowledgment (ACK) mapping automation that reduces overhead for a wireless communication systems such as UTRAN-LTE, Global System for Mobile communications (GSM: originally from Groupe Spécial Mobile), High-Speed Downlink Packet Access (HSDPA), or any packet-switched system, by providing a mapping of uplink (UL) location (i.e., modulation location in time, frequency, and code) based upon a downlink (DL) allocations. Aspects address dynamic and persistent scheduling of user equipment (EU) with a selected combination of implicit and explicit mapping.


