System and method for providing channel recovery for angle domain sparse channels

Information

  • Patent Grant
  • 11539424
  • Patent Number
    11,539,424
  • Date Filed
    Tuesday, January 7, 2020
    4 years ago
  • Date Issued
    Tuesday, December 27, 2022
    a year ago
Abstract
A system and method for providing channel recovery for angle domain sparse channels is herein provided. According to one embodiment, a method includes receiving an input including a measurement output, and recovering analog channels utilizing bases derived from the measurement output.
Description
FIELD

The present disclosure generally relates to a wireless communication system. In particular, the present disclosure relates to a system and method for providing channel recovery for angle domain sparse channels.


BACKGROUND

The 3rd Generation Partnership Project (3GPP) 5th generation (5G) standard includes multi-user multiple-input multiple-output (MU-MIMO) communication systems. In a MU-MIMO communication system, a base station transmits multiple data streams, one per user equipment (UE), using the same time-frequency resources to increase cell capacity. Beamforming is used in MIMO systems based on multiple antennas to control the antenna signal direction. Beamforming includes analog beamforming, digital beamforming, and hybrid beamforming.


SUMMARY

According to one embodiment, a method includes receiving an input including a measurement output and recovering analog channels utilizing bases derived from the measurement output.


According to one embodiment, a system includes a memory and a processor configured to receive an input including a measurement output and recover analog channels utilizing bases derived from the measurement output.


According to one embodiment, a method for analog channel recovery includes receiving an input including a measurement output, selecting a first basis according to a largest projection power of the measurement output, determining remaining bases based on the selected first basis, and recovering analog channels based on the selected first basis and the determined remaining bases.


According to one embodiment, a system for analog channel recovery includes a memory and a processor configured to receive an input including a measurement output, select a first basis according to a largest projection power of the measurement output, determine remaining bases based on the selected first basis, and recover analog channels based on the selected first basis and the determined remaining bases.





BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features, and advantages of certain embodiments of the present disclosure will be more apparent from the following detailed description, taken in conjunction with the accompanying drawings, in which:



FIG. 1 illustrates a diagram of a one-dimensional antenna array and an angle of arrival (AoA) being defined, according to one embodiment;



FIG. 2 illustrates a block diagram for the present receiver, where analog beamforming is performed, according to one embodiment;



FIG. 3 illustrates a flowchart in a method for analog channel recovery, according to an embodiment;



FIG. 4 illustrates a flowchart in a method for analog channel recovery, according to an embodiment; and



FIG. 5 illustrates a block diagram of an electronic device in a network environment, according to one embodiment.





DETAILED DESCRIPTION

Hereinafter, embodiments of the present disclosure are described in detail with reference to the accompanying drawings. It should be noted that the same elements will be designated by the same reference numerals although they are shown in different drawings. In the following description, specific details such as detailed configurations and components are merely provided to assist with the overall understanding of the embodiments of the present disclosure. Therefore, it should be apparent to those skilled in the art that various changes and modifications of the embodiments described herein may be made without departing from the scope of the present disclosure. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness. The terms described below are terms defined in consideration of the functions in the present disclosure, and may be different according to users, intentions of the users, or customs. Therefore, the definitions of the terms should be determined based on the contents throughout this specification.


The present disclosure may have various modifications and various embodiments, among which embodiments are described below in detail with reference to the accompanying drawings. However, it should be understood that the present disclosure is not limited to the embodiments, but includes all modifications, equivalents, and alternatives within the scope of the present disclosure.


Although the terms including an ordinal number such as first, second, etc. may be used for describing various elements, the structural elements are not restricted by the terms. The terms are only used to distinguish one element from another element. For example, without departing from the scope of the present disclosure, a first structural element may be referred to as a second structural element. Similarly, the second structural element may also be referred to as the first structural element. As used herein, the term “and/or” includes any and all combinations of one or more associated items.


The terms used herein are merely used to describe various embodiments of the present disclosure but are not intended to limit the present disclosure. Singular forms are intended to include plural forms unless the context clearly indicates otherwise. In the present disclosure, it should be understood that the terms “include” or “have” indicate existence of a feature, a number, a step, an operation, a structural element, parts, or a combination thereof, and do not exclude the existence or probability of the addition of one or more other features, numerals, steps, operations, structural elements, parts, or combinations thereof.


Unless defined differently, all terms used herein have the same meanings as those understood by a person skilled in the art to which the present disclosure belongs. Terms such as those defined in a generally used dictionary are to be interpreted to have the same meanings as the contextual meanings in the relevant field of art, and are not to be interpreted to have ideal or excessively formal meanings unless clearly defined in the present disclosure.


The electronic device according to one embodiment may be one of various types of electronic devices. The electronic devices may include, for example, a portable communication device (e.g., a smart phone), a computer, a portable multimedia device, a portable medical device, a camera, a wearable device, or a home appliance. According to one embodiment of the disclosure, an electronic device is not limited to those described above.


