Resource remapping and regrouping in a wireless communication system
AssigneeSamsung Electronics Co., Ltd.
InventorsJianzhong Zhang, Joonyoung Cho, Zhouyue Pi, Juho Lee, Aris Papasakellariou, Farooq Khan
Life of this patent
Estimating the term…
Abstract
Methods and apparatus for remapping and regrouping transmission resources in a wireless communication system. First, a set of new permutation algorithms based on Galois field operation is proposed. Then the proposed algorithms and the known Pruned Bit Reversal Ordering (PBRO) algorithm are applied to several of various resource mapping schemes, including slot or symbol level Orthogonal Cover (OC)/Cyclic Shift (CS) mapping, cell-specific slot-level and symbol-level CS hopping patterns, and subframe and slot level base sequence hopping patterns.
Claims40
A method for communication in a communication network, the method comprising:
- establishing a mapping scheme between N resource combinations in a first time slot and N resource combinations in a second time slot in dependence upon a certain parameter n, with the mapping scheme established by:
- j=g(i,n),
- where i denotes an index of a resource combination in the first time slot and i=1, 2, . . . , N, j denotes an index of a resource combination in the second time slot and j=1, 2, . . . , N, n denotes an index of a permutation sequence, and g(a,b) is a pseudo-random function;
- selecting a first resource combination from among the N resource combinations in the first time slot;
- selecting a second resource combination from among the N resource combinations in the second time slot in accordance with the mapping scheme;
- and
- transmitting information using the first resource combination in the first time slot during the first time slot and the second resource combination during the second time slot.
A method for communication in a communication network, the method comprising the steps of:
- dividing N resource combinations within each of a plurality of time slots into K subsets, with a k-th subset comprising Nk resource combinations, where k=1, 2, . . . , K;
- establishing a mapping scheme between the resource combinations in the subsets in a first time slot and the resource combinations in the subsets in a second time slot in dependent upon a certain parameter vector {right arrow over (n)}=[n1, n2, . . . , nk], where nk corresponds to a k-th subset, with the mapping scheme being established by:
- ik,d=g(i,{right arrow over (n)})=gk(ik,c,nk), for k=1, 2, . . . ,K
- where i=ik,c, ik,c denotes the index of a resource combination within the N resource combinations in the first time slot, k denotes the index of the subset where the ik,c-th resource combination is located, c denotes the index of the ik,c-th resource combination within the k-th subset, ik,d denotes the index of a resource combination within the N resource combinations in the second time slot, k denotes the index of the subset where the ik,d-th resource combination is located, d denotes the index of the ik,d-th resource combination within the k-th subset, ik,c=(k−1)×Nk+c, ik,d=(k−1)×Nk+d, and g(a,b) is a pseudo-random function;
- selecting a first resource combination from among Nk resource combinations in a k-th subset in the first time slot;
- selecting a second resource combination from among Nk resource combinations in a k-th subset in the second time slot in accordance with the mapping scheme;
- and
- transmitting information using the first resource combination during the first time slot and the second resource combination during the second time slot.
A wireless terminal in a communication system, comprising a mapping unit configured to establish and broadcast a mapping scheme between N resource combinations in a first time slot and N resource combinations in a second time slot in dependence upon a certain parameter n, the mapping scheme established by:
- j=g(i,n),
- where i denotes an index of a resource combination in the first time slot and i=1, 2, . . . , N, j denotes an index of a resource combination in the second time slot and j=1, 2, . . . , N, n denotes an index of a permutation sequence, and g(a,b) is a pseudo-random function.
A wireless terminal in a communication network, comprising a mapping unit, the mapping unit:
- divide N resource combinations within each of a plurality of time slots into K subsets, with a k-th subset comprising Nk resource combinations, where k=1, 2, . . . , K;
- and
- establish and broadcast a mapping scheme between the resource combinations in the subsets in a first time slot and the resource combinations in the subsets in a second time slot in dependent upon a certain parameter vector {right arrow over (n)}=[n1, n2, . . . , nK], where nk corresponds to a k-th subset, with the mapping scheme being established by:
- ik,d=g(i,{right arrow over (n)})=gk(ik,c,nk), for k=1,2, . . . ,K
- where i=ik,c, ik,c denotes an index of a resource combination within the N resource combinations in the first time slot, k denotes an index of the subset where a resource combination is located, c denotes an index of the ik,c-th resource combination within the k-th subset, ik,d denotes an index of a resource combination within the N resource combinations in the second time slot, d denotes an index of the ik,d-th resource combination within the k-th subset, ik,c=(k−1)×Nk+c, ik,d=(k−1)×Nk+d, and g(a,b) is a pseudo-random function.
Dependencies are inferred from the claim text.