[go: up one dir, main page]

WO2018194365A1 - Procédé et dispositif de transmission d'informations en utilisant le codage épars - Google Patents

Procédé et dispositif de transmission d'informations en utilisant le codage épars Download PDF

Info

Publication number
WO2018194365A1
WO2018194365A1 PCT/KR2018/004490 KR2018004490W WO2018194365A1 WO 2018194365 A1 WO2018194365 A1 WO 2018194365A1 KR 2018004490 W KR2018004490 W KR 2018004490W WO 2018194365 A1 WO2018194365 A1 WO 2018194365A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
sparse
codebook
spreading
channel
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.)
Ceased
Application number
PCT/KR2018/004490
Other languages
English (en)
Korean (ko)
Inventor
지형주
심병효
박선호
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.)
SNU R&DB Foundation
Original Assignee
Seoul National University R&DB Foundation
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
Priority claimed from KR1020180041629A external-priority patent/KR102111975B1/ko
Application filed by Seoul National University R&DB Foundation filed Critical Seoul National University R&DB Foundation
Priority to US16/605,798 priority Critical patent/US11101944B2/en
Publication of WO2018194365A1 publication Critical patent/WO2018194365A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/20—Arrangements for detecting or preventing errors in the information received using signal quality detector

Definitions

  • the present invention relates to information transmission technology, in particular sparse coding and multi-code spreading and to transmit information in ultra-reliable and low latency communication (URLLC).
  • An apparatus and method for using a recovery receiver by compressed sensing is provided.
  • the present invention provides a sparse coding apparatus capable of significantly increasing the transmission success rate of a channel without increasing computational complexity while making a code rate very low for high reliability transmission, an apparatus for spreading transmission using a plurality of codes, and receiving the rare signal It provides an apparatus and method for restoring.
  • a method of operating a transmitting end in a wireless communication system the step of sparse coding the information to have a sparsity (sparsity) of the number of non-zero symbols K, for each user Constructing a codebook including code for spreading, spreading the coded information using one or more codes in the codebook, and transmitting the channel by overlapping the spreaded information.
  • the sparse coding of the information may include: integer mapping that allows one-to-one correspondence of an integer value that can be expressed through location information where sparse K non-zero symbols are located to a size N of a symbol; sparse coding by an integer mapping method.
  • the sparse coding of the information may include a structure in which the number of nonzero symbols of the column and the row of the matrix corresponding to the information is the same through the size N and the sparity K of the symbol. Sparse coding in a structured mapping method.
  • the rare coding of the information may include a table mapping method in which positions of non-zero symbols are preconfigured according to information fields corresponding to the respective information. Sparse coding.
  • the spreading may include spreading the coded information using one or more codes having non-orthogonal characteristics in the codebook. .
  • the method may further include allocating a resource according to the information, and transmitting a data channel through the allocated resource.
  • a method of operating a receiving end in a wireless communication system includes: obtaining a codebook including a code for spreading for each user, receiving a channel including sparse coded information, and Based on the codebook, determining the information from the received channel.
  • the determining of the information may include identifying one or more codes used for spreading the received channel at the transmitting end using the codebook, and based on the one or more codes. And recovering the sparse coded information from the received channel using a compressed sensing technique.
  • the determining of the information may include determining the information by performing a reverse process of sparse coding on the sparse coded information.
  • the method may further include receiving a data channel based on the information.
  • a transmitting apparatus sparsely codes information so that the number of nonzero symbols has a degree of scarcity of K, and configures a codebook including codes for spreading for each user, At least one processor for spreading the coded information using one or more codes in the codebook, and a transceiver for transmitting a channel by overlapping the spread information.
  • the at least one processor may be an integer mapping method in which an integer value that is representable through position information where sparse K nonzero symbols are located with a size N of a symbol is one-to-one corresponded to the information. It can be sparse coded.
  • the at least one processor is configured to have the same number of nonzero symbols in a column and a row of a matrix corresponding to the information through a size N and a sparity K of a symbol. It can be sparse coded with.
  • the at least one processor may sparse code with a table mapping method such that a position of a non-zero symbol is preconfigured according to an information field corresponding to each information.
  • the at least one processor may spread the coded information using one or more codes having non-orthogonal characteristics in the codebook.
  • the at least one processor may allocate resources according to the information, and the transceiver may transmit a data channel through the allocated resources.
  • the complexity of the transmitter and receiver increases, whereas in the present invention, even though the number of encoded symbols increases, the number of symbols that actually have a value is very sparse. In this case, the complexity of the transmitter and the receiver does not increase.
  • the present invention rather than transmitting information to each transmitted symbol, by using the position of the non-zero symbol among the transmitted symbols, the next information is mapped and transmitted to each other at different positions to use the information transmission method of the previous method. Is that. This has the advantage of high reception performance and high reliability transmission.
  • the amount of total control information can be significantly reduced, and the amount of resources required for control channel transmission can be reduced. have.
  • 1 is an example of a data channel configuration of a downlink URLLC system to which the present invention is applied.
  • FIG. 2 is a diagram illustrating a conventional control channel transmission process.
  • FIG. 3 is a diagram illustrating a control channel transmission process according to an embodiment of the present invention.
  • FIG. 4 illustrates a sparse coding method according to an embodiment of the present invention.
  • FIG. 5 is a diagram illustrating a multiple code spreading method according to an embodiment of the present invention.
  • FIG. 6 is a diagram illustrating a control channel and a pilot signal transmission method according to a second embodiment of the present invention.
  • FIG. 7 is a graph for comparing BLER performance of a control channel and a general control channel according to an embodiment of the present invention.
  • 8A is a graph for comparing BLER performance of a control channel and a general control channel according to the amount of control information according to an embodiment of the present invention.
  • 8B is a graph for comparing BLER performance of a control channel and a general control channel according to an embodiment of the present invention with or without interference signals.
  • FIG. 9 is a graph for comparing transmission latency performance of a control channel and a general control channel according to an embodiment of the present invention.
  • FIG. 10 is a flowchart illustrating a transmission process according to an embodiment of the present invention.
  • FIG. 11 is a flowchart illustrating a receiving process according to an embodiment of the present invention.
  • FIG. 12 is a diagram illustrating a transmission apparatus according to an embodiment of the present invention.
  • FIG. 13 is a diagram illustrating a receiver according to an embodiment of the present invention.
  • Combinations of each block of the block diagrams and respective steps of the flowcharts may be performed by computer program instructions (executable engines), which may be executed on a processor of a general purpose computer, special purpose computer, or other programmable data processing equipment.
  • instructions executed through a processor of a computer or other programmable data processing equipment create means for performing the functions described in each block of the block diagram or in each step of the flowchart.
  • These computer program instructions may also be stored in a computer usable or computer readable memory that can be directed to a computer or other programmable data processing equipment to implement functionality in a particular manner, and thus the computer usable or computer readable memory.
  • the instructions stored therein may also produce an article of manufacture containing instruction means for performing the functions described in each block of the block diagram or in each step of the flowchart.
  • Computer program instructions can also be mounted on a computer or other programmable data processing equipment, such that a series of operating steps can be performed on the computer or other programmable data processing equipment to create a computer-implemented process that can be executed by the computer or other programmable data. Instructions for performing data processing equipment may also provide steps for performing the functions described in each block of the block diagram and in each step of the flowchart.
  • each block or step may represent a portion of a module, segment or code that includes one or more executable instructions for executing specific logical functions, and in some alternative embodiments referred to in blocks or steps It should be noted that the functions may occur out of order. For example, the two blocks or steps shown in succession may, in fact, be performed substantially concurrently, or the blocks or steps may be performed in the reverse order of the corresponding function, as required.
  • a transmitting end describes a base station
  • a receiving end describes a terminal as an example.
  • a control channel transmission as an embodiment, but is not necessarily limited thereto, and may be generally applied to a channel configuration having a small size of information to be transmitted. Embodiments of the present invention are provided to more fully describe the present invention to those skilled in the art.
  • 1 is an example of a data channel configuration of a downlink URLLC system to which the present invention is applied.
  • the graph 101 shows a conventional data channel transmission method and the graph 102 shows a data transmission method for URLLC.
  • the pilot 103, the control channel 104, and the data channel 105 are transmitted in the order of time and frequency.
  • the data channel is mapped to two-dimensional resources of time and frequency. Is assigned based on
  • the pilot 106, the control channel 107, and the data channel 108 have a very long structure along the frequency axis, and transmit only a very short time on the time axis. . That is, the channel may be configured to transmit for a short time while using a wide frequency resource.
  • the control channel signal of the data transmission signal includes information for demodulating the data channel.
  • the conventional method for transmitting the control channel is as follows.
  • scheduling information (control information or control information or scheduling information, 203) is transmitted along with a cyclic redundancy check (CRC) 201 for determining whether an error exists.
  • CRC 201 generally uses a user index value 204.
  • the data is scrambled through the scrambler 202 and concatenated 205 together with the scheduling information 203 and sent to the channel encoder 206.
  • the CRC is a binary signal consisting of 16 bits and the user index is also a binary signal consisting of 16 bits
  • scramble means that the two binary signals are exclusive OR (XOR) operations for each bit.
  • the CRC 201 concatenated with the scheduling information 203 is made into a control channel through the channel encoder 206.
  • the channel encoder adjusts the length of a coded signal through a code rate.
  • the length N of the coded signal becomes 3b bit.
  • the basic principle of channel coding is to map any signal represented by b bit to a hyper-space with N degrees of freedom greater than b, with 2 powers of 2 codepoints farthest from each other in the N-dimensional hyper-space. Means how to configure.
  • a symbol having a size of N may be received, and it may be determined which codepoint is closest to the codepoint configured by the received signal. Therefore, as N increases, the distance between the codepoints increases, the detection performance increases and the reliability increases, but the complexity increases because the dimension of the hyper-space for searching increases.
  • the present invention proposes a control channel transmission method using a sparse coding method as a coding method in which the complexity does not increase even when N increases.
  • FIG. 3 is a diagram illustrating a control channel transmission process according to an embodiment of the present invention.
  • the length of a symbol encoded using the sparse coding technique proposed by the scheduling information 301 through the sparse encoder 302 is much longer than the scheduling information (length N), and the non-zero symbol is very small. Suggest how to make.
  • spreading codebook generator 304 is used to construct different spreading codebooks for different users using the user index 305.
  • the spreading codebook has a spreading code of N, and uses sparse coding to selectively select one or more spreading codes from the codebook and send them to the same resource simultaneously. This is done by selective diffuser 303.
  • the spread signal becomes the control channel 306.
  • the fourth method illustrates a sparse coding method according to an embodiment of the present invention.
  • the first method is an integer mapping (integer allocation) method.
  • the scheduling information z may be expressed as an integer, and for example, 00, 01, 10, and 11 may be expressed as 0, 1, 2, and 3.
  • N is 4 and the number of non-zero elements K is 2, five types of 0011, 0110, 1001, 1010, and 1100 are possible, which are expressed as integers 3, 6, 9, 10, and 12. Can be. Therefore, sparse coding can be expressed as a process of mapping integers between z and x.
  • the mapping method of sparse coding may use the same mapping between users, but the present invention also includes using different mappings for security.
  • the second method is a structured mapping method. If the scheduling information z is 00, 01, 10, 11, for example, N is 4 and the number K of non-zero elements is 2
  • integers can be expressed as 3, 6, 9, 12.
  • the difference between the first method and the second method may be that demodulation performance may be improved since the sparse component of the reconstructable signal is unique in the case of the reconstruction of the sparse signal (the number of non-zeros is the same in columns and rows). .
  • the third method is a table mapping method.
  • the table mapping method is a method of mapping a location of a non-zero element of an encoded symbol to a field of z by mapping a field of a scheduling signal.
  • Table 405 of FIG. 4 is a part of scheduling information consisting of an information name and a bit field.
  • the encoding process is performed such that each field configures the position of 1 of the encoded symbol 406 differently. In this way, information is organized.
  • a non-sparse signal is encoded as a sparse signal x having a length of N and a number of non-zero elements among them.
  • K when using QPSK symbol, K is composed of 2, and the value of the non-zero element uses 1 of 2 and j of 1 is used. If both use 1, they can be transmitted through BPSK symbols.
  • K 4 is configured and four non-zero elements are set to 1, j, 2, and 2j regardless of the order.
  • FIG. 5 is a diagram illustrating a multiple code spreading method according to an embodiment of the present invention. If the resource size of the transmitted transmission signal is m, the length of the spreading code is m, so the number of different binary codes that can be made to length m is the power of 2 m.
  • each user uses a code of N, so each 2 m / N users can use a different codebook C.
  • the codes actually used for transmission are K codes, which are configured according to the position of the non-zero element selected in the encoding process.
  • the encoded signal x 505 of FIG. 5 includes zero elements 506 and non-zero elements 507 and 508, which are multiplied by a codebook C 503 configured differently for each user and thus having K out of N codes.
  • the code is selected and the selected code is nested in the resource of m.
  • each code c may have an orthogonal or non-orthogonal characteristic.
  • each code c has a non-orthogonal characteristic but has a very low correlation, and thus may have a very low detectability when different users receive using different codebooks.
  • the spread signal may pass through channel 502 and be received at the receiver in the form of y 501.
  • 6 is a diagram illustrating a control channel and a pilot signal transmission method according to a second embodiment of the present invention.
  • 5 illustrates a method of transmitting a pilot and a control channel to different symbols or resources.
  • 6 illustrates a method in which a pilot and a control channel are configured and transmitted as one. This method is possible in the case where there is a separate pilot and a method in which no pilot exists.
  • the received signal is a multi-code spread signal is received and the receiver does not determine the position of the non-zero element in x as shown in Figure 5 rather than the non-zero elements (604, 605) Both channel and control channel information can be obtained by judging both the position and value.
  • Table 1 is a table describing the operation of the receiver.
  • the receiver can determine the position and value of the non-zero element of x from the signal y received with the reconstructor to recover the sparse signal.
  • the present invention describes a process of determining user information in the sparse signal restoration process.
  • the detected K non-zero elements are regarded as false detection and are ignored. . If a non-zero element is not detected during the detection process, it is determined that it is not a control channel assigned to it and is ignored.
  • FIG. 7 is a graph for comparing BLER performance of a control channel based on control channel sparse encoding (CCSE) and a physical downlink control channel (PDCCH) which is a general control channel according to an embodiment of the present invention.
  • CCSE control channel sparse encoding
  • PDCCH physical downlink control channel
  • the proposed technique provides 4dB performance in additive white Gaussian noise (AWGN) and various real channel environments (extended typical urban model (ETU), extended pedestrian A model (EPA)), compared to the conventional technology. You can see that there are benefits.
  • AWGN additive white Gaussian noise
  • ETU extended typical urban model
  • EPA extended pedestrian A model
  • FIG. 8A is a graph for comparing BLER performance of a control channel and a general control channel according to an amount of control information according to an embodiment of the present invention.
  • the size b of information shows a BLER measurement result when the information is changed from 12 bits to 96 bits.
  • SNR signal to noise ratio
  • FIG. 8B is a graph for comparing BLER performance of a control channel and a general control channel according to an embodiment of the present invention with or without an interference signal.
  • the technique proposed by the present invention is less affected by interference. This is because it uses a spreading code.
  • the existing technology has a great performance deterioration, but the proposed technique has excellent performance because the amount of interference remaining after dispreading is very small.
  • FIG. 9 is a graph for comparing transmission latency performance of a control channel and a general control channel according to an embodiment of the present invention.
  • the technique proposed in the present invention satisfies a transmission error condition of 0.00001, which is a requirement of URLLC, within 0.85 msec.
  • the existing transmission method requires 1.28 msec to satisfy the transmission error condition of 0.00001.
  • the transmission by CCSE proposed in the present invention has a performance gain of reducing the transmission delay.
  • step 1001 of FIG. 10 is a flowchart illustrating a transmission process according to an embodiment of the present invention.
  • the base station generates a spread codebook for each user and delivers it to each terminal.
  • the transferring process may be previously recorded in the storage device for each terminal or may be indicated by signaling or delivering configuration information.
  • step 1003 of FIG. 10 when scheduling information is required to be delivered, a sparse coding process is first performed. Subsequently, multi-code spreading is performed by using the coded symbols as in step 1005 of FIG. 10 and allocated to the resource to be transmitted as in step 1007 of FIG. 10 and a transmission signal is generated. That is, the control channel including the scheduling information is transmitted. The data channel is transmitted as shown in step 1009 of FIG. 10 based on the scheduling information.
  • the terminal configures the spreading codebook by receiving the spreading codebook from the base station or receiving corresponding information as shown in step 1101 of FIG. Thereafter, in step 1103, the spreading codebook is identified from the reception control channel signal by using the spreading codebook.
  • reconstruction of the transmitted rare code may be performed through a compression sensing technique.
  • Compression sensing is a technique for reconstructing a transmitted signal based on a small number of measurements. For example, a compression sensing algorithm such as multipath match pursuit with death first (MMP-DF) may be used.
  • MMP-DF multipath match pursuit with death first
  • step 1105 Using the value or index of the code determined in step 1105, sparse decoding corresponding to the reverse process of sparse coding is performed to confirm scheduling information. Thereafter, as shown in step 1107, the data channel is received and demodulated with reference to the scheduling information.
  • the scheduling information 1201 of FIG. 12 is converted into a sparse signal through the sparse encoder 1202.
  • the spreading codebook is then spread through the spreader 1203 using the spreading codebook.
  • the spreading codebook is generated using the codebook generator 1204 from the user index 1205, which is a unique identifier of the user (terminal).
  • the amount of control channel is then adjusted to the amount of resources transmitted through rate matcher 1206, which is mapped to time / frequency resources via resource allocator 1207.
  • signal processing for multi-antenna transmission is performed through the layer mapper 1208, transmitted to the RF module 1209, and a signal is generated.
  • the transmitting device may include at least one processor, the sparse encoder 1202, the spreader 1203, the codebook generator 1204, the rate matcher 1206, and the resource allocator 1207.
  • the function of may be performed by at least one processor.
  • the transmitting apparatus may include a transceiver, and the functions of the radar mapper 1208 and the RF module 1209 may be performed by the transceiver.
  • the terminal receives a control channel 1301 signal through an RF device. Recognizes the code transmitted through the compressed sensing based receiver 1302 proposed from the received control channel 1301 signal, which is obtained through the codebook generator 1303 from the user index 1304 which is a unique identifier of the user (terminal). This is done using the generated codebook.
  • Compression sensing is a technique for reconstructing a transmitted signal based on a small number of measurements. For example, a compression sensing algorithm such as MMP-DF may be used.
  • the user (terminal) identifier 1307 may be first distinguished from the code reconstructed by the compression sensing based receiver 1302 based on the codebook, and may be recognized as control channel information transmitted to the receiving device.
  • the receiving device may receive a data channel from the transmitting device based on the confirmed scheduling information 1306.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé par lequel une extrémité de transmission fonctionne dans un système de communication sans fil, comprenant les étapes suivantes : réalisation d'un codage épars sur des informations de façon à avoir un état épars dont le nombre de symboles non nuls est K ; configuration d'un livre de codes en incluant un code pour l'étalement pour chaque utilisateur ; étalement des informations codées en utilisant un ou plusieurs codes dans le livre de codes ; et transmission d'un canal par chevauchement des informations étalées. Par conséquent, même si le nombre de symboles codés augmente, le nombre de symboles ayant réellement une valeur est configuré de manière très éparse, de sorte que la complexité d'un émetteur et d'un récepteur n'augmente pas et ainsi les performances de restauration s'améliorent.