The terms used in the present disclosure are not intended to limit the present disclosure but are intended to include various changes, equivalents, or replacements for a corresponding embodiment. With regard to the descriptions of the accompanying drawings, similar reference numerals may be used to refer to similar or related elements. A singular form of a noun corresponding to an item may include one or more of the things, unless the relevant context clearly indicates otherwise. As used herein, each of such phrases as “A or B,” “at least one of A and B,” “at least one of A or B,” “A, B, or C,” “at least one of A, B, and C,” and “at least one of A, B, or C,” may include all possible combinations of the items enumerated together in a corresponding one of the phrases. As used herein, terms such as “1st,” “2nd,” “first,” and “second” may be used to distinguish a corresponding component from another component, but are not intended to limit the components in other aspects (e.g., importance or order). It is intended that if an element (e.g., a first element) is referred to, with or without the term “operatively” or “communicatively”, as “coupled with,” “coupled to,” “connected with,” or “connected to” another element (e.g., a second element), it indicates that the element may be coupled with the other element directly (e.g., wired), wirelessly, or via a third element.


As used herein, the term “module” may include a unit implemented in hardware, software, or firmware, and may interchangeably be used with other terms, for example, “logic,” “logic block,” “part,” and “circuitry.” A module may be a single integral component, or a minimum unit or part thereof, adapted to perform one or more functions. For example, according to one embodiment, a module may be implemented in a form of an application-specific integrated circuit (ASIC).


Analog beamforming adjusts the signal phases of individual antennas signals in a radio frequency (RF) domain. In digital beamforming, the signal is pre-coded in baseband processing before RF transmission.


In hybrid beamforming with single-connection antenna arrays, analog antennas are separated into several groups and each group is combined independently into a separated RF chain. In a single RF chain, for the receiver analog beamforming, a beam sweeping process is performed periodically to update the optimal beamforming vector. During the beam sweeping process, the receiver uses M different beamforming vectors, denoted by wicustom character1×NR for i=1, . . . , M, chosen from a designed codebook to combine analog signals received from NR antennas. Given combined signals, the receiver performs digital channel estimation. With Y∈custom characterM×K as the estimated digital channels and H=[h1, . . . , hK]∈custom characterNR×K as the actual analog channels, Y is modeled as in Equation (1):

Y=WH+N  (1)


where






W
=


[




w
1











w
M




]



𝒞

M
×

N
R









is the beamforming codebook and N∈custom characterM×K is the digital channel estimation error. As described herein,






N
=

[




n
1











n
M




]






and it is assumed that nmTcustom character(0, σ2I), for m=1, . . . , M, and that it satisfies Equation (2):

E[njHnk]=0, for 1≤j,k≤M and j≠k  (2)


Given Y and W, the receiver recovers the analog channel H. Based on the recovered analog channels, the receiver derives the optimal beamforming vector using the Eigen-based single-connection analog beamforming (ESAB) algorithm to improve hybrid beamforming gain, as described in U.S. patent application Ser. No. 16/256,328 entitled “System and Method for Analog Beamforming for Single-Connected Antenna Array,” the entire content of which is incorporated by reference herein. With fk being the frequency of the kth subcarrier, for k=1, . . . , K, channel hk is modelled by Equation (3):










h
k

=




l
=
1

L






i
=
1


R
l





α

l

i




e

j







li





e


-
j


2

π


f
k



τ
li





a


(

θ
li

)









(
3
)







The channel model in Equation (3) assumes that the channel at the kth subcarrier has L clusters and that the lth cluster contains Rl rays. Each ray is modelled using parameters angle of arrival (AoA) θli, path gain αli, phase shift Øli, and delay τli. Under the assumption of uniform linear array (ULA) with distance of half the wavelength, given θ, a(θ)∈custom characterNR is given by Equation (4):

a(θ)=[ejπ*0*cos θ, . . . ,ejπ*(NR−1)*cos θ]T  (4)



FIG. 1 illustrates a diagram 100 of a one-dimensional antenna array and an AoA being defined. FIG. 1 shows a one-dimensional antenna array 102 receiving a signal 104 having an AoA 106.


For Θ={θ1, . . . , θN} as a set of quantized values for AoAs, and the matrix A∈custom characterNR×N is defined as Equation (5):

A=[a(θ1), . . . ,a(θN)],  (5)


For n=1, . . . , N, the θn are defined as Equation (6):











x
¯

n

=


π


cos


(


θ
¯

n

)



=

π


(


-
1

+


2
N



(

n
-
1

)



)







(
6
)







Under the assumption that the channel is sparse in the angle domain, if the AoA is quantized finely enough, then it is possible to approximate H by H≈AS for some coefficient matrix S=[s1, . . . , sK]∈custom characterN×K satisfying Equation (7):

S∥0Lwith L<<N  (7)


where ∥S∥0 is the number of nonzero rows of S and L is some known parameter that determines the number of angles involved in channel approximation. Given L, the maximum likelihood (ML) estimator for H can be derived from Equation (8):











min
S






Y
-

Φ





S




F


;






s
.
t
.







S


0




L
¯






(
8
)







where, as in Equation (9):

Φ=[φ(x1), . . . ,φ(xN)]=WA,φ(xi)=Wa(xi), for i=1, . . . ,N  (9)


Under the l0 constraint, it is possible to approximate the channel using no more than L angles chosen from the quantized set. With S* being the solution to the above optimization problem, the channel H can be estimated as in Equation (10):

Ĥ=AS*  (10)


