Cyclic Shift Uplink Control Mapping for Small UCI Payloads
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication technologies face challenges in efficiently supporting small to medium payload sizes for uplink control information (UCI) transmissions, particularly in 4G and 5G systems, due to suboptimal coding schemes that affect coverage enhancement and latency.
Innovation Solution
Implementing cyclic shift based mapping schemes for uplink control transmissions using base sequences and cyclic shifts, which are optimized for small to medium payload sizes, ensuring efficient representation and transmission of UCI through PUCCH formats.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If block codes are used for uplink control transmissions with small to medium payload sizes, then the system can maintain simplicity in encoding, but performance deteriorates at low code rates leading to suboptimal coverage enhancement
Solution Approach 1:
The patent changes the fundamental parameter of the encoding approach by transitioning from block codes to cyclic shift-based spreading sequences. This parameter change enables better performance at low code rates by utilizing the time-domain structure of the uplink control channel, where different cyclic shifts of a base sequence represent different payload values, thereby improving coverage enhancement without excessive complexity
Solution Approach 2:
The patent introduces dynamic cyclic shift allocation where the cyclic shift value varies across different time-frequency resources and payload sizes. This dynamic adaptation allows the system to optimize performance for each specific transmission scenario, improving reliability while maintaining manageable complexity through structured resource mapping
2Productivity
If cyclic shift-based mapping schemes are implemented for uplink control transmissions, then spectral efficiency is improved, but the system complexity increases due to the need to manage and coordinate cyclic shifts across multiple symbols
Solution Approach 1:
The patent segments the uplink control transmission into multiple symbols, with each symbol carrying a portion of the payload through cyclic shift encoding. This segmentation allows efficient utilization of available resources and improves spectral efficiency by distributing information across multiple time slots while maintaining manageable complexity through structured segmentation
Solution Approach 2:
The patent creates a universal cyclic shift mapping scheme that can handle various payload sizes and transmission scenarios using the same fundamental approach. The base sequence and cyclic shift mechanism serve multiple functions including encoding, modulation, and resource identification, thereby improving spectral efficiency while avoiding the need for multiple specialized encoding schemes
3Reliability
If consistent non-identical cyclic shifts are ensured across symbols, then coverage and reliability are improved, but the flexibility in resource allocation is reduced
Solution Approach 1:
The patent implements dynamic cyclic shift selection where the specific cyclic shift values are adaptively chosen based on channel conditions, payload size, and resource availability. This dynamic approach ensures consistent non-identical cyclic shifts across symbols for reliability while maintaining flexibility through condition-based adaptation, resolving the contradiction between reliability and adaptability
Data Source
AI summary
Methods, systems, and devices for mapping schemes for cyclic shift based uplink control transmissions in mobile communication technology are described. An exemplary method for wireless communication includes transmitting, by a wireless device over a control channel, an M-bit payload using N symbols, wherein M and N are positive integers, wherein each of the N symbols is represented using a base sequence (u(n, m)) and a cyclic shift (ncs(n, m)) of the base sequence, wherein n=0, 1, . . . (N−1) indexes a symbol in the N symbols, wherein m=0, 1, . . . (2M−1) indexes a combination set, wherein m and n are non-negative integers, wherein the cyclic shift for a j-th symbol is based on a cyclic shift for a (j−1)-th symbol, and wherein j=1, 2, . . . (N−1) is a positive integer.