US20160359583A1 - Transmission schemes for device communications - Google Patents
Transmission schemes for device communications Download PDFInfo
- Publication number
- US20160359583A1 US20160359583A1 US14/729,970 US201514729970A US2016359583A1 US 20160359583 A1 US20160359583 A1 US 20160359583A1 US 201514729970 A US201514729970 A US 201514729970A US 2016359583 A1 US2016359583 A1 US 2016359583A1
- Authority
- US
- United States
- Prior art keywords
- ues
- base station
- matrix
- signals
- iterative algorithm
- 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.)
- Granted
Links
- 238000004891 communication Methods 0.000 title claims abstract description 24
- 230000005540 biological transmission Effects 0.000 title description 14
- 239000011159 matrix material Substances 0.000 claims abstract description 39
- 238000000034 method Methods 0.000 claims abstract description 28
- 239000013598 vector Substances 0.000 claims description 11
- 238000012545 processing Methods 0.000 description 25
- 238000013459 approach Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 230000004075 alteration Effects 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- VWDWKYIASSYTQR-UHFFFAOYSA-N sodium nitrate Chemical compound [Na+].[O-][N+]([O-])=O VWDWKYIASSYTQR-UHFFFAOYSA-N 0.000 description 2
- 230000007480 spreading Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000010363 phase shift Effects 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0054—Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J11/00—Orthogonal multiplex systems, e.g. using WALSH codes
- H04J11/0023—Interference mitigation or co-ordination
- H04J11/0026—Interference mitigation or co-ordination of multi-user interference
- H04J11/0036—Interference mitigation or co-ordination of multi-user interference at the receiver
- H04J11/0046—Interference mitigation or co-ordination of multi-user interference at the receiver using joint detection algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0003—Code application, i.e. aspects relating to how codes are applied to form multiplexed channels
-
- 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
- H04L1/0048—Decoding adapted to other signal detection operation in conjunction with detection of multiuser or interfering signals, e.g. iteration between CDMA or MIMO detector and FEC decoder
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/0202—Channel estimation
- H04L25/024—Channel estimation channel estimation algorithms
- H04L25/0242—Channel estimation channel estimation algorithms using matrix methods
Definitions
- the present disclosure is generally directed to wireless network communications, and more particularly to transmission schemes, such as for use in future networks including 5G networks.
- This disclosure is directed to a new transmission scheme for device communications in a network.
- a method for use in a wireless communication network includes receiving, by the base station, a plurality of signals from a plurality of user equipments (UE) in communication with the base station.
- the method also includes using an iterative algorithm to estimate a matrix ⁇ of channel coefficients based on the received signals.
- the method further includes decoding, at the base station, the received signals using the estimated matrix ⁇ .
- a base station configured to operate in a wireless network.
- the base station includes at least one memory and at least one processing unit.
- the at least one processing unit is configured to receive a plurality of signals from a plurality of user equipments (UEs) in communication with the base station; use an iterative algorithm to estimate a matrix ⁇ of channel coefficients based on the received signals; and decode the received signals using the estimated matrix ⁇ .
- UEs user equipments
- a wireless network system in another example embodiment, includes a plurality of user equipments (UEs) and a base station configured to communicate with the plurality of UEs.
- the base station is configured to receive a plurality of signals from a plurality of user equipments (UEs) in communication with the base station; use an iterative algorithm to estimate a matrix ⁇ of channel coefficients based on the received signals; and decode the received signals using the estimated matrix.
- UEs user equipments
- UEs user equipments
- FIG. 1 illustrates a wireless communications system that may be used for implementing the devices and methods disclosed herein;
- FIGS. 2A and 2B illustrate example devices including UEs that may implement the methods and teachings according to this disclosure.
- FIG. 3 illustrates a comparison of the bit error rate for this disclosure compared to a classical method.
- FIG. 1 illustrates an example communication system 100 that may be used for implementing the devices and methods disclosed herein.
- the system 100 enables multiple wireless users to transmit and receive data and other content.
- the system 100 may implement one or more channel access methods, such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or single-carrier FDMA (SC-FDMA).
- CDMA code division multiple access
- TDMA time division multiple access
- FDMA frequency division multiple access
- OFDMA orthogonal FDMA
- SC-FDMA single-carrier FDMA
- the communication system 100 includes user equipment (UE) 110 a - 110 c , radio access networks (RANs) 120 a - 120 b , a core network 130 , a public switched telephone network (PSTN) 140 , the Internet 150 , and other networks 160 . While certain numbers of these components or elements are shown in FIG. 1 , any number of these components or elements may be included in the system 100 .
- UE user equipment
- RANs radio access networks
- PSTN public switched telephone network
- the UEs 110 a - 110 c are configured to operate and/or communicate in the system 100 .
- the UEs 110 a - 110 c are configured to transmit and/or receive wireless signals or wired signals.
- Each UE 110 a - 110 c represents any suitable end user device and may include such devices (or may be referred to) as a user equipment/device (UE), wireless transmit/receive unit (WTRU), mobile station, fixed or mobile subscriber unit, pager, cellular telephone, personal digital assistant (PDA), smartphone, laptop, computer, touchpad, wireless sensor, or consumer electronics device.
- UE user equipment/device
- WTRU wireless transmit/receive unit
- PDA personal digital assistant
- smartphone laptop, computer, touchpad, wireless sensor, or consumer electronics device.
- the RANs 120 a - 120 b here include base stations 170 a - 170 b , respectively.
- Each base station 170 a - 170 b is configured to wirelessly interface with one or more of the UEs 110 a - 110 c to enable access to the core network 130 , the PSTN 140 , the Internet 150 , and/or the other networks 160 .
- the base stations 170 a - 170 b may include (or be) one or more of several well-known devices, such as a base transceiver station (BTS), a Node-B (NodeB), an evolved NodeB (eNodeB), a Home NodeB, a Home eNodeB, a site controller, an access point (AP), or a wireless router, or a server, router, switch, or other processing entity with a wired or wireless network.
- BTS base transceiver station
- NodeB Node-B
- eNodeB evolved NodeB
- AP access point
- AP access point
- wireless router or a server, router, switch, or other processing entity with a wired or wireless network.
- the base station 170 a forms part of the RAN 120 a , which may include other base stations, elements, and/or devices.
- the base station 170 b forms part of the RAN 120 b , which may include other base stations, elements, and/or devices.
- Each base station 170 a - 170 b operates to transmit and/or receive wireless signals within a particular geographic region or area, sometimes referred to as a “cell.”
- MIMO multiple-input multiple-output
- the base stations 170 a - 170 b communicate with one or more of the UEs 110 a - 110 c over one or more air interfaces 190 using wireless communication links.
- the air interfaces 190 may utilize any suitable radio access technology.
- the UEs 110 a - 110 c may transmit signals to one or more of the base stations 170 a - 170 b without coordination between the UEs 110 a - 110 c.
- the system 100 may use multiple channel access functionality, including such schemes as described herein.
- the base stations and UEs implement LTE, LTE-A, and/or LTE-B.
- LTE Long Term Evolution
- LTE-A Long Term Evolution
- LTE-B Long Term Evolution-B
- the RANs 120 a - 120 b are in communication with the core network 130 to provide the UEs 110 a - 110 c with voice, data, application, Voice over Internet Protocol (VoIP), or other services. Understandably, the RANs 120 a - 120 b and/or the core network 130 may be in direct or indirect communication with one or more other RANs (not shown).
- the core network 130 may also serve as a gateway access for other networks (such as PSTN 140 , Internet 150 , and other networks 160 ).
- some or all of the UEs 110 a - 110 c may include functionality for communicating with different wireless networks over different wireless links using different wireless technologies and/or protocols.
- FIG. 1 illustrates one example of a communication system
- the communication system 100 could include any number of UEs, base stations, networks, or other components in any suitable configuration, and can further include the EPC illustrated in any of the figures herein.
- FIGS. 2A and 2B illustrate example devices that may implement the methods and teachings according to this disclosure.
- FIG. 2A illustrates an example UE 110
- FIG. 2B illustrates an example base station 170 .
- These components could be used in the system 100 or in any other suitable system.
- the UE 110 includes at least one processing unit 200 .
- the processing unit 200 implements various processing operations of the UE 110 .
- the processing unit 200 could perform signal coding, data processing, power control, input/output processing, or any other functionality enabling the UE 110 to operate in the system 100 .
- the processing unit 200 also supports the methods and teachings described in more detail below.
- Each processing unit 200 includes any suitable processing or computing device configured to perform one or more operations.
- Each processing unit 200 could, for example, include a microprocessor, microcontroller, digital signal processor, field programmable gate array, or application specific integrated circuit.
- the UE 110 also includes at least one transceiver 202 .
- the transceiver 202 is configured to modulate data or other content for transmission by at least one antenna 204 .
- the transceiver 202 is also configured to demodulate data or other content received by the at least one antenna 204 .
- Each transceiver 202 includes any suitable structure for generating signals for wireless transmission and/or processing signals received wirelessly.
- Each antenna 204 includes any suitable structure for transmitting and/or receiving wireless signals.
- One or multiple transceivers 202 could be used in the UE 110 , and one or multiple antennas 204 could be used in the UE 110 .
- a transceiver 202 could also be implemented using at least one transmitter and at least one separate receiver.
- the UE 110 further includes one or more input/output devices 206 .
- the input/output devices 206 facilitate interaction with a user.
- Each input/output device 206 includes any suitable structure for providing information to or receiving information from a user, such as a speaker, microphone, keypad, keyboard, display, or touch screen.
- the UE 110 includes at least one memory 208 .
- the memory 208 stores instructions and data used, generated, or collected by the UE 110 .
- the memory 208 could store software or firmware instructions executed by the processing unit(s) 200 and data used to reduce or eliminate interference in incoming signals.
- Each memory 208 includes any suitable volatile and/or non-volatile storage and retrieval device(s). Any suitable type of memory may be used, such as random access memory (RAM), read only memory (ROM), hard disk, optical disc, subscriber identity module (SIM) card, memory stick, secure digital (SD) memory card, and the like.
- the base station 170 includes at least one processing unit 250 , at least one transmitter 252 , at least one receiver 254 , one or more antennas 256 , and at least one memory 258 .
- the processing unit 250 implements various processing operations of the base station 170 , such as signal coding, data processing, power control, input/output processing, or any other functionality.
- the processing unit 250 can also support the methods and teachings described in more detail below.
- Each processing unit 250 includes any suitable processing or computing device configured to perform one or more operations.
- Each processing unit 250 could, for example, include a microprocessor, microcontroller, digital signal processor, field programmable gate array, or application specific integrated circuit.
- Each transmitter 252 includes any suitable structure for generating signals for wireless transmission to one or more UEs or other devices.
- Each receiver 254 includes any suitable structure for processing signals received wirelessly from one or more UEs or other devices. Although shown as separate components, at least one transmitter 252 and at least one receiver 254 could be combined into a transceiver.
- Each antenna 256 includes any suitable structure for transmitting and/or receiving wireless signals. While a common antenna 256 is shown here as being coupled to both the transmitter 252 and the receiver 254 , one or more antennas 256 could be coupled to the transmitter(s) 252 , and one or more separate antennas 256 could be coupled to the receiver(s) 254 .
- Each memory 258 includes any suitable volatile and/or non-volatile storage and retrieval device(s).
- Embodiments of this disclosure provide a transmission scheme for device communications in an advanced wireless network.
- N low duty UEs 110 in a sector Let the transmission channel from the i-th UE 110 to the base station 170 be. The channels are assumed to be static during each transmission. This is a reasonable assumption as most of the UEs 110 are fixed or quasi-static.
- k of the UEs 110 e.g., users i 1 , i 2 , . . . , i k
- the dedicated channel dedicated channel
- UE i can then send s i p i .
- the received signal at the base station 170 is then given by:
- n is independent and identically distributed (i.i.d.) Gaussian noise.
- An alternative approach is to choose m ⁇ N.
- the underlying signature sequences are not orthogonal.
- K ⁇ N can be used to resolve these UEs 110 . This can be performed as in multiuser detection.
- K ⁇ N then the correlation of signature sequences may not be small.
- a matched filter to determine the active UEs 110 may not have good performance due to the interference by other UEs 110 and near-far problems.
- Multiuser detection of all UEs 110 may also be computationally complex.
- ⁇ be an N ⁇ M matrix of channel coefficients whose j-th row ⁇ [j, •] is (c 1,j ⁇ j , c 2,j ⁇ j , . . . , c M,j ⁇ j ), where (c 1,j , c 2,j , . . . , c M,j ) is the codeword transmitted by UE j .
- the matrix R which represents the received signals, can be determined according to the following:
- P [p i,j ] is an m ⁇ N matrix whose i,j-th element is given by p i,j , and n is an m ⁇ M matrix modeled as an i.i.d. complex Gaussian noise distributed according to N(0, ⁇ 2 I), where I denotes the identity matrix.
- the vector n captures interference and noise at the base station receiver j during the transmission of coded signature sequences.
- ⁇ is a matrix and not a vector.
- ⁇ is row-sparse, i.e., many rows of the matrix ⁇ are zeros.
- L 1 norm of v. ⁇ v ⁇ is referred to as the length of v. ⁇ v ⁇ o is defined as the L 0 norm of v, which is the number of nonzero elements of v.
- the L 1 norm of the vector is a sparsifying regularizer.
- a regularizer is needed that is sparsifying for the rows of matrix ⁇ .
- One such sparsifier is given by
- this regularizer is based on the L 1 norm, it sparsifies the elements of the above matrix. This forces the elements of A to go to zero. However, it is desired that some of the rows (vectors) of ⁇ go to zero. Thus, the L 0 norms of the rows of ⁇ are brought into consideration.
- the regularized decoder minimizes the objective function
- metric ⁇ >0 is a regularization parameter that can be fine-tuned.
- the minimization of C( ⁇ ) is not generally easy.
- the metric C( ⁇ ) can be written as the negative of a log-likelihood metric given by a product of independent Gaussians and Poisson-like distributions (plus some constant terms that are dropped from the maximization) parameterized by A, as shown in the following log-likelihood:
- s 1 be the maximal eigenvalue of PP*.
- n 1 and n 2 be independent Gaussian N ⁇ M and m ⁇ M matrices whose columns are distributed i.i.d. according to N(0,I) and Na(0, ⁇ 2 I ⁇ 2 PP*), where ⁇ >0 is chosen such that
- s 1 can be computed as the maximum eigenvalue of PP* and set to
- the hidden auxiliary random variable is revealed in the following:
- R Pv+n 2 .
- R l ( I - ⁇ 2 ⁇ 2 ⁇ P * ⁇ P ) ⁇ ⁇ l + ⁇ 2 ⁇ 2 ⁇ P * ⁇ R
- ⁇ l + 1 sgn ⁇ ( R l ) ⁇ ( ⁇ R l ⁇ - ⁇ 2 ⁇ ⁇ 2 ⁇ 2 ⁇ ones ⁇ ( m , M ) ) +
- step 5 the row sparsification step is performed as follows: If any row of ⁇ l+1 has more than L zeros (where L is an integer predefined and optimized by the designer), then replace that row with the all-zero vector.
- This means that (c 1,j ⁇ j , c 2,j ⁇ j , . . . , c M,j ⁇ j ) is an estimate at hand for j 1, 2, . . . , N.
- this estimate is fed to a standard decoder in the base station 170 for the code book assigned to UE j to decode the transmitted signals.
- any matrix suitable for compressed sensing (such as Random Gaussian matrices) can be applied as a signature sequence.
- FIG. 3 simulation results of communications using the disclosed embodiments are shown.
- the transmission scheme according to this disclosure performs as well as the no multiple access interference case, but is six times more bandwidth efficient.
- the performance of this disclosure shown in FIG. 3 is simulated for 60 UEs 110 on a dedicated channel. At any given time, four UEs are active, but it is not known at the base station 170 which four UEs 110 these are.
- Each UE 110 is assigned a randomized signature of length 10 created according to an i.i.d. Gaussian distribution and normalized to have length one.
- the transmission uses encoded binary phase shift keying (BPSK) with packets of length 100 .
- the channel is Rayleigh fading.
- the value SNR in the plot of FIG. 3 is the collected Energy per transmitted bit to noise power spectral density E b /N o .
- each UE 110 uses a signature of length 60 , and these signatures are assumed to be orthogonal to each other. Thus, there is no multiple access interference.
- the bandwidth efficiency of this case is 1 ⁇ 6 of the conventional case described above. In both cases, the channels of each UE 110 are assumed to be perfectly estimated at the receiver of base station 170 .
- the receiver at the base station 170 does not need to know which transmitters of the UEs are active but the receiver knows an upper bound on the number of transmitting UEs.
- the disclosed embodiments use a spreading technique using short signatures and a modified Expectation Maximization (EM) algorithm to decode the transmitting UEs at the base station 170 . Simulation results provided demonstrate the performance of the scheme of this disclosure.
- EM Expectation Maximization
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Artificial Intelligence (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Power Engineering (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
- The present disclosure is generally directed to wireless network communications, and more particularly to transmission schemes, such as for use in future networks including 5G networks.
- Recently, H. Nikpour and H. Baligh proposed Sparse Code Multiple Access for beyond 4G communications. The gist of this approach is to use sparse codebooks for communications to, and communications by, various users, and use the sparsity to recover the transmitted sequences from superposed codebooks.
- In the future, there will be millions of devices that need to be connected. These devices will transmit with very low duty cycles and often will not transmit any information. Thus, at any time slot within a cell/sector, only a few of these devices will be active. Consider a system where a channel (e.g., a subcarrier or resource block) is dedicated to transmission by these devices to the base station.
- A practical method for these devices to transmit efficiently to the base station and provide decoding without coordination is desired.
- This disclosure is directed to a new transmission scheme for device communications in a network.
- In one example embodiment, a method for use in a wireless communication network is provided. The method includes receiving, by the base station, a plurality of signals from a plurality of user equipments (UE) in communication with the base station. The method also includes using an iterative algorithm to estimate a matrix Λ of channel coefficients based on the received signals. The method further includes decoding, at the base station, the received signals using the estimated matrix Λ.
- In another example embodiment, a base station configured to operate in a wireless network is provided. The base station includes at least one memory and at least one processing unit. The at least one processing unit is configured to receive a plurality of signals from a plurality of user equipments (UEs) in communication with the base station; use an iterative algorithm to estimate a matrix Λ of channel coefficients based on the received signals; and decode the received signals using the estimated matrix Λ.
- In another example embodiment, a wireless network system is provided that includes a plurality of user equipments (UEs) and a base station configured to communicate with the plurality of UEs. The base station is configured to receive a plurality of signals from a plurality of user equipments (UEs) in communication with the base station; use an iterative algorithm to estimate a matrix Λ of channel coefficients based on the received signals; and decode the received signals using the estimated matrix.
- For a more complete understanding of the present disclosure, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, wherein like numbers designate like objects, and in which:
-
FIG. 1 illustrates a wireless communications system that may be used for implementing the devices and methods disclosed herein; -
FIGS. 2A and 2B illustrate example devices including UEs that may implement the methods and teachings according to this disclosure; and -
FIG. 3 illustrates a comparison of the bit error rate for this disclosure compared to a classical method. -
FIG. 1 illustrates anexample communication system 100 that may be used for implementing the devices and methods disclosed herein. In general, thesystem 100 enables multiple wireless users to transmit and receive data and other content. Thesystem 100 may implement one or more channel access methods, such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or single-carrier FDMA (SC-FDMA). - In this example, the
communication system 100 includes user equipment (UE) 110 a-110 c, radio access networks (RANs) 120 a-120 b, acore network 130, a public switched telephone network (PSTN) 140, the Internet 150, andother networks 160. While certain numbers of these components or elements are shown inFIG. 1 , any number of these components or elements may be included in thesystem 100. - The UEs 110 a-110 c are configured to operate and/or communicate in the
system 100. For example, the UEs 110 a-110 c are configured to transmit and/or receive wireless signals or wired signals. Each UE 110 a-110 c represents any suitable end user device and may include such devices (or may be referred to) as a user equipment/device (UE), wireless transmit/receive unit (WTRU), mobile station, fixed or mobile subscriber unit, pager, cellular telephone, personal digital assistant (PDA), smartphone, laptop, computer, touchpad, wireless sensor, or consumer electronics device. - The RANs 120 a-120 b here include
base stations 170 a-170 b, respectively. Eachbase station 170 a-170 b is configured to wirelessly interface with one or more of the UEs 110 a-110 c to enable access to thecore network 130, the PSTN 140, the Internet 150, and/or theother networks 160. For example, thebase stations 170 a-170 b may include (or be) one or more of several well-known devices, such as a base transceiver station (BTS), a Node-B (NodeB), an evolved NodeB (eNodeB), a Home NodeB, a Home eNodeB, a site controller, an access point (AP), or a wireless router, or a server, router, switch, or other processing entity with a wired or wireless network. - In the embodiment shown in
FIG. 1 , thebase station 170 a forms part of the RAN 120 a, which may include other base stations, elements, and/or devices. Also, thebase station 170 b forms part of the RAN 120 b, which may include other base stations, elements, and/or devices. Eachbase station 170 a-170 b operates to transmit and/or receive wireless signals within a particular geographic region or area, sometimes referred to as a “cell.” In some embodiments, multiple-input multiple-output (MIMO) technology may be employed having multiple transceivers for each cell. - The
base stations 170 a-170 b communicate with one or more of the UEs 110 a-110 c over one ormore air interfaces 190 using wireless communication links. Theair interfaces 190 may utilize any suitable radio access technology. In some embodiments, the UEs 110 a-110 c may transmit signals to one or more of thebase stations 170 a-170 b without coordination between the UEs 110 a-110 c. - It is contemplated that the
system 100 may use multiple channel access functionality, including such schemes as described herein. In particular embodiments, the base stations and UEs implement LTE, LTE-A, and/or LTE-B. Of course, other multiple access schemes and wireless protocols may be utilized. - The RANs 120 a-120 b are in communication with the
core network 130 to provide the UEs 110 a-110 c with voice, data, application, Voice over Internet Protocol (VoIP), or other services. Understandably, the RANs 120 a-120 b and/or thecore network 130 may be in direct or indirect communication with one or more other RANs (not shown). Thecore network 130 may also serve as a gateway access for other networks (such as PSTN 140, Internet 150, and other networks 160). In addition, some or all of the UEs 110 a-110 c may include functionality for communicating with different wireless networks over different wireless links using different wireless technologies and/or protocols. - Although
FIG. 1 illustrates one example of a communication system, various changes may be made toFIG. 1 . For example, thecommunication system 100 could include any number of UEs, base stations, networks, or other components in any suitable configuration, and can further include the EPC illustrated in any of the figures herein. -
FIGS. 2A and 2B illustrate example devices that may implement the methods and teachings according to this disclosure. In particular,FIG. 2A illustrates an example UE 110, andFIG. 2B illustrates anexample base station 170. These components could be used in thesystem 100 or in any other suitable system. - As shown in
FIG. 2A , the UE 110 includes at least oneprocessing unit 200. Theprocessing unit 200 implements various processing operations of the UE 110. For example, theprocessing unit 200 could perform signal coding, data processing, power control, input/output processing, or any other functionality enabling the UE 110 to operate in thesystem 100. Theprocessing unit 200 also supports the methods and teachings described in more detail below. Eachprocessing unit 200 includes any suitable processing or computing device configured to perform one or more operations. Eachprocessing unit 200 could, for example, include a microprocessor, microcontroller, digital signal processor, field programmable gate array, or application specific integrated circuit. - , The
UE 110 also includes at least onetransceiver 202. Thetransceiver 202 is configured to modulate data or other content for transmission by at least oneantenna 204. Thetransceiver 202 is also configured to demodulate data or other content received by the at least oneantenna 204. Eachtransceiver 202 includes any suitable structure for generating signals for wireless transmission and/or processing signals received wirelessly. Eachantenna 204 includes any suitable structure for transmitting and/or receiving wireless signals. One ormultiple transceivers 202 could be used in theUE 110, and one ormultiple antennas 204 could be used in theUE 110. Although shown as a single functional unit, atransceiver 202 could also be implemented using at least one transmitter and at least one separate receiver. - The
UE 110 further includes one or more input/output devices 206. The input/output devices 206 facilitate interaction with a user. Each input/output device 206 includes any suitable structure for providing information to or receiving information from a user, such as a speaker, microphone, keypad, keyboard, display, or touch screen. - In addition, the
UE 110 includes at least onememory 208. Thememory 208 stores instructions and data used, generated, or collected by theUE 110. For example, thememory 208 could store software or firmware instructions executed by the processing unit(s) 200 and data used to reduce or eliminate interference in incoming signals. Eachmemory 208 includes any suitable volatile and/or non-volatile storage and retrieval device(s). Any suitable type of memory may be used, such as random access memory (RAM), read only memory (ROM), hard disk, optical disc, subscriber identity module (SIM) card, memory stick, secure digital (SD) memory card, and the like. - As shown in
FIG. 2B , thebase station 170 includes at least oneprocessing unit 250, at least onetransmitter 252, at least onereceiver 254, one ormore antennas 256, and at least onememory 258. Theprocessing unit 250 implements various processing operations of thebase station 170, such as signal coding, data processing, power control, input/output processing, or any other functionality. Theprocessing unit 250 can also support the methods and teachings described in more detail below. Eachprocessing unit 250 includes any suitable processing or computing device configured to perform one or more operations. Eachprocessing unit 250 could, for example, include a microprocessor, microcontroller, digital signal processor, field programmable gate array, or application specific integrated circuit. - Each
transmitter 252 includes any suitable structure for generating signals for wireless transmission to one or more UEs or other devices. Eachreceiver 254 includes any suitable structure for processing signals received wirelessly from one or more UEs or other devices. Although shown as separate components, at least onetransmitter 252 and at least onereceiver 254 could be combined into a transceiver. Eachantenna 256 includes any suitable structure for transmitting and/or receiving wireless signals. While acommon antenna 256 is shown here as being coupled to both thetransmitter 252 and thereceiver 254, one ormore antennas 256 could be coupled to the transmitter(s) 252, and one or moreseparate antennas 256 could be coupled to the receiver(s) 254. Eachmemory 258 includes any suitable volatile and/or non-volatile storage and retrieval device(s). - Additional
details regarding UEs 110 andbase stations 170 are known to those of skill in the art. As such, these details are omitted here for clarity. - Embodiments of this disclosure provide a transmission scheme for device communications in an advanced wireless network.
- Consider N
low duty UEs 110 in a sector. Let the transmission channel from the i-th UE 110 to thebase station 170 be. The channels are assumed to be static during each transmission. This is a reasonable assumption as most of theUEs 110 are fixed or quasi-static. Suppose k of the UEs 110 (e.g., users i1, i2, . . . , ik) are active at some time and are transmitting on the dedicated channel (resource block), where k<=N. It is not known which k users are transmitting but it is known that there are at most K of theseactive UEs 110 where K<<N. - One way to separate these
UEs 110 is to allocate a (spreading) sequence: -
- to user i. To transmit the symbol si, UE i can then send sipi. The received signal at the
base station 170 is then given by: -
- where n is independent and identically distributed (i.i.d.) Gaussian noise.
- One way to detect these
UEs 110 is to choose m=Nand select orthogonal signature sequences Pi, i=1, 2, . . . , N for all of theUEs 110. Then, by correlating r with these signature sequences, noisy estimates of αij sij can be obtained. However, this may not be bandwidth efficient as N can be quite large. - An alternative approach is to choose m<<N. In this way, the underlying signature sequences are not orthogonal. The fact that K<<N can be used to resolve these
UEs 110. This can be performed as in multiuser detection. However if K<<N, then the correlation of signature sequences may not be small. A matched filter to determine theactive UEs 110 may not have good performance due to the interference byother UEs 110 and near-far problems. Multiuser detection of allUEs 110 may also be computationally complex. - Thus, an alternative approach is desired. To model the problem, it is assumed that all
UE 110 transmissions are codewords of length M. If a codeword (c1,i, c2,i, . . . , cM,i) is to be transmitted, UE i transmits (c1,ipi, c2,ipi, . . . , cm,ipi). Any inactive UE can be thought as transmitting an all zero codeword. - Let Λ be an N×M matrix of channel coefficients whose j-th row Λ[j, •] is (c1,jαj, c2,jαj, . . . , cM,jαj), where (c1,j, c2,j, . . . , cM,j) is the codeword transmitted by UEj. Then, the matrix R, which represents the received signals, can be determined according to the following:
-
R=PΛ+n (1) - where P=[pi,j] is an m×N matrix whose i,j-th element is given by pi,j, and n is an m×M matrix modeled as an i.i.d. complex Gaussian noise distributed according to N(0,σ2I), where I denotes the identity matrix.
- The vector n captures interference and noise at the base station receiver j during the transmission of coded signature sequences. In the above, the values in the j-th column of R represent the received signals at the
base station 170 at times m*(j−1)+1, m*(j−1)+2, . . . m*j for j=1, 2, . . . , M. - What is known is that most of the rows of Λ are zeros as
most UEs 110 are not active at each time. Thus, it is desired to determine the transmittingUEs 110 and compute their transmitted codewords using this information but with m<<N. - The above scenario is similar to compressed sensing. However, there are some differences between compressed sensing and this scenario. First, Λ is a matrix and not a vector. Second, in compressed sensing, a sparse vector must be recovered. However, in this scenario, the matrix Λ is row-sparse, i.e., many rows of the matrix Λ are zeros. Thus, this disclosure provides new algorithms for reconstructing A.
- For any vector v=(v1, v2, . . . vM), let
-
- be the Euclidean norm and
-
- be respectively the L1 norm of v. ∥v∥ is referred to as the length of v. ∥v∥o is defined as the L0 norm of v, which is the number of nonzero elements of v.
- It is known that the L1 norm of the vector is a sparsifying regularizer. A regularizer is needed that is sparsifying for the rows of matrix Λ. One such sparsifier is given by
-
- An important observation can be made about this regularizer. Since this regularizer is based on the L1 norm, it sparsifies the elements of the above matrix. This forces the elements of A to go to zero. However, it is desired that some of the rows (vectors) of Λ go to zero. Thus, the L0 norms of the rows of Λ are brought into consideration.
- The regularized decoder minimizes the objective function
-
- subject to modifications that forces some of the rows (vectors) of Λ to go to zero.
- In the above scenario, metric λ>0 is a regularization parameter that can be fine-tuned. The minimization of C(Λ) is not generally easy. The metric C(Λ) can be written as the negative of a log-likelihood metric given by a product of independent Gaussians and Poisson-like distributions (plus some constant terms that are dropped from the maximization) parameterized by A, as shown in the following log-likelihood:
-
- This means that to minimize C(Λ), it suffices to find the parameter Λ that maximizes the above log-likelihood (with some constants eliminated from the equation). A standard approach to maximizing the log-likelihood function is the expectation-maximization (EM) algorithm, where a hidden auxiliary variable is revealed.
- Let s1 be the maximal eigenvalue of PP*. Let n1 and n2 be independent Gaussian N×M and m×M matrices whose columns are distributed i.i.d. according to N(0,I) and Na(0, σ2I−β2PP*), where β>0 is chosen such that
-
- and P* denotes the Hermitian of P. In fact, after P is designed, s1 can be computed as the maximum eigenvalue of PP* and set to
-
- Also, in this implementation, no knowledge of a is needed, and only the value of
-
- is needed, which is set as just described.
- The hidden auxiliary random variable is revealed in the following:
-
v=Λ+βn 1. - Then, it is easy to see that statistically speaking
-
R=Pv+n 2. - The expectation (E) and maximization (M) steps of the EM algorithm can now be computed. However, embodiments of this disclosure add a row sparsification step that is not present in a conventional EM algorithm. The iterative algorithm for computing Λ is given below.
- Estimation Algorithm for Λ
- The estimation algorithm for Λ starts by determining an initial estimate Λ1 for the channel coefficients Λ (step 1). Next, a number of iterations Niter is selected (step 2). For each value l=1, 2, . . . , Niter, the following steps 3 through 5 are perfolined. For the E-Step (step 3), the following is computed:
-
- For the M-Step (step 4), the following is computed:
-
- where
-
- and ½ for x=0, ones(m, M) is an m×M matrix whose i,j-th element is one, and x+=x for x>=0 and is zero otherwise.
- In
step 5, the row sparsification step is performed as follows: If any row of Λl+1 has more than L zeros (where L is an integer predefined and optimized by the designer), then replace that row with the all-zero vector. - In the above, the value of
-
- and λσ2 can be fine-tuned. Additionally, depending on the initial guess of Λ1, faster or slower convergence of the optimum value of Λ can be achieved. A possible initial guess is given next assuming that columns of P (UE signatures) are normalized to all have
length 1. Each column R[•,j] is projected on the subspace W spanned by columns of P for j=1, 2 . . . , M. Or stated in mathematical notation, the Projw(R[•,j]) is computed. The value of the initial guess is then computed for Λ[•,j] as P*Projw(R[•,j]) for j=1, 2 . . . , M. This produces an initial, rough estimate of A. Other initial guesses are also possible. - Estimation Algorithm for the Transmitted Codewords
- Once the estimate {tilde over (Λ)} of Λ are computed in the above, then the j-th row of Λ is an estimate of the j-th row of Λ for j=1, 2, . . . , N. This means that (c1,jαj, c2,jαj, . . . , cM,jαj) is an estimate at hand for j=1, 2, . . . , N. For the nonzero rows, this estimate is fed to a standard decoder in the
base station 170 for the code book assigned to UE j to decode the transmitted signals. - To construct the UE signatures, any matrix suitable for compressed sensing (such as Random Gaussian matrices) can be applied as a signature sequence.
- Simulation Results
- In
FIG. 3 , simulation results of communications using the disclosed embodiments are shown. As can be seen, the transmission scheme according to this disclosure performs as well as the no multiple access interference case, but is six times more bandwidth efficient. - The performance of this disclosure shown in
FIG. 3 is simulated for 60UEs 110 on a dedicated channel. At any given time, four UEs are active, but it is not known at thebase station 170 which fourUEs 110 these are. EachUE 110 is assigned a randomized signature oflength 10 created according to an i.i.d. Gaussian distribution and normalized to have length one. The transmission uses encoded binary phase shift keying (BPSK) with packets oflength 100. The channel is Rayleigh fading. The value SNR in the plot ofFIG. 3 is the collected Energy per transmitted bit to noise power spectral density Eb/No. In the classical case, eachUE 110 uses a signature of length 60, and these signatures are assumed to be orthogonal to each other. Thus, there is no multiple access interference. The bandwidth efficiency of this case is ⅙ of the conventional case described above. In both cases, the channels of eachUE 110 are assumed to be perfectly estimated at the receiver ofbase station 170. - In this disclosure, a new method is provided for systems beyond 4G systems. In the disclosed embodiments, the receiver at the
base station 170 does not need to know which transmitters of the UEs are active but the receiver knows an upper bound on the number of transmitting UEs. The disclosed embodiments use a spreading technique using short signatures and a modified Expectation Maximization (EM) algorithm to decode the transmitting UEs at thebase station 170. Simulation results provided demonstrate the performance of the scheme of this disclosure. - While this disclosure has described certain embodiments and generally associated methods, alterations and permutations of these embodiments and methods will be apparent to those skilled in the art. Accordingly, the above description of example embodiments does not define or constrain this disclosure. Other changes, substitutions, and alterations are also possible without departing from the spirit and scope of this disclosure, as defined by the following claims.
Claims (21)
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/729,970 US9509443B1 (en) | 2015-06-03 | 2015-06-03 | Transmission schemes for device communications |
PCT/CN2016/084154 WO2016192619A1 (en) | 2015-06-03 | 2016-05-31 | New transmission schemes for device communications |
CN201680029564.5A CN107615804B (en) | 2015-06-03 | 2016-05-31 | New transmission scheme for device communication |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/729,970 US9509443B1 (en) | 2015-06-03 | 2015-06-03 | Transmission schemes for device communications |
Publications (2)
Publication Number | Publication Date |
---|---|
US9509443B1 US9509443B1 (en) | 2016-11-29 |
US20160359583A1 true US20160359583A1 (en) | 2016-12-08 |
Family
ID=57352029
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/729,970 Active US9509443B1 (en) | 2015-06-03 | 2015-06-03 | Transmission schemes for device communications |
Country Status (3)
Country | Link |
---|---|
US (1) | US9509443B1 (en) |
CN (1) | CN107615804B (en) |
WO (1) | WO2016192619A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10128897B2 (en) | 2016-05-26 | 2018-11-13 | Huawei Technologies Co., Ltd. | Two-phase transmission for machine-type communication |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20210141143A (en) * | 2020-05-15 | 2021-11-23 | 삼성전자주식회사 | Method and apparatus for user activity detection and channel estimation in a wireless communication system supporting massive mimo |
CN113411142B (en) * | 2021-06-29 | 2022-09-06 | 齐鲁工业大学 | Method, system, terminal and storage medium for determining maximum likelihood direction finding of broadband |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6665664B2 (en) * | 2001-01-11 | 2003-12-16 | Sybase, Inc. | Prime implicates and query optimization in relational databases |
US7092436B2 (en) * | 2002-01-25 | 2006-08-15 | Mitsubishi Electric Research Laboratories, Inc. | Expectation-maximization-based channel estimation and signal detection for wireless communications systems |
US7139336B2 (en) * | 2002-04-05 | 2006-11-21 | Nokia Corporation | Method and system for channel estimation using iterative estimation and detection |
KR100918717B1 (en) * | 2003-04-21 | 2009-09-24 | 삼성전자주식회사 | Sequence estimating method and device in mimo ofdm communication system |
US6868276B2 (en) * | 2003-06-17 | 2005-03-15 | Nokia Corporation | Method and apparatus for estimating carrier frequency offset and fading rate using autoregressive channel modeling |
US7388935B2 (en) | 2004-06-15 | 2008-06-17 | Telefonktiebolaget Lm Ericsson (Publ) | Method of inverting nearly Toeplitz or block Toeplitz matrices |
US7551664B2 (en) * | 2004-09-17 | 2009-06-23 | Nokia Corporation | Iterative and turbo-based method and apparatus for equalization of spread-spectrum downlink channels |
KR100843253B1 (en) * | 2006-12-01 | 2008-07-03 | 한국전자통신연구원 | Iterative reception method and Iterative receiver |
US8199861B1 (en) * | 2007-05-21 | 2012-06-12 | Karkhanechi Haideh M | Channel estimation in MIMO OFDM communication systems |
KR100909570B1 (en) * | 2007-12-17 | 2009-07-24 | 한국전자통신연구원 | Iterative channel and noise variance estimation apparatus and method for multi-input orthogonal frequency division system |
US8451930B2 (en) * | 2011-02-08 | 2013-05-28 | Mitsubishi Electric Research Laboratories, Inc. | Sparse channel estimation using order extension for frequency and time selective MIMO wireless communication networks |
US9544789B2 (en) * | 2012-12-12 | 2017-01-10 | Huawei Technologies Co., Ltd. | System and method for channel estimation in a wireless communications system |
US9647734B2 (en) * | 2013-11-14 | 2017-05-09 | Mediatek Singapore Pte. Ltd. | Large-scale fading coefficient estimation in wireless massive MIMO systems |
-
2015
- 2015-06-03 US US14/729,970 patent/US9509443B1/en active Active
-
2016
- 2016-05-31 WO PCT/CN2016/084154 patent/WO2016192619A1/en active Application Filing
- 2016-05-31 CN CN201680029564.5A patent/CN107615804B/en active Active
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10128897B2 (en) | 2016-05-26 | 2018-11-13 | Huawei Technologies Co., Ltd. | Two-phase transmission for machine-type communication |
US10938439B2 (en) | 2016-05-26 | 2021-03-02 | Huawei Technologies Co., Ltd. | Two-phase transmission for machine-type communication |
Also Published As
Publication number | Publication date |
---|---|
WO2016192619A1 (en) | 2016-12-08 |
US9509443B1 (en) | 2016-11-29 |
CN107615804B (en) | 2020-02-14 |
CN107615804A (en) | 2018-01-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10079627B1 (en) | Joint power allocation, precoding, and decoding method and base station thereof | |
US8464105B2 (en) | Method of multiuser precoding and scheduling and base station for implementing the same | |
US9954596B2 (en) | Interference rejection combining method, device and storage medium | |
US9634747B2 (en) | Apparatus and method of processing signal, and recording medium | |
US10374676B2 (en) | Channel tracking and transmit beamforming with frugal feedback | |
US11646776B2 (en) | Massive MIMO beam domain robust precoding transmission method and system | |
US20130182791A1 (en) | Sparse codes for mimo channel and detector alternatives for sparse code | |
US9118372B2 (en) | Method and apparatus for downlink multiuser MIMO transmission in a wireless network | |
US8107550B2 (en) | Methods for precoding signals for transmission in wireless MIMO system | |
EP3369187B1 (en) | Lattice reduction-aided symbol detection | |
KR20180081671A (en) | Methods and devices for sub-block decoding data signals | |
US9860035B2 (en) | Method and apparatus for decoding multi-user multiple-input multiple output wireless signal | |
US9509443B1 (en) | Transmission schemes for device communications | |
US8416877B2 (en) | Unitary precoding apparatus and method in multi-user multiple input multiple output (MIMO) communication system | |
WO2009075456A1 (en) | Method for transmission interference cancellation for mu-mimo | |
KR20190022021A (en) | Apparatus and method for channel feedback in wireless communication system | |
US11115240B2 (en) | Methods, apparatuses, and systems for performing analog CSI feedback | |
Hawej et al. | Pilot decontamination in massive multiuser MIMO systems based on low‐rank matrix approximation | |
Wang et al. | Multiple symbol differential detection for noncoherent communications with large-scale antenna arrays | |
US11962436B2 (en) | User detection technique, and method and apparatus for channel estimation in wireless communication system supporting massive multiple-input multiple-output | |
US20100232479A1 (en) | Wireless transceiver | |
KR20200001397A (en) | Basement apparatus, and control method thereof | |
CN108736940B (en) | Space division multiplexing method and device | |
JP2021170696A (en) | Radio receiver | |
US10374681B2 (en) | Method for processing information representative of a transmission channel by a radio equipment device, receiving equipment and associated computer program |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: HUAWEI TECHNOLOGIES CO., LTD., CHINA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TAROKH, VAHID;ZHU, PEIYING;SIGNING DATES FROM 20150701 TO 20150729;REEL/FRAME:036279/0945 |
|
AS | Assignment |
Owner name: HUAWEI TECHNOLOGIES CO., LTD., CHINA Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE OMISSION OF THIRD INVENTOR'S NAME PREVIOUSLY RECORDED AT REEL: 036279 FRAME: 0945. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT;ASSIGNORS:TAROKH, VAHID;ZHU, PEIYING;TONG, WEN;SIGNING DATES FROM 20150701 TO 20150804;REEL/FRAME:036336/0148 |
|
AS | Assignment |
Owner name: HUAWEI TECHNOLOGIES CO., LTD., CHINA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TAROKH, VAHID;ZHU, PEIYING;TONG, WEN;SIGNING DATES FROM 20160211 TO 20160212;REEL/FRAME:037742/0758 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 4 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 8 |