According to one embodiment, the present system and method includes using an partial identity codebook in a general case or uniform discrete Fourier transform (DFT) codebook if NR is integer multiples of M. The partial identity codebook includes the first M rows of an identity matrix of size NR×NR. Under such codebooks, the present system and method includes a closed-form simultaneous orthogonal matching pursuit (SOMP) method to reduce complexity.



FIG. 2 illustrates a block diagram 200 of a process where analog beamforming is performed, according to one embodiment. The system performs the beam sweeping process periodically to update its analog beam. Given the digital signals 202, the system performs digital channel estimation at 204 followed by analog channel recovery at 208 based on the estimated digital channels 206. Based on the estimated analog channels 210, the system generates the optimal beamforming vector at 212 using the Eigen-based single-connection analog beamforming (ESAB) algorithm to improve hybrid beamforming gain, and produces the optimal beamforming vector 214.



FIG. 3 illustrates a flowchart in a method for analog channel recovery, according to an embodiment. At 302, the system receives an input including digital channel information. The input may include estimated digital channel Y=[y1, . . . , yK]∈custom characterM×K, a codebook W∈custom characterM×NR and quantized values {x1, . . . , xN}.


At 304, the system selects a first basis according to the largest projection power of the measurement output. If M>2, the system selects the first basis φ(x1*) according to Equation (11):










x
1
*

=



argmax

x


{



x

_


1

,


,


x

_


N


}










φ

(
x
)

H


Y


Y
H



φ

(
x
)






φ

(
x
)



2


.






(
11
)







If M=2, the system selects the first basis φ(x1*) according to Equation (12):










x
1
*

=




argmax
x




Re


{


y
2



y
1
H



e


-
j


x



}


=



(


y
2



y
1
H


)






(
12
)







where y1 and y2 are the first and second row of Y.


At 306, the system determines the remaining bases based on the selected first basis to provide orthogonality. The system may determine the remaining bases φ(xi*) as in Equation (13):











x
i
*

=


x
1
*

+



2

π

M



(

i
-
1

)




,

i
=
2

,


,
M




(
13
)







At 308, the system determines the sparse coefficients based the selected first basis and the determined remaining bases. The sparse coefficients {tilde over (S)} may be determined as in Equation (14):










S
~

=


1




φ

(

x
1
*

)



2




Φ
X
H


Y





(
14
)







where, as in Equation (15):

ΦX=[φ(x1*), . . . ,φ(xM*)]∈custom characterM×M  (15)


At 310, the system recovers the analog channel based on the sparse coefficients, the selected first basis, and the determined remaining bases. The estimated channel on K subcarriers is given by Equation (16):

Ĥ=[ĥ1, . . . ,ĥK]=[a(x1*), . . . ,a(xM*)]{tilde over (S)}  (16)


In one embodiment, the present method is used to find a sparse solution to the optimization problem, where Y and Φ are given as in Equation (8).


In one embodiment, the present system and method are applicable to a beamforming codebook W that ensures a set of mutually orthogonal bases.


It holds that if beamforming codebook W satisfies Equation (17):











W
=


[


W
1







W
J


]



𝒞

M
×

N
R





,



W
i



𝒞

M
×
M



,



i
=
1

,


,

J
=


N
R

M








W
1



W
1
H


=


I

M
×
M




and







W
j

=


C
j



W
1



for


some


constant



C
j



,

j
=
1

,


,

J
=


N
R

M







(
17
)







the partial identify codebook for any M<NR satisfies the above condition. A uniform DFT codebook with







N
R

M





being the integer satisfies the above condition as well.


Given Equation (18):









Y
=


[


φ

(

x
1
*

)

,


,

φ

(

x
M
*

)


]

[




s
1











s
M




]





(
18
)







The present system may select M bases with M<M from {φ(x1*), . . . , φ(xM*)} by choosing those with M largest ∥si2. With i1, . . . , iM as selected indexes and








Φ

M

_



=

[


φ

(

x

i
1

*

)

,



,

φ

(

x

i

M

_



*

)


]


,





the estimated channel is given by Equation (19):

Ĥ=[a(xi1*), . . . ,a(xiM*)]{tilde over (S)}  (19)


where, as in Equation (20):










S
˜

=



(


Φ

M

_


H



Φ

M

_




)


-
1




Φ

M

_


H


Y





(
20
)







According to one embodiment, the present system and method for providing channel recovery for angle-domain sparse channels include receiving parameters including a measurement output and a beamforming codebook, selecting a first basis according to a largest projection power of the measurement output onto a set of bases, where each basis in the set corresponds to one quantized AoA value, generating the other remaining bases to ensure/enable orthogonality, determining sparse coefficients based on all selected bases, and recovering an analog channel based on the sparse coefficients and all selected bases.


The present system and method may be utilized with an partial identity codebook (i.e., first M rows of an identity matrix) and a uniform DFT codebook with an arbitrary offset x1, as in Equation (21):











W

D

F

T


=

[





a
H

(

x
1

)












a
H

(

x
M

)




]


,


x
i

=


x
1

+



2

π

M



(

i
-
1

)




,

i
=
2

,


,
M
,



x
1






(
21
)








