arXiv subjects

Kangqi Liu

Publications and source records attributed to Kangqi Liu.

14 recordsLinked to original sources

arXiv2024

A frequency shift compensation method for light shift and vapor-cell temperature shift in atomic clocks

Light shift and vapor-cell temperature shift are the two most significant factors dominating the long-term instability of compact atomic clocks. Due to the different physical mechanisms, there is not yet a solution that can effectively suppress the frequency shifts induced by these two effects. Here, we propose a 'resonance-offset' locking approach that compensates for the two physical frequency shifts. In this approach, the additional offset locking shift can effectively counteract the atomic resonance shifts arising from changes in vapor-cell temperature and light power, reducing the net impact on the clock's frequency to nearly zero. We have demonstrated this strategy on the 778 nm Rubidium two-photon optical frequency standard, successfully compensating for light shift and cell-temperature shift, respectively. This general method is particularly appealing for compact vapor-cell microwave and optical atomic clocks designed for the excellent stability rather than accuracy.

physics.atom-ph↗

arXiv2023

Dual-Interrogation Method for Suppressing Light Shift in Rb 778 nm Two-Photon Transition Optical Frequency Standard

In this study, a dual-interrogation (DI) method was used to suppress the light shift in the Rb 778 nm 5S1/2-5D5/2 two-photon transition (TPT) optical frequency standard. The approach used an auxiliary system to calibrate the light shift of the primary system in real time to mitigate the absolute light shift and suppress the sensitivity of the system to the optical power. Results show that after using the DI method, the absolute light shift and light-power sensitivity of the system were reduced by a factor of 10. The proposed method will improve the accuracy of the Rb 778 nm TPT optical frequency standard and increase the mid- and long-term stability. The method can also be applied to other vapor-cell atomic frequency standards that experience light shifts.

physics.optics↗

arXiv2023

Towards a compact soliton microcomb fully referenced on atomic reference

A fully stabilized soliton microcomb is critical for many applications of optical frequency comb based on microresonators. However, the current approaches for full frequency stabilization require either external acousto-optic or electro-optic devices or auxiliary lasers and multiple phase-locked loops, which compromises the convenience of the system. This study explores a compact atomic referenced fully stabilized soliton microcomb that directly uses a rubidium atomic optical frequency reference as the pump source, and complements the repetition rate (7.3 GHz) of the soliton microcomb was phase-locked to an atomic-clock-stabilized radio frequency (RF) reference by mechanically tuning the resonance of the optical resonator. The results demonstrate that the stability of the comb line (0.66 THz away from the pump line) is consistent with that of the Rb87 optical reference, attaining a level of approximately 4 Hz @100 s, corresponding to the frequency stability of 2E-14 @100 s. Furthermore,the frequency reproducibility of the comb line was evaluated over six days and it was discovered that the standard deviation (SD) of the frequency of the comb line is 10 kHz, resulting in a corresponding absolute deviation uncertainty of 1.3E-10, which is technically limited by the locking range of the soliton repetition rate. The proposed method gives a low-power and compact solution for fully stabilized soliton micorcombs.

physics.optics↗

arXiv2023

Soliton generation in CaF$_2$ crystalline whispering gallery mode resonators with negative thermal-optical effects

Calcium fluoride (CaF$_2$) crystalline whispering gallery mode resonators (WGMRs) exhibit ultrahigh intrinsic quality factors and a low power anomalous dispersion in the communication and mid-infrared bands, making them attractive platforms for microresonator-based comb generation. However, their unique negative thermo-optic effects pose challenges when achieving thermal equilibrium. To our knowledge, our experiments serve as the first demonstration of soliton microcombs in Q > 109 CaF$_2$ WGMRs. We observed soliton mode-locking and bidirectional switching of soliton numbers caused by the negative thermo-optic effects. Additionally, various soliton formation dynamics are shown, including breathing and vibrational solitons, which can be attributed to thermo-photomechanical oscillations. Thus, our results enrich the soliton generation platform and provide a reference for generating solitons from WGMRs that comprise other materials with negative thermo-optic effects. In the future, the ultrahigh quality factor of CaF$_2$ crystal cavities may enable the generation of sub-milliwatt-level broad-spectrum soliton combs.

