FR3071992B1 - PROCESS FOR DETERMINING AT LEAST ONE SPREAD SEQUENCE ASSOCIATED WITH A USER, DEVICE AND CORRESPONDING COMPUTER PROGRAM. - Google Patents

PROCESS FOR DETERMINING AT LEAST ONE SPREAD SEQUENCE ASSOCIATED WITH A USER, DEVICE AND CORRESPONDING COMPUTER PROGRAM. Download PDF

Info

Publication number
FR3071992B1
FR3071992B1 FR1759053A FR1759053A FR3071992B1 FR 3071992 B1 FR3071992 B1 FR 3071992B1 FR 1759053 A FR1759053 A FR 1759053A FR 1759053 A FR1759053 A FR 1759053A FR 3071992 B1 FR3071992 B1 FR 3071992B1
Authority
FR
France
Prior art keywords
user
resources
determining
block
computer program
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
FR1759053A
Other languages
French (fr)
Other versions
FR3071992A1 (en
Inventor
Vincent Corlay
Bruno Jahan
Hao Lin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Orange SA
Original Assignee
Orange SA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Orange SA filed Critical Orange SA
Priority to FR1759053A priority Critical patent/FR3071992B1/en
Priority to PCT/FR2018/052413 priority patent/WO2019063956A1/en
Publication of FR3071992A1 publication Critical patent/FR3071992A1/en
Application granted granted Critical
Publication of FR3071992B1 publication Critical patent/FR3071992B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0037—Inter-user or inter-terminal allocation
    • H04L5/0041—Frequency-non-contiguous
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0026—Division using four or more dimensions, e.g. beam steering or quasi-co-location [QCL]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signalling, i.e. of overhead other than pilot signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/0064—Rate requirement of the data, e.g. scalable bandwidth, data priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0078—Timing of allocation
    • H04L5/0085—Timing of allocation when channel conditions change

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Computer And Data Communications (AREA)

Abstract

L'invention concerne un procédé de détermination d'au moins une séquence d'étalement associée à un utilisateur, destinée à être utilisée dans un système de transmission mettant en œuvre K utilisateurs et M ressources, selon lequel, un symbole de données associé à l'utilisateur k, k E [1 étant destiné à être étalé sur un bloc de N ressources avec K & gt; N & gt; 1, et M = aN, et un vecteur de superposition de données sur le bloc de N ressources s'exprimant sous la forme y = Sx, avec S une matrice d'étalement dans laquelle les éléments composant chaque colonne forment la séquence d'étalement sk, sur le bloc de N ressources, associée à l'utilisateur k, ledit procédé met en œuvre la détermination (31) des valeurs des éléments non nuls de ladite matrice d'étalement de taille NxK, en minimisant un premier critère de corrélation entre les différents vecteurs de superposition de données.The invention relates to a method for determining at least one spreading sequence associated with a user, intended to be used in a transmission system implementing K users and M resources, according to which, a data symbol associated with the user k, k E [1 being intended to be spread over a block of N resources with K > N > 1, and M = aN, and a vector of superposition of data on the block of N resources expressed in the form y = Sx, with S a spreading matrix in which the elements composing each column form the spreading sequence sk, on the block of N resources, associated with the user k, said method implements the determination (31) of the values of the non-zero elements of said spreading matrix of size NxK, by minimizing a first correlation criterion between the different data overlay vectors.

FR1759053A 2017-09-29 2017-09-29 PROCESS FOR DETERMINING AT LEAST ONE SPREAD SEQUENCE ASSOCIATED WITH A USER, DEVICE AND CORRESPONDING COMPUTER PROGRAM. Active FR3071992B1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
FR1759053A FR3071992B1 (en) 2017-09-29 2017-09-29 PROCESS FOR DETERMINING AT LEAST ONE SPREAD SEQUENCE ASSOCIATED WITH A USER, DEVICE AND CORRESPONDING COMPUTER PROGRAM.
PCT/FR2018/052413 WO2019063956A1 (en) 2017-09-29 2018-10-01 Method for determining at least one spreading sequence associated with a user, corresponding device and computer program

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR1759053A FR3071992B1 (en) 2017-09-29 2017-09-29 PROCESS FOR DETERMINING AT LEAST ONE SPREAD SEQUENCE ASSOCIATED WITH A USER, DEVICE AND CORRESPONDING COMPUTER PROGRAM.
FR1759053 2017-09-29

Publications (2)

Publication Number Publication Date
FR3071992A1 FR3071992A1 (en) 2019-04-05
FR3071992B1 true FR3071992B1 (en) 2021-02-12

Family

ID=61132508

Family Applications (1)

Application Number Title Priority Date Filing Date
FR1759053A Active FR3071992B1 (en) 2017-09-29 2017-09-29 PROCESS FOR DETERMINING AT LEAST ONE SPREAD SEQUENCE ASSOCIATED WITH A USER, DEVICE AND CORRESPONDING COMPUTER PROGRAM.

Country Status (2)

Country Link
FR (1) FR3071992B1 (en)
WO (1) WO2019063956A1 (en)

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017001014A1 (en) * 2015-07-01 2017-01-05 Huawei Technologies Co., Ltd. Apparatus and method for non-orthogonal transmissions

Also Published As

Publication number Publication date
FR3071992A1 (en) 2019-04-05
WO2019063956A1 (en) 2019-04-04

Similar Documents

Publication Publication Date Title
MY202367A (en) Method, apparatus, and system for blockchain consensus
RU2019113322A (en) SHARE PROTECTION FOR SCREEN SHARING EXPERIENCES
WO2017025813A3 (en) Image processing method and apparatus
EP4220537A3 (en) Road profile along a predicted path
EP3534328A4 (en) IMAGE PROCESSING DEVICE, IMAGE PROCESSING METHOD, FACIAL RECOGNITION SYSTEM, PROGRAM, AND RECORDING MEDIUM
FR3023948B1 (en) METHOD FOR AIDING THE MAINTENANCE OF AN AIRCRAFT BY INCREASED REALITY
FR3058292B1 (en) METHOD FOR PROVIDING SERVICE TO A USER
EP3544224A4 (en) COMMUNICATION SYSTEM, VEHICLE, SERVER DEVICE, COMMUNICATION METHOD, AND COMPUTER PROGRAM
FI131257B1 (en) A method and a system for user authentication in an offline device
MA45749A1 (en) Method to allow several numerologies in a network
DE602006010747D1 (en) SYSTEM FOR ANALYSIS OF MOTION
EP3508948A4 (en) COORDINATE INPUT PROCESSING DEVICE, EMOTION ESTIMATING DEVICE, EMOTION ESTIMATING SYSTEM, AND DATABASE CONSTRUCTION DEVICE FOR EMOTION ESTIMATING
FR3019346B1 (en) METHOD FOR COUNTING STEPS PERFORMED BY A USER
EP3451657A4 (en) VIDEOCONFERENCE SYSTEM, APPLICATION SERVER, DEVICE, VIDEO CONFERENCE METHOD, AND NON-TRANSIENT COMPUTER-READABLE MEDIUM STORING VIDEO CONFERENCE PROGRAM
JPWO2021070215A5 (en)
WO2013037828A4 (en) Secure data exchange method, and communication device and system implementing same
FR3071992B1 (en) PROCESS FOR DETERMINING AT LEAST ONE SPREAD SEQUENCE ASSOCIATED WITH A USER, DEVICE AND CORRESPONDING COMPUTER PROGRAM.
EP3314449A4 (en) INITIALIZATION METHOD FOR USE IN I2C SYSTEM AND MASTER DEVICE
EP3023987B1 (en) Method and apparatus for visualizing information of a digital video stream
FR3053817B1 (en) METHOD AND SYSTEM OF RECONSTRUCTION OF A THREE-DIMENSIONAL REPRESENTATION
von Laszewski et al. Toward reputable grids
JP2017537337A5 (en)
FR3074948B1 (en) COLLABORATIVE AND INTERACTIVE IMAGE PROCESSING SYSTEM AND METHOD
EP3482945A4 (en) IMAGE PROCESSING DEVICE AND METHOD, PROGRAM, AND INKJET PRINTING SYSTEM
ATE556523T1 (en) METHOD AND SERVER AND CLIENT DEVICE FOR PROCESSING MEDIA BURST REQUESTS

Legal Events

Date Code Title Description
PLSC Publication of the preliminary search report

Effective date: 20190405

PLFP Fee payment

Year of fee payment: 3

PLFP Fee payment

Year of fee payment: 4

PLFP Fee payment

Year of fee payment: 5

PLFP Fee payment

Year of fee payment: 6

PLFP Fee payment

Year of fee payment: 7

PLFP Fee payment

Year of fee payment: 8