FIG. 4 illustrates a flowchart 400 in a method for analog channel recovery, according to an embodiment. At 402, the system receives an input including digital channel information. The input may include estimated digital channel Y=[y1, . . . , yK]∈custom characterM×K, a codebook W∈ custom characterM×NR and quantized AoA values {x1, . . . , xN}.


At 404, the system selects a first basis according to the largest projection power of a measurement output. With Ĥ as an estimate derived from the closed form SOMP algorithm. Given {tilde over (x)}i, i=1, . . . , M, satisfying Equation (22):












x
~

i

=



x
˜

1

+



2

π

M



(

i
-
1

)




,

i
=
2

,


,
M




(
22
)







Ĥ can be written as Equation (23) and (24).











H
ˆ

=

[





H
ˆ

1












H
ˆ

J




]


,



H
^

i



𝒞

M
×
K



,

i
=
1

,


,

J
=


N
R

M






(
23
)















H
ˆ

i

=


e

j


M

(

i
-
1

)




x
~

1






H
ˆ

1



,

i
=
1

,


,

J
=


N
R

M






(
24
)







The dominant AoA {tilde over (x)}1 is given by Equation (25).












x
˜

1

=



argmax

x


{



x

_


1

,


,


x

_


N


}









φ

(
x
)

H


Y


Y
H



φ

(
x
)






φ

(
x
)



2




,




(
25
)







At 406, the system recovers a partial channel based on a beamforming codebook and estimated digital channels. To derive Ĥ, it is sufficient to know Ĥ1custom characterM×K. To derive Ĥ1, there is no need to explicitly calculate sparse coefficients {tilde over (S)} for both IDT and uniform DFT codebooks. Given W, Y and {tilde over (x)}1, . . . , {tilde over (x)}M, {tilde over (S)} is calculated from Equation (26).

{tilde over (S)}=(W[a({tilde over (x)}1), . . . ,a({tilde over (x)}M)])HY  (26)


Ĥ1 is estimated by Equation (27).

Ĥ1=[a1({tilde over (x)}1), . . . ,a1({tilde over (x)}M)]{tilde over (S)}  (27)


For the IDT codebook, Wi=0M×M, for i≥2. Therefore, if W satisfies the condition of Equation, (17), Equation (28) can be derived.











H
ˆ

1

=

M





i
=
1

J



e


-
j



M

(

i
-
1

)




x
~

1





C
j
*



W
1
H


Y







(
28
)







Since scaling parameters do not affect the analog beamforming performance, they can be ignored. Thus, the partial channel is given as Equation (29).

Ĥ1=W1HY  (29)


At 408, the system recovers the analog channel based on the recovered partial channel and the selected first basis. The analog channel can be given as Equation (30).











H
ˆ

=



[





H
ˆ

1












H
ˆ

J




]





,
H

ˆ

i


=


e

j


M

(

i
-
1

)




x
~

1






H
ˆ

1




,

i
=
1

,


,

J
=


N
R

M






(
30
)








FIG. 5 illustrates a block diagram of an electronic device 501 in a network environment 500, according to one embodiment. Referring to FIG. 5, the electronic device 501 in the network environment 500 may communicate with another electronic device 502 via a first network 598 (e.g., a short-range wireless communication network), or another electronic device 504 or a server 508 via a second network 599 (e.g., a long-range wireless communication network). The electronic device 501 may also communicate with the electronic device 504 via the server 508. The electronic device 501 may include a processor 520, a memory 530, an input device 550, a sound output device 555, a display device 560, an audio module 570, a sensor module 576, an interface 577, a haptic module 579, a camera module 580, a power management module 588, a battery 589, a communication module 590, a subscriber identification module (SIM) 596, or an antenna module 597. In one embodiment, at least one (e.g., the display device 560 or the camera module 580) of the components may be omitted from the electronic device 501, or one or more other components may be added to the electronic device 501. In one embodiment, some of the components may be implemented as a single integrated circuit (IC). For example, the sensor module 576 (e.g., a fingerprint sensor, an iris sensor, or an illuminance sensor) may be embedded in the display device 560 (e.g., a display).


The processor 520 may execute, for example, software (e.g., a program 540) to control at least one other component (e.g., a hardware or a software component) of the electronic device 501 coupled with the processor 520, and may perform various data processing or computations. As at least part of the data processing or computations, the processor 520 may load a command or data received from another component (e.g., the sensor module 576 or the communication module 590) in volatile memory 532, process the command or the data stored in the volatile memory 532, and store resulting data in non-volatile memory 534. The processor 520 may include a main processor 521 (e.g., a central processing unit (CPU) or an application processor (AP)), and an auxiliary processor 523 (e.g., a graphics processing unit (GPU); an image signal processor (ISP), a sensor hub processor, or a communication processor (CP)) that is operable independently from, or in conjunction with, the main processor 521. Additionally or alternatively, the auxiliary processor 523 may be adapted to consume less power than the main processor 521, or execute a particular function. The auxiliary processor 523 may be implemented as being separate from, or a part of, the main processor 521.


The auxiliary processor 523 may control at least some of the functions or states related to at least one component (e.g., the display device 560, the sensor module 576, or the communication module 590) among the components of the electronic device 501, instead of the main processor 521 while the main processor 521 is in an inactive (e.g., sleep) state, or together with the main processor 521 while the main processor 521 is in an active state (e.g., executing an application). According to one embodiment, the auxiliary processor 523 (e.g., an image signal processor or a communication processor) may be implemented as part of another component (e.g., the camera module 580 or the communication module 590) functionally related to the auxiliary processor 523.


