Feixiang Luo

Feixiang Luo

Auto-generated profile, based on publicly available information

Feixiang Luo

School of Electronic and Information Engineering, Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2022 in IEEE Antennas and Wireless Propagation Letters
Verified
Journal Article
Closed access
KXKuiwen Xu
Kuiwen Xu
QWQuan Wang
Quan Wang
LLLihui Lv
Lihui Lv
QZQingfeng Zhang
Qingfeng Zhang
SSSheng Sun
Sheng Sun
GWGaofeng Wang
Gaofeng Wang
A high-scanning rate leaky-wave antenna (LWA) working at Ka -band with continuous backward-to-forward beam-scanning capability, good open stopband (OSB) suppression and wide scanning angle is exhibited. The proposed LWA is made by etching an array of cascaded high-Q resonators and open discontinuities on the substrate integrated waveguide (SIW). The resonator is designed by combining two symmetrically unbalance split ring resonators (USRRs) on the top surface of the SIW. The LWA's working mechanics were thoroughly investigated through band structure theory. An in-depth interpretation of the LWA's characteristics is provided by studying the surface current distribution and the equivalent circuit model of the resonator structure. The LWA's OSB is effectively alleviated by properly selecting the length of the radiation slot. Yet, the antenna scanning rate is directly improved by the oscillation quality of the resonators (i.e., USRRs), which is realized by tuning the split gap of the USRR. In the experiments, a prototype of the proposed LWA was fabricated and measured. The simulated and measured data show good agreement in terms of the antenna's scanning range and radiation gain. The measured results indicates that a continuous beam scanning from −56° to +48° is rendered over the frequency band from 32 to 36 GHz, which implies a spectral scanning rate of 8.84° per percentage. Finally, it is shown that the average gain can reach up to 9.1 dBi.

9 August 2021 in IEEE Transactions on Antennas and Propagation
Verified
Journal Article
Closed access
FLFeixiang Luo
Feixiang Luo
JWJun Wang
Jun Wang
JZJie Zeng
Jie Zeng
LZLu Zhang
Lu Zhang
BZBoyu Zhang
Boyu Zhang
XLXiling Luo
Xiling Luo
The phaseless-data inverse scattering problems (PD-ISPs) are non-trivial due to their serious nonlinearity and ill-posed nature. The conventional methods for PD-ISPs can be categorized into single-step methods and two-step methods, where the first ones directly reconstruct the image and the second ones retrieve the phase and amplitude of scattered fields, and then reconstruct the image as the traditional FD-ISPs. However, the single-step methods correspond to solve higher nonlinear optimization problems and the two-step methods highly depend on the quality of the retrieved phase and amplitude information. To solve the above issues, we propose a two-step method with a cascaded complex U-net (CCU-net) model to solve the PD-ISPs in the complex domain. The CCU-net consists of two parts, that is, Phase Retrieval Net (PRNet) and Image Reconstruction Net (IRNet), where the PRNet recovers the phase and amplitude of the scattered field from the measured modulus of the total field and the IRNet takes the recovered scattered field as input to reconstruct the image. These two parts can be independently controlled and achieve joint optimization. Thanks to the strong nonlinear representation ability of complex neural networks, the physical relationship between the scattered fields and the images can be reserved and constructed. Several representative tests including both the synthetic and experimental examples verify that the proposed CCU-net in the complex domain has good robustness, generalization ability, and strong inversion capability when tackling high contrast scatterers and can also fulfill one-step implementation in real time.

17 July 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ZZZequan Zhou
Zequan Zhou
XLXiling Luo
Xiling Luo
YWYupeng Wang
Yupeng Wang
JMJian Mao
Jian Mao
FLFeixiang Luo
Feixiang Luo
FZFeng Zeng
Feng Zeng
In vehicular cloud computing (VCC), cloud servers provide enormous storage and powerful computing capacity to Vehicular Ad-hoc Networks (VANETs). Resource-constrained vehicles outsource data to vehicular cloud platforms for timely traffic safety services, e.g., navigation, accident alarms, etc. Auditing the authenticity of data has become a critical issue in outsourcing data to untrusted servers. Existing data audit methods encode all data with error correction codes (ECC) techniques that retrieve corrupted data by downloading all data. The communication overhead of such methods is $O(n)$ ( $n$ is the number of data blocks) which is unbearable for vehicles with limited resources. In addition, these schemes employ an inaccurate privacy-preserving model. This will lead to data leakage in the third-party audit process. Although they use randomness to confuse parts of the proof that is used to prove the data state, a small amount of information is still distinguishable. For such, in this paper, we propose a practical data audit scheme with retrievability and indistinguishable privacy-preserving to efficiently audit the state of outsourced data. We improve the Invertible Bloom Filter (IBF) to compress redundancy locally, which can retrieve corrupted data without prior context. Furthermore, we define an indistinguishable privacy-preserving model to capture the complete semantics of repeated audit attacks and achieve indistinguishability in the audit. We prove that our scheme is secure against adaptive chosen message attacks and is indistinguishable privacy-preserving against repeated audit attacks. The experiment results demonstrate that for 1.9GB data when $\sqrt[]{n}$ blocks are corrupted, auditors complete a check in 3.31 seconds with 99% confidence, and vehicles retrieve corrupted data in 3.16 seconds with 16.67MB communication overhead.