physics.optics↗

arXiv2018

Exploiting Tradeoff Between Transmission Diversity and Content Diversity in Multi-Cell Edge Caching

Caching in multi-cell networks faces a well-known dilemma, i.e., to cache same contents among multiple edge nodes (ENs) to enable transmission cooperation/diversity for higher transmission efficiency, or to cache different contents to enable content diversity for higher cache hit rate. In this work, we introduce a partition-based caching to exploit the tradeoff between transmission diversity and content diversity in a multi-cell edge caching networks with single user only. The performance is characterized by the system average outage probability, which can be viewed as the sum of the cache hit outage probability and cache miss probability. We show that (i) In the low signal-to-noise ratio(SNR) region, the ENs are encouraged to cache more fractions of the most popular files so as to better exploit the transmission diversity for the most popular content; (ii) In the high SNR region, the ENs are encouraged to cache more files with less fractions of each so as to better exploit the content diversity.

cs.IT↗

arXiv2017

Fundamental Tradeoff between Storage and Latency in Cache-Aided Wireless Interference Networks

This paper studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by an information-theoretic metric, \emph{normalized delivery time} (NDT), which is the worst-case delivery time of the actual traffic load at a transmission rate specified by degrees of freedom (DoF) of a given channel. We obtain both an achievable upper bound and a theoretical lower bound of the minimum NDT for any number of transmitters, any number of receivers, and any feasible cache size tuple. We show that the achievable NDT is exactly optimal in certain cache size regions, and is within a bounded multiplicative gap to the theoretical lower bound in other regions. In the achievability analysis, we first propose a novel cooperative transmitter/receiver coded caching strategy. It offers the freedom to adjust file splitting ratios for NDT minimization. We then propose a delivery strategy which transforms the considered interference network into a new class of cooperative X-multicast channels. It leverages local caching gain, coded multicasting gain, and transmitter cooperation gain (via interference alignment and interference neutralization) opportunistically. Finally, the achievable NDT is obtained by solving a linear programming problem. This study reveals that with caching at both transmitter and receiver sides, the network can benefit simultaneously from traffic load reduction and transmission rate enhancement, thereby effectively reducing the content delivery latency.

cs.IT↗

arXiv2017

Fundamental Storage-Latency Tradeoff in Cache-Aided MIMO Interference Networks

Caching is an effective technique to improve user perceived experience for content delivery in wireless networks. Wireless caching differs from traditional web caching in that it can exploit the broadcast nature of wireless medium and hence opportunistically change the network topologies. This paper studies a cache-aided MIMO interference network with 3 transmitters each equipped with M antennas and 3 receivers each with N antennas. With caching at both the transmitter and receiver sides, the network is changed to hybrid forms of MIMO broadcast channel, MIMO X channel, and MIMO multicast channels. We analyze the degrees of freedom (DoF) of these new channel models using practical interference management schemes. Based on the collective use of these DoF results, we then obtain an achievable normalized delivery time (NDT) of the network, an information-theoretic metric that evaluates the worst-case delivery time at given cache sizes. The obtained NDT is for arbitrary M, N and any feasible cache sizes. It is shown to be optimal in certain cases and within a multiplicative gap of 3 from the optimum in other cases. The extension to the network with arbitrary number of transmitters and receivers is also discussed.

cs.IT↗

arXiv2016

Optimal Degrees of Freedom Region for the Asymmetric MIMO Y Channel

This letter studies the optimal degrees of freedom (DoF) region for the asymmetric three-user MIMO Y channel with antenna configuration $(M_1,M_2,M_3,N)$, where $M_i$ is the number of antennas at user $i$ and $N$ is the number of antennas at the relay node. The converse is proved by using the cut-set theorem and the genie-message approach. To prove the achievability, we divide the DoF tuples in the outer bound into two cases. For each case, we show that the DoF tuples are achievable by collectively utilizing antenna deactivation, pairwise signal alignment and cyclic signal alignment techniques. This work not only offers a complete characterization of DoF region for the considered channel model, but also provides a new and elegant achievability proof.