PCT/KR2018/004490 2017-04-18 2018-04-18 Procédé et dispositif de transmission d'informations en utilisant le codage épars Ceased WO2018194365A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/605,798 US11101944B2 (en) 2017-04-18 2018-04-18 Method and device for transmitting information by using sparse coding

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR10-2017-0049764 2017-04-18
KR20170049764 2017-04-18
KR1020180041629A KR102111975B1 (ko) 2017-04-18 2018-04-10 희소 코딩을 이용한 정보 전송 방법 및 장치
KR10-2018-0041629 2018-04-10

Publications (1)

Publication Number Publication Date
WO2018194365A1 true WO2018194365A1 (fr) 2018-10-25

Family

ID=63856300

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2018/004490 Ceased WO2018194365A1 (fr) 2017-04-18 2018-04-18 Procédé et dispositif de transmission d'informations en utilisant le codage épars

Country Status (1)

Country Link
WO (1) WO2018194365A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114646934A (zh) * 2021-11-18 2022-06-21 南京理工大学 一种基于稀疏向量编码的多载波雷达通信一体化波形设计方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20150097603A (ko) * 2012-12-14 2015-08-26 후아웨이 테크놀러지 컴퍼니 리미티드 Scma 통신 시스템에서의 오픈-루프 mimo 통신을 위한 시스템 및 방법
US20160049999A1 (en) * 2014-08-15 2016-02-18 Huawei Technologies Co., Ltd. System and Method for Generating Codebooks with Small Projections per Complex Dimension and Utilization Thereof
KR20160052781A (ko) * 2012-11-16 2016-05-12 후아웨이 테크놀러지 컴퍼니 리미티드 희소 코드 다중 액세스를 위한 시스템 및 방법
US20170019222A1 (en) * 2015-07-13 2017-01-19 Yiqun Ge Method of reduced state decoding and decoder thereof

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20160052781A (ko) * 2012-11-16 2016-05-12 후아웨이 테크놀러지 컴퍼니 리미티드 희소 코드 다중 액세스를 위한 시스템 및 방법
KR20150097603A (ko) * 2012-12-14 2015-08-26 후아웨이 테크놀러지 컴퍼니 리미티드 Scma 통신 시스템에서의 오픈-루프 mimo 통신을 위한 시스템 및 방법
US20160049999A1 (en) * 2014-08-15 2016-02-18 Huawei Technologies Co., Ltd. System and Method for Generating Codebooks with Small Projections per Complex Dimension and Utilization Thereof
US20170019222A1 (en) * 2015-07-13 2017-01-19 Yiqun Ge Method of reduced state decoding and decoder thereof

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
LEE, HEUNG NO ET AL.: "Introduction of Compressive Sensing", THE JOURNAL OF KOREA INSTITUTE OF ELECTRONICS ENGINEERS, vol. 38, no. 1, January 2011 (2011-01-01), pages 19 - 30 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114646934A (zh) * 2021-11-18 2022-06-21 南京理工大学 一种基于稀疏向量编码的多载波雷达通信一体化波形设计方法