The memory 530 may store various data used by at least one component (e.g., the processor 520 or the sensor module 576) of the electronic device 501. The various data may include, for example, software (e.g., the program 540) and input data or output data for a command related thereto. The memory 530 may include the volatile memory 532 or the non-volatile memory 534.


The program 540 may be stored in the memory 530 as software, and may include, for example, an operating system (OS) 542, middleware 544, or an application 546.


The input device 550 may receive a command or data to be used by other component (e.g., the processor 520) of the electronic device 501, from the outside (e.g., a user) of the electronic device 501. The input device 550 may include, for example, a microphone, a mouse, or a keyboard.


The sound output device 555 may output sound signals to the outside of the electronic device 501. The sound output device 555 may include, for example, a speaker or a receiver. The speaker may be used for general purposes, such as playing multimedia or recording, and the receiver may be used for receiving an incoming call. According to one embodiment, the receiver may be implemented as being separate from, or a part of, the speaker.


The display device 560 may visually provide information to the outside (e.g., a user) of the electronic device 501. The display device 560 may include, for example, a display, a hologram device, or a projector and control circuitry to control a corresponding one of the display, hologram device, and projector. According to one embodiment, the display device 560 may include touch circuitry adapted to detect a touch, or sensor circuitry (e.g., a pressure sensor) adapted to measure the intensity of force incurred by the touch.


The audio module 570 may convert a sound into an electrical signal and vice versa. According to one embodiment, the audio module 570 may obtain the sound via the input device 550, or output the sound via the sound output device 555 or a headphone of an external electronic device 502 directly (e.g., wired) or wirelessly coupled with the electronic device 501.


The sensor module 576 may detect an operational state (e.g., power or temperature) of the electronic device 501 or an environmental state (e.g., a state of a user) external to the electronic device 501, and then generate an electrical signal or data value corresponding to the detected state. The sensor module 576 may include, for example, a gesture sensor, a gyro sensor, an atmospheric pressure sensor, a magnetic sensor, an acceleration sensor, a grip sensor, a proximity sensor, a color sensor, an infrared (IR) sensor, a biometric sensor, a temperature sensor, a humidity sensor, or an illuminance sensor.


The interface 577 may support one or more specified protocols to be used for the electronic device 501 to be coupled with the external electronic device 502 directly (e.g., wired) or wirelessly. According to one embodiment, the interface 577 may include, for example, a high definition multimedia interface (HDMI), a universal serial bus (USB) interface, a secure digital (SD) card interface, or an audio interface.


A connecting terminal 578 may include a connector via which the electronic device 501 may be physically connected with the external electronic device 502. According to one embodiment, the connecting terminal 578 may include, for example, an HDMI connector, a USB connector, an SD card connector, or an audio connector (e.g., a headphone connector).


The haptic module 579 may convert an electrical signal into a mechanical stimulus (e.g., a vibration or a movement) or an electrical stimulus which may be recognized by a user via tactile sensation or kinesthetic sensation. According to one embodiment, the haptic module 579 may include, for example, a motor, a piezoelectric element, or an electrical stimulator.


The camera module 580 may capture a still image or moving images. According to one embodiment, the camera module 580 may include one or more lenses, image sensors, image signal processors, or flashes.


The power management module 588 may manage power supplied to the electronic device 501. The power management module 588 may be implemented as at least part of, for example, a power management integrated circuit (PMIC).


The battery 589 may supply power to at least one component of the electronic device 501. According to one embodiment, the battery 589 may include, for example, a primary cell which is not rechargeable, a secondary cell which is rechargeable, or a fuel cell.