cs.IT↗

arXiv2016

Cooperative Tx/Rx Caching in Interference Channels: A Storage-Latency Tradeoff Study

This paper studies the storage-latency tradeoff in the $3\times3$ wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by the so-called fractional delivery time (FDT) at given normalized transmitter and receiver cache sizes. We first propose a generic cooperative transmitter/receiver caching strategy with adjustable file splitting ratios. Based on this caching strategy, we then design the delivery phase carefully to turn the considered interference channel opportunistically into broadcast channel, multicast channel, X channel, or a hybrid form of these channels. After that, we obtain an achievable upper bound of the minimum FDT by solving a linear programming problem of the file splitting ratios. The achievable FDT is a convex and piece-wise linear decreasing function of the cache sizes. Receiver local caching gain, coded multicasting gain, and transmitter cooperation gain (interference alignment and interference neutralization) are leveraged in different cache size regions.

cs.IT↗

arXiv2016

Optimal DoF Region for the Asymmetric Two-Pair MIMO Two-Way Relay Channel

In this paper, we study the optimal degrees of freedom (DoF) region for the two-pair MIMO two-way relay channel (TWRC) with asymmetric antenna setting, where two pairs of users exchange information with the help of a common relay. Each user $i$ is equipped with $M_i$ antennas, for $i=1,2,3,4$, and the relay is equipped with $N$ antennas. First, we derive an outer bound of the DoF region by using the cut-set theorem and the genie-message approach. Then, we propose a new transmission scheme to achieve the outer bound of the DoF region. Due to the asymmetric data exchange, where the two users in each pair can communicate a different number of data streams, we not only need to form the network-coded symbols but also need to process the additional asymmetric data streams at the relay. This is realized through the joint design of relay compression matrix and source precoding matrices. After obtaining the optimal DoF region, we study the optimal sum DoF by solving a linear programming problem. From the optimal DoF region of this channel, we show that in the asymmetric antenna setting, some antennas at certain source nodes are redundant and cannot contribute to enlarge the DoF region. We also show that there is no loss of optimality in terms of the sum DoF by enforcing symmetric data exchange, where the two users in each pair are restricted to communicate the same number of data streams.

cs.IT↗

arXiv2015

Generalized Signal Alignment: On the Achievable DoF for Multi-User MIMO Two-Way Relay Channels

This paper studies the achievable degrees of freedom for multi-user MIMO two-way relay channels, where there are $K$ source nodes, each equipped with $M$ antennas, one relay node, equipped with $N$ antennas, and each source node exchanges independent messages with an arbitrary set of other source nodes via the relay. By allowing an arbitrary information exchange pattern, the considered channel model is a unified one. It includes several existing channel models as special cases: $K$-user MIMO Y channel, multi-pair MIMO two-way relay channel, generalized MIMO two-way X relay channel, and $L$-cluster MIMO multiway relay channel. Previous studies mainly considered the achievability of the DoF cut-set bound $2N$ at the antenna configuration $N < 2M$ by applying signal alignment. This work aims to investigate the achievability of the DoF cut-set bound $KM$ for the case $N\geq 2M$. To this end, we first derive tighter DoF upper bounds for three special cases of the considered channel model. Then, we propose a new transmission framework, generalized signal alignment, to approach these bounds. The notion of GSA is to form network-coded symbols by aligning every pair of signals to be exchanged in a compressed subspace at the relay. A necessary and sufficient condition to construct the relay compression matrix is given. We show that using GSA, the new DoF upper bound is achievable when i) $\frac{N}{M} \in \big(0, 2+\frac{4}{K(K-1)}\big] \cup \big[K-2, +\infty\big)$ for the $K$-user MIMO Y channel; ii) $\frac{N}{M} \in \big(0, 2+\frac{4}{K}\big] \cup \big[K-2, +\infty\big)$ for the multi-pair MIMO two-way relay channel; iii) $\frac{N}{M} \in \big(0, 2+\frac{8}{K^2}\big] \cup \big[K-2, +\infty\big)$ for the generalized MIMO two-way X relay channel. We also provide the antenna configuration regions for the general multi-user MIMO two-way relay channel to achieve the total DoF $KM$.