Similar Documents

Publication Publication Date Title
CN1636419A (zh) 丛发侦测器
CN1498473A (zh) 多输入一多输出信道中提高带宽效率的方法和系统
CN106953709B (zh) 一种基于空间调制的多天线系统的下行非正交多接入方法
WO2017183845A1 (fr) Procédé de communication en liaison montante basée ncma, et dispositif associé
CN102340328A (zh) 基于空-时-频三维互补码的码片级扩频编码的多载波mimo系统
Naser et al. Space-time block coded spatial modulation for indoor visible light communications
CN105553552B (zh) 多用户可见光通信方法和系统
KR102111975B1 (ko) 희소 코딩을 이용한 정보 전송 방법 및 장치
TW201714484A (zh) 多用戶疊加傳輸方法以及使用所述方法的基地台
Matsushima et al. A visible-light communication system using optical CDMA with inverted MPSC
US7764711B2 (en) CDMA transmission apparatus and CDMA transmission method
KR100461736B1 (ko) 직접-시퀀스 ｃｄｍａ 스펙트럼 확산 통신 시스템에서높은 비트 밀도를 실현하기 위해 코드북 인덱싱을이용하는 방법
US7623565B2 (en) Method for providing packet framing in a communication system
WO2011074808A2 (fr) Procédé et appareil pour configurer un canal utilisant la diversité
WO2018194365A1 (fr) Procédé et dispositif de transmission d'informations en utilisant le codage épars
WO2015133836A1 (fr) Procédé de diversité de transmission pour fqam et appareil associé
US20210367710A1 (en) Apparatus and method for sending side-channel bits on an ethernet cable
KR20060024821A (ko) 코드화된 널 패킷-원용 동기화를 위한 방법 및 시스템
US11539463B2 (en) Methods and computing device for facilitating multiple access in a wireless communication network
CN106130637B (zh) 一种基于led的可见光通信系统和方法
CN101496330A (zh) 用于沃尔什编码的编码交织
CN108259073A (zh) 基于广义空间调制的上行通信多用户信号检测方法及装置
CN118264362A (zh) 基于语义的信息传输方法、装置及网络节点设备
KR100830456B1 (ko) 물리채널 전송 포맷 스크램블링 방법 및 물리채널 전송포맷 정보 전송 장치
CN112039605B (zh) 一种基于软件无线电的收发系统及视频传输方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18787159

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18787159

Country of ref document: EP

Kind code of ref document: A1