The communication module 590 may support establishing a direct (e.g., wired) communication channel or a wireless communication channel between the electronic device 501 and the external electronic device (e.g., the electronic device 502, the electronic device 504, or the server 508) and performing communication via the established communication channel. The communication module 590 may include one or more communication processors that are operable independently from the processor 520 (e.g., the AP) and supports a direct (e.g., wired) communication or a wireless communication. According to one embodiment, the communication module 590 may include a wireless communication module 592 (e.g., a cellular communication module, a short-range wireless communication module, or a global navigation satellite system (GNSS) communication module) or a wired communication module 594 (e.g., a local area network (LAN) communication module or a power line communication (PLC) module). A corresponding one of these communication modules may communicate with the external electronic device via the first network 598 (e.g., a short-range communication network, such as Bluetooth™, wireless-fidelity (Wi-Fi) direct, or a standard of the Infrared Data Association (IrDA)) or the second network 599 (e.g., a long-range communication network, such as a cellular network, the Internet, or a computer network (e.g., LAN or wide area network (WAN)). These various types of communication modules may be implemented as a single component (e.g., a single IC), or may be implemented as multiple components (e.g., multiple ICs) that are separate from each other. The wireless communication module 592 may identify and authenticate the electronic device 501 in a communication network, such as the first network 598 or the second network 599, using subscriber information (e.g., international mobile subscriber identity (IMSI)) stored in the subscriber identification module 596.


The antenna module 597 may transmit or receive a signal or power to or from the outside (e.g., the external electronic device) of the electronic device 501. According to one embodiment, the antenna module 597 may include one or more antennas, and, therefrom, at least one antenna appropriate for a communication scheme used in the communication network, such as the first network 598 or the second network 599, may be selected, for example, by the communication module 590 (e.g., the wireless communication module 592). The signal or the power may then be transmitted or received between the communication module 590 and the external electronic device via the selected at least one antenna.


At least some of the above-described components may be mutually coupled and communicate signals (e.g., commands or data) therebetween via an inter-peripheral communication scheme (e.g., a bus, a general purpose input and output (GPIO), a serial peripheral interface (SPI), or a mobile industry processor interface (MIPI)).


According to one embodiment, commands or data may be transmitted or received between the electronic device 501 and the external electronic device 504 via the server 508 coupled with the second network 599. Each of the electronic devices 502 and 504 may be a device of a same type as, or a different type, from the electronic device 501. All or some of operations to be executed at the electronic device 501 may be executed at one or more of the external electronic devices 502, 504, or 508. For example, if the electronic device 501 should perform a function or a service automatically, or in response to a request from a user or another device, the electronic device 501, instead of, or in addition to, executing the function or the service, may request the one or more external electronic devices to perform at least part of the function or the service. The one or more external electronic devices receiving the request may perform the at least part of the function or the service requested, or an additional function or an additional service related to the request, and transfer an outcome of the performing to the electronic device 501. The electronic device 501 may provide the outcome, with or without further processing of the outcome, as at least part of a reply to the request. To that end, a cloud computing, distributed computing, or client-server computing technology may be used, for example.


One embodiment may be implemented as software (e.g., the program 540) including one or more instructions that are stored in a storage medium (e.g., internal memory 536 or external memory 538) that is readable by a machine (e.g., the electronic device 501). For example, a processor of the electronic device 501 may invoke at least one of the one or more instructions stored in the storage medium, and execute it, with or without using one or more other components under the control of the processor. Thus, a machine may be operated to perform at least one function according to the at least one instruction invoked. The one or more instructions may include code generated by a complier or code executable by an interpreter. A machine-readable storage medium may be provided in the form of a non-transitory storage medium. The term “non-transitory” indicates that the storage medium is a tangible device, and does not include a signal (e.g., an electromagnetic wave), but this term does not differentiate between where data is semi-permanently stored in the storage medium and where the data is temporarily stored in the storage medium.


According to one embodiment, a method of the disclosure may be included and provided in a computer program product. The computer program product may be traded as a product between a seller and a buyer. The computer program product may be distributed in the form of a machine-readable storage medium (e.g., a compact disc read only memory (CD-ROM)), or be distributed (e.g., downloaded or uploaded) online via an application store (e.g., Play Store™), or between two user devices (e.g., smart phones) directly. If distributed online, at least part of the computer program product may be temporarily generated or at least temporarily stored in the machine-readable storage medium, such as memory of the manufacturer's server, a server of the application store, or a relay server.


According to one embodiment, each component (e.g., a module or a program) of the above-described components may include a single entity or multiple entities. One or more of the above-described components may be omitted, or one or more other components may be added. Alternatively or additionally, a plurality of components (e.g., modules or programs) may be integrated into a single component. In this case, the integrated component may still perform one or more functions of each of the plurality of components in the same or similar manner as they are performed by a corresponding one of the plurality of components before the integration. Operations performed by the module, the program, or another component may be carried out sequentially, in parallel, repeatedly, or heuristically, or one or more of the operations may be executed in a different order or omitted, or one or more other operations may be added.


Although certain embodiments of the present disclosure have been described in the detailed description of the present disclosure, the present disclosure may be modified in various forms without departing from the scope of the present disclosure. Thus, the scope of the present disclosure shall not be determined merely based on the described embodiments, but rather determined based on the accompanying claims and equivalents thereto.

Claims
  • 1. A method, comprising: receiving an input including a measurement output of digital channel information, the digital channel information comprising an estimated digital channel, a beamforming codebook, and quantized angle of arrival (AoA) values;determining a set of bases, wherein each basis in the set of bases corresponds to a respective one of the quantized AoA values;parameterizing each basis by a corresponding quantized AoA value;determining bases based on the beamforming codebook and the estimated digital channel, wherein a first basis of the determined bases is selected from the set of bases;determining sparse coefficients based on the determined bases; andrecovering analog channels based on the sparse coefficients and the determined bases.
  • 2. The method of claim 1, wherein the first basis is selected according to a largest projection power of the measurement output onto the set of bases.
  • 3. The method of claim 2, wherein the first basis is selected based on the beamforming codebook and the estimated digital channel.
  • 4. The method of claim 2, wherein determining the bases further comprises determining remaining bases based on the selected first basis.
  • 5. The method of claim 4, wherein the remaining bases are determined to provide orthogonality.
  • 6. The method of claim 1, wherein recovering analog channels is performed utilizing a partial identity codebook or a uniform discrete Fourier transform (DFT) codebook.
  • 7. A system, comprising: a memory; anda processor configured to:receive an input including a measurement output of digital channel information, the digital channel information comprising an estimated digital channel, a beamforming codebook, and quantized angle of arrival (AoA) values;determine a set of bases, wherein each basis in the set of bases is corresponds to a respective one of the quantized AoA values;parameterize each basis by a corresponding quantized AoA value;determine bases based on the beamforming codebook and the estimated digital channel, wherein a first basis of the determined bases is selected from the set of bases;determining sparse coefficients based on the determined bases; andrecover analog channels based on the sparse coefficients and the determined bases.
  • 8. The system of claim 7, wherein the processor is further configured to select the first basis according to a largest projection power of the measurement output onto the set of bases.
  • 9. The system of claim 8, wherein the first basis is selected based on the beamforming codebook and the estimated digital channel.
  • 10. The system of claim 8, wherein the processor is further configured to determine bases channels by determining remaining bases based on the selected first basis.
  • 11. The system of claim 10, wherein the remaining bases are determined to provide orthogonality.
  • 12. The system of claim 7, wherein recovering analog channels is performed utilizing a partial identity codebook or a uniform discrete Fourier transform (DFT) codebook.
  • 13. A method for analog channel recovery, comprising: receiving an input including a measurement output of digital channel information, the digital channel information comprising an estimated digital channel, a beamforming codebook, and quantized angle of arrival (AoA) values;determining a set of bases, wherein each basis in the set of bases is corresponds to a respective one of the quantized AoA values;parameterizing each basis by a corresponding quantized AoA value;selecting a first basis, from the set of bases, according to a largest projection power of the measurement output onto the set of bases;determining remaining bases based on the selected first basis;determining sparse coefficients based on the selected first basis and the determined remaining bases; andrecovering analog channels based on the selected first basis and the determined remaining bases.
  • 14. A system for analog channel recovery, comprising: a memory; anda processor configured to:receive an input including a measurement output of digital channel information, the digital channel information comprising an estimated digital channel, a beamforming codebook, and quantized angle of arrival (AoA) values;determine a set of bases, wherein each basis in the set of bases is corresponds to a respective one of the quantized AoA values;parameterize each basis by a corresponding quantized AoA value;select a first basis, from the set of bases, according to a largest projection power of the measurement output on the set of bases;determine remaining bases based on the selected first basis;determine sparse coefficients based on the selected first basis and the determined remaining bases; andrecover analog channels based on the determined sparse coefficients, the selected first basis, and the determined remaining.
PRIORITY

This application is based on and claims priority under 35 U.S.C. § 119(e) to U.S. Provisional Patent Application filed on Aug. 27, 2019 in the United States Patent and Trademark Office and assigned Ser. No. 62/892,166, the entire contents of which are incorporated herein by reference.

US Referenced Citations (83)
Number Name Date Kind
7271747 Baraniuk Sep 2007 B2
7511643 Baraniuk Mar 2009 B2
7714781 Xia May 2010 B2
7953372 Ofek May 2011 B2
7977943 Marinelli Jul 2011 B2
8384515 Rachlin Feb 2013 B2
8761525 Singh Jun 2014 B2
9118797 Singh Aug 2015 B2
9122932 Bala Sep 2015 B2
9178590 Kuo Nov 2015 B2
9293130 Amini Mar 2016 B2
9559417 Schwarzwalder Jan 2017 B1
9633306 Liu Apr 2017 B2
9867192 Krzymien Jan 2018 B2
9948769 Emad Apr 2018 B2
10050695 Tsai Aug 2018 B1
10211524 Hozouri Feb 2019 B2
10250309 Truong Apr 2019 B2
10270509 Liu Apr 2019 B2
10270624 Lee Apr 2019 B2
10339235 Ciarlini Jul 2019 B1
10439994 Rhyu Oct 2019 B2
10484207 Lee Nov 2019 B2
10541838 Lee Jan 2020 B2
10680684 Cheng Jun 2020 B1
10705176 Mesecher Jul 2020 B2
10892810 Zhan Jan 2021 B2
10898125 Givon Jan 2021 B2
10958318 Hong Mar 2021 B2
11211994 Tang Dec 2021 B2
11374796 Tang Jun 2022 B2
20040196813 Ofek Oct 2004 A1
20040196834 Ofek Oct 2004 A1
20060094373 Hottinen May 2006 A1
20070027656 Baraniuk Feb 2007 A1
20080228446 Baraniuk Sep 2008 A1
20090058724 Xia Mar 2009 A1
20090239551 Woodsum Sep 2009 A1
20090256565 Marinelli Oct 2009 A1
20100066493 Rachlin Mar 2010 A1
20110222448 Ofek Sep 2011 A1
20120087430 Forenza Apr 2012 A1
20120259590 Ye Oct 2012 A1
20120314570 Forenza Dec 2012 A1
20130028341 Ayach Jan 2013 A1
20130163645 Kuo Jun 2013 A1
20140036790 Normando Feb 2014 A1
20140314167 Jeong et al. Oct 2014 A1
20140341048 Sajadieh Nov 2014 A1
20150030092 Krishnamurthy Jan 2015 A1
20150236774 Son Aug 2015 A1
20160072563 Lee et al. Mar 2016 A1
20160142186 Hong May 2016 A1
20160286037 Emad Sep 2016 A1
20170012810 Rakib Jan 2017 A1
20170019162 Jeong et al. Jan 2017 A1
20170099122 Hadani Apr 2017 A1
20170102445 Mesecher Apr 2017 A1
20170104611 Lee Apr 2017 A1
20170141936 Lee May 2017 A1
20170149594 Rakib May 2017 A1
20170149595 Rakib May 2017 A1
20170257230 Son et al. Sep 2017 A1
20170288710 Delfeld Oct 2017 A1
20170295001 Chen Oct 2017 A1
20170302341 Yu Oct 2017 A1
20180042028 Nam et al. Feb 2018 A1
20180122046 Singh May 2018 A1
20180206274 Cherian Jul 2018 A1
20180309509 Sheen Oct 2018 A1
20180310870 Givon Nov 2018 A1
20190115963 Zhu Apr 2019 A1
20190123948 Zhao Apr 2019 A1
20200162132 Cheng May 2020 A1
20200287600 Cheng Sep 2020 A1
20200358484 Lee Nov 2020 A1
20200358512 Zhan Nov 2020 A1
20200382346 Noureddine Dec 2020 A1
20210067232 Tang Mar 2021 A1
20210167996 Ratnam Jun 2021 A1
20210314056 Tang Oct 2021 A1
20210328653 Tang Oct 2021 A1
20220094419 Tang Mar 2022 A1
Foreign Referenced Citations (11)
Number Date Country
106972907 Jul 2017 CN
107493123 Dec 2017 CN
107733481 Feb 2018 CN
108282206 Jul 2018 CN
112019461 Dec 2020 CN
3297236 Mar 2018 EP
10-2018-0077983 Jul 2018 KR
WO-2016008516 Jan 2016 WO
WO-2017071618 May 2017 WO
WO-2018051900 Mar 2018 WO
WO-2018136254 Jul 2018 WO
Non-Patent Literature Citations (18)
Entry
S. Narayanan, S. K. Sahoo and A. Makur, “Greedy pursuits assisted basis pursuit for compressive sensing,” 2015 23rd European Signal Processing Conference (EUSIPCO), 2015, pp. 694-698, doi: 10.1109/EUSIPCQ.2015.7362472. (Year: 2015).
Wikipedia, “Least squares”, https://en.wikipedia.org/wiki/Least_squares, 2020, pp. 12.
Z. Zhang, Y. Xu, J. Yang, X. Li, and D. Zhang, “A survey of sparse representation: Algorithms and applications,” IEEE Access, vol. 3, pp. 490-530, May 2015.
S.G. Mallat and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Trans. Signal Process., vol. 41, No. 12, pp. 3397-3415, Dec. 1993.
Y.C. Pati et al., “Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition,” in Proc. 27th Annu. Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 1993, vol. 1, pp. 40-44.
D. Needell and J. A. Tropp, “CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,” Appl. Comput. Anal., vol. 26, No. 3, pp. 301-321, 2009.
W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing signal reconstruction,” IEEE Trans. Inf. Theory, vol. 55, No. 5, pp. 2230-2249, May 2.
Chen, S., Donoho, D.L., and Saunders, M.A. (1999) Atomic Decomposition by Basis Pursuit. SIAM J. Sci Comp., 20, 1, 33-61.
M. Figueiredo, R. Nowak, and S. Wright, “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,” IEEE J. Select. Topics Signal Process., 2007, pp. 12.
A. Fletcher and S. Rangan. Orthogonal matching pursuit from noisy random measurements: A new analysis. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, Advances in Neural Information Processing Systems 22, pp. 540-548. 2009.
M. Aharon et al., “K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Transactions on Signal Processing, vol. 54, No. 11, pp. 4311-4322, Nov. 2006.
J. A. Tropp, A. C. Gilbert, and M. J. Strauss, “Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit,” Signal Processing, vol. 86, pp. 572-588, Apr. 2006.
K. Rosenblum, L. Zelnik-Manor, and Y. C. Eldar. (Sep. 2010) Sensing matrix optimization for block-sparse decoding. arXiv:1009.1533v1, pp. 10.
G. Li et al., “On projection matrix optimization for compressive sensing systems,” IEEE Trans. Signal Process., vol. 61, No. 11, pp. 2887-2898, Jun. 2013.
J. Lee, G.-T. Gil, and Y. H. Lee, “Channel estimation via orthogonal matching pursuit for hybrid MIMO systems in millimeter wave communications,” IEEE Transactions on Communications, vol. 64, No. 6, pp. 2370-2386, Jun. 2016.
Y. Chi and R. Calderbank, “Knowledge-enhanced matching pursuit,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Vancouver, BC, Canada, May 2013, pp. 6576-6580.
C. Ekanadham, D. Tranchina, and E. P. Simoncelli, “Recovery of sparse translation-invariant signals with continuous basis pursuit,” IEEE Trans. Signal Process., vol. 59, No. 10, pp. 4735-4744, Oct. 2011.
Wipf, D. P., and Rao, B. D. An empirical Bayesian strategy for solving the simultaneous sparse approximation problem. IEEE Transactions on Signal Processing, vol. 55, No. 7 (2007), pp. 3704-3716.
Related Publications (1)
Number Date Country
20210067232 A1 Mar 2021 US
Provisional Applications (1)
Number Date Country
62892166 Aug 2019 US