cs.IT↗

arXiv2014

A New DoF Upper Bound and Its Achievability for $K$-User MIMO Y Channels

This work is to study the degrees of freedom (DoF) for the $K$-user MIMO Y channel. Previously, two transmission frameworks have been proposed for the DoF analysis when $N \geq 2M$, where $M$ and $N$ denote the number of antennas at each source node and the relay node respectively. The first method is named as signal group based alignment proposed by Hua et al. in [1]. The second is named as signal pattern approach introduced by Wang et al. in [2]. But both of them only studied certain antenna configurations. The maximum achievable DoF in the general case still remains unknown. In this work, we first derive a new upper bound of the DoF using the genie-aided approach. Then, we propose a more general transmission framework, generalized signal alignment (GSA), and show that the previous two methods are both special cases of GSA. With GSA, we prove that the new DoF upper bound is achievable when $\frac{N}{M} \in \left(0,2+\frac{4}{K(K-1)}\right] \cup \left[K-2, +\infty\right)$. The DoF analysis in this paper provides a major step forward towards the fundamental capacity limit of the $K$-user MIMO Y channel. It also offers a new approach of integrating interference alignment with physical layer network coding.

cs.IT↗

arXiv2014

Generalized Signal Alignment For Arbitrary MIMO Two-Way Relay Channels

In this paper, we consider the arbitrary MIMO two-way relay channels, where there are $K$ source nodes, each equipped with $M_i$ antennas, for $i=1,2,\cdots,K$, and one relay node, equipped with $N$ antennas. Each source node can exchange independent messages with arbitrary other source nodes assisted by the relay. We extend our newly-proposed transmission scheme, generalized signal alignment (GSA) in [1], to arbitrary MIMO two-way relay channels when $N>M_i+M_j$, $\forall i \neq j$. The key idea of GSA is to cancel the interference for each data pair in its specific subspace by two steps. This is realized by jointly designing the precoding matrices at all source nodes and the processing matrix at the relay node. Moreover, the aligned subspaces are orthogonal to each other. By applying the GSA, we show that a necessary condition on the antenna configuration to achieve the DoF upper bound $\min \{\sum_{i=1}^K M_i, 2\sum_{i=2}^K M_i,2N\}$ is $N \geq \max\{\sum_{i=1}^K M_i-M_s-M_t+d_{s,t}\mid \forall s,t\}$. Here, $d_{s,t}$ denotes the DoF of the message exchanged between source node $s$ and $t$. In the special case when the arbitrary MIMO two-way relay channel reduces to the $K$-user MIMO Y channel, we show that our achievable region of DoF upper bound is larger than the previous work.

cs.IT↗

arXiv2014

Generalized Signal Alignment For MIMO Two-Way X Relay Channels

We study the degrees of freedom (DoF) of MIMO two-way X relay channels. Previous work studied the case $N < 2M$, where $N$ and $M$ denote the number of antennas at the relay and each source, respectively, and showed that the maximum DoF of $2N$ is achievable when $N \leq \lfloor\frac{8M}{5}\rfloor$ by applying signal alignment (SA) for network coding and interference cancelation. This work considers the case $N>2M$ where the performance is limited by the number of antennas at each source node and conventional SA is not feasible. We propose a \textit{generalized signal alignment} (GSA) based transmission scheme. The key is to let the signals to be exchanged between every source node align in a transformed subspace, rather than the direct subspace, at the relay so as to form network-coded signals. This is realized by jointly designing the precoding matrices at all source nodes and the processing matrix at the relay. Moreover, the aligned subspaces are orthogonal to each other. By applying the GSA, we show that the DoF upper bound $4M$ is achievable when $M \leq \lfloor\frac{2N}{5}\rfloor$ ($M$ is even) or $M \leq \lfloor\frac{2N-1}{5}\rfloor$ ($M$ is odd). Numerical results also demonstrate that our proposed transmission scheme is feasible and effective.

cs.IT↗