Query：
学者姓名：陈平平
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
Mobile edge caching (MEC) has emerged as a promising and economical solution to complement conventional infrastructure caching. Nonetheless, the vulnerability of vehicle-to-vehicle (V2V) links causes connection loss and limits data exchange. On the other hand, the traditional content popularity-based request model would lead to lower cache hit ratios and increased content retrieval times. To tackle this issue, a novel scheme of MEC-assisted public vehicular network is proposed in this study, where the random linear network coding (RLNC) based caching strategy is applied to allow public vehicles to simultaneously obtain coded blocks from multiple vehicles and infrastructures on the move. Besides, a content request model that considers content popularity, historical interest, and social attributes is explored. A cost minimization problem is formulated under the proposed scheme, which is a highly non-trivial stochastic problem. To this end, the data volume of V2V offloading is obtained by a divide and conquer (DC) algorithm, and then the caching strategy is derived by a heuristic-based algorithm. Finally, extensive simulations show that the proposed content model can achieve a higher local offloading ratio and the proposed scheme has a much lower cost compared to the baselines.
Keyword ：
Content request model Content request model Mobile edge caching Mobile edge caching Public vehicular networks Public vehicular networks V2V offloading V2V offloading
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Xiaopei , Lin, Zhijian , Wu, Wenhao et al. Cost-Efficient and Preference-Aware Mobile Edge Caching in Public Vehicular Networks [J]. | MOBILE NETWORKS & APPLICATIONS , 2025 . |
| MLA | Chen, Xiaopei et al. "Cost-Efficient and Preference-Aware Mobile Edge Caching in Public Vehicular Networks" . | MOBILE NETWORKS & APPLICATIONS (2025) . |
| APA | Chen, Xiaopei , Lin, Zhijian , Wu, Wenhao , Chen, Feng , Chen, Pingping . Cost-Efficient and Preference-Aware Mobile Edge Caching in Public Vehicular Networks . | MOBILE NETWORKS & APPLICATIONS , 2025 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
传统的可重构智能表面辅助的空间调制(RIS-SM)通信系统利用接收天线的索引来传输额外的信息比特，因此该系统数据传输速率的提升是以增加接收机天线数为代价。为了提高RIS-SM系统的数据传输速率和能量效率，该文提出可重构智能表面辅助的联合空间和码索引调制(RIS-JSCIM)通信系统。该系统利用多元正交幅度调制(M-QAM)符号、空域的接收天线索引和码索引传输信息比特。天线索引和码索引传输的信息比特不需要消耗能量，因此RIS-JSCIM系统能够获得良好的能量效率。该文对比了RIS-JSCIM系统和其他系统的能量效率、系统复杂度和误码率性能。对比结果表明，所提RIS-JSCIM系统以增加一定复杂度为代价，能够获得相比于其他系统更优异的能量效率和误码率性能。
Keyword ：
可重构智能表面 可重构智能表面 多元正交振幅调制 多元正交振幅调制 扩频 扩频 码索引调制 码索引调制 空间调制 空间调制
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈平平 , 张云馨 , 杜伟庆 . 可重构智能表面辅助的联合空间和码索引调制通信系统 [J]. | 电子与信息学报 , 2025 , 47 (2) : 1-10 . |
| MLA | 陈平平 et al. "可重构智能表面辅助的联合空间和码索引调制通信系统" . | 电子与信息学报 47 . 2 (2025) : 1-10 . |
| APA | 陈平平 , 张云馨 , 杜伟庆 . 可重构智能表面辅助的联合空间和码索引调制通信系统 . | 电子与信息学报 , 2025 , 47 (2) , 1-10 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
With the rapid development of mobile networks and devices, real-time video transmission has become increasingly important worldwide. Constrained by the bandwidth limitations of single networks, extensive research has shifted towards video transmission in multi-network environments. However, differences in bandwidth and latency in heterogeneous networks (such as LTE and Wi-Fi) lead to high latency and packet loss issues, severely affecting video quality and user experience. This paper proposes a Forward Error Correction (FEC)-based Low-Delay Multipath Scheduling algorithm (LDMP-FEC). This algorithm combines the Gilbert model with a continuous Markov chain to adaptively adjust FEC redundancy, thereby enhancing data integrity. Through the FEC Recovery Priority Scheduling (FEC-RPS) algorithm, it dynamically optimizes the transmission order of data packets, reducing the number of out-of-order packets (OFO-packets) and end-to-end latency. Experimental results show that LDMP-FEC significantly reduces the number of out-of-order packets in heterogeneous network environments, improving performance by 50% compared to the round-robin and MinRtt algorithms, while maintaining end-to-end latency within 150 ms. Under various packet loss conditions, LDMP-FEC sustains a playable frame rate (PFR) above 90% and a Peak Signal-to-Noise Ratio (PSNR) exceeding 35 dB, providing an efficient and reliable solution for real-time video and other low-latency applications.
Keyword ：
FEC FEC heterogeneous networks heterogeneous networks multipath multipath OFO-packets OFO-packets round robin round robin video transmission video transmission
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Gao, Tingjin , Chen, Feng , Chen, Pingping . LDMP-FEC: A Real-Time Low-Latency Scheduling Algorithm for Video Transmission in Heterogeneous Networks [J]. | ELECTRONICS , 2025 , 14 (3) . |
| MLA | Gao, Tingjin et al. "LDMP-FEC: A Real-Time Low-Latency Scheduling Algorithm for Video Transmission in Heterogeneous Networks" . | ELECTRONICS 14 . 3 (2025) . |
| APA | Gao, Tingjin , Chen, Feng , Chen, Pingping . LDMP-FEC: A Real-Time Low-Latency Scheduling Algorithm for Video Transmission in Heterogeneous Networks . | ELECTRONICS , 2025 , 14 (3) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
As a new-generation video coding standard, Alliance for Open Media Video 1 (AV1) introduces flexible and diverse block partition types to improve coding efficiency, but also increases coding complexity. To address this issue, we propose a low-complexity AV1 intra prediction algorithm using Long-edge Sparse Sampling (LSS) and Chroma Migrating from Luma (CML) for efficiently encoding video sequences. First, we develop an LSS method by selecting key reference pixels based on block partition condition to reduce computational complexity. Second, we exploit a CML algorithm which combines the angle mode of the luma component and the spatial correlations of chroma components to derive more accurate linear model parameters between the luma and chroma components. Experimental results show that LSS avoids division operations, reducing 93% of addition operations. Combined with CML, our approach saves 4.97% time and enhances coding performance compared to standard AV1, particularly improving chroma component quality. © 2025
Keyword ：
Image coding Image coding NP-hard NP-hard Special effects Special effects Video streaming Video streaming
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Huang, Wanwei , Xie, Xuan , Chen, Yu et al. Low-complexity AV1 intra prediction algorithm [J]. | Journal of Visual Communication and Image Representation , 2025 , 110 . |
| MLA | Huang, Wanwei et al. "Low-complexity AV1 intra prediction algorithm" . | Journal of Visual Communication and Image Representation 110 (2025) . |
| APA | Huang, Wanwei , Xie, Xuan , Chen, Yu , Wang, Baotu , Chen, Jian , Chen, Pingping . Low-complexity AV1 intra prediction algorithm . | Journal of Visual Communication and Image Representation , 2025 , 110 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
在复杂自然场景的端到端文本识别中，由于文本和背景难以区分，文本检测的位置信息和识别的语义信息不匹配，无法有效利用检测和识别之间的相关性. 针对该问题，本文提出双域感知下多方显式信息协同的自然场景端到端文本识别方法（Multi-party Synergetic explicit Information with Dual-domain Awareness text spotting，MSIDA），通过强化文本区域特征和边缘纹理，利用文本检测和识别特征之间的协同作用提高端到端文本识别性能. 首先，设计融合文本空间和方向信息的双域感知模块（Dual-Domain Awareness，DDA），增强文本实例的视觉特征信息；其次，提出多方显式信息协同模块（Multi-party Explicit Information Synergy，MEIS）提取编码特征中的显式信息，通过匹配对齐用于检测和识别的位置、分类和字符多方信息生成候选文本实例；最后，协同特征通过解码器引导可学习的查询序列获得文本检测和识别的结果 . 相比最新的 DeepSolo（Decoder with explicit points Solo，DeepSolo）方法，在 Total-Text、ICDAR 2015 和 CTW1500 数据集上，MSIDA 模型的准确率分别提升 0.8%、0.8% 和 0.4%. 代码和数据集在 https：//github. com/msida2024/MSIDA. git可以获取.
Keyword ：
场景文本图像 场景文本图像 文本检测 文本检测 特征信息关联 特征信息关联 端到端文本识别 端到端文本识别 计算机视觉 计算机视觉
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈平平 , 林 虎 , 陈宏辉 et al. 双域感知下多方显式信息协同的 场景端到端文本识别 [J]. | 电子学报 , 2025 . |
| MLA | 陈平平 et al. "双域感知下多方显式信息协同的 场景端到端文本识别" . | 电子学报 (2025) . |
| APA | 陈平平 , 林 虎 , 陈宏辉 , 谢肇鹏 . 双域感知下多方显式信息协同的 场景端到端文本识别 . | 电子学报 , 2025 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Both massive multiple-input and multiple-output (MIMO) and physical-layer network coding (PNC) techniques can effectively improve the network throughput. However, for PNC-aided massive MIMO systems, the high-order modulations superimposed at the relay particularly bring computational burden and performance degradation to the signal detection. Thus, this letter proposes an iterative MIMO-PNC detector from double expectation propagation (DEP) as a high-accuracy solution in this large-scale system. By exploiting the PNC characteristic, the summation and difference (SD) information of the user pair messages are first linearly formed and iteratively updated between the DEP detector and the channel decoder. Simulation results show that the proposed iterative method can achieve significant performance gains of 2 dB in various massive MIMO systems, as compared to the non-iterative one and traditional linear minimum mean square error (LMMSE) detector.
Keyword ：
Iterative decoding Iterative decoding massive MIMO massive MIMO physical-layer network coding physical-layer network coding
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zeng, Hanxin , Xie, Zhaopeng , Chen, Pingping et al. Expectation Propagation Detection With Physical Network Coding for Massive MIMO Systems [J]. | IEEE SIGNAL PROCESSING LETTERS , 2024 , 31 : 41-45 . |
| MLA | Zeng, Hanxin et al. "Expectation Propagation Detection With Physical Network Coding for Massive MIMO Systems" . | IEEE SIGNAL PROCESSING LETTERS 31 (2024) : 41-45 . |
| APA | Zeng, Hanxin , Xie, Zhaopeng , Chen, Pingping , Fang, Yi . Expectation Propagation Detection With Physical Network Coding for Massive MIMO Systems . | IEEE SIGNAL PROCESSING LETTERS , 2024 , 31 , 41-45 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this article, we propose a polarization-aided polar coding scheme over nonorthogonal multiple access channels operated with physical-layer network coding (PN-NOMA), where $M$ users adopt polar coding for transmission. By exploiting the characteristic of physical-layer network coding and polar encoding, we found that the polar code at the users can be seen as nested codes and subcodeword of a larger polar code. It enables us to construct a single (virtual) polar code at the receiver, which has the length M times longer than that of the original user codes. In this way, we can decode all the user messages within this single polar code. The channel polarization effect as well as the decoding performance can be improved. We further propose a Monte Carlo-based code construction for the virtual polar code with user channel coefficients, and short nested user codes can be individually derived from this code. Simulation results show that the proposed PN-NOMA can achieve significant performance gains of more than 0.5 dB as compared to conventional polar-coded NOMA (PC-NOMA) over power-imbalanced channels, and this gain is more than 2 dB over Rayleigh fading channels.
Keyword ：
Channel coefficients Channel coefficients channel polarization effect channel polarization effect Codes Codes Decoding Decoding Encoding Encoding Gain Gain NOMA NOMA nonorthogonal multiple access (NOMA) nonorthogonal multiple access (NOMA) physical layer network coding physical layer network coding Polar codes Polar codes polar coding polar coding Receivers Receivers
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Xie, Zhaopeng , Chen, Pingping , Fang, Yi et al. Polarization-Aided Coding for Nonorthogonal Multiple Access [J]. | IEEE INTERNET OF THINGS JOURNAL , 2024 , 11 (17) : 27894-27903 . |
| MLA | Xie, Zhaopeng et al. "Polarization-Aided Coding for Nonorthogonal Multiple Access" . | IEEE INTERNET OF THINGS JOURNAL 11 . 17 (2024) : 27894-27903 . |
| APA | Xie, Zhaopeng , Chen, Pingping , Fang, Yi , Chen, Qiwang . Polarization-Aided Coding for Nonorthogonal Multiple Access . | IEEE INTERNET OF THINGS JOURNAL , 2024 , 11 (17) , 27894-27903 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In order to improve the success rate and reconstruction accuracy of the compressed sensing reconstruction algorithm, the Look Ahead and Regular Backtracking Orthogonal Matching Pursuit based on Dice coefficient (DLARBOMP) is proposed. In this algorithm, from the perspective of matching criteria and atom selection in the pre-selection stage, the Dice coefficient is used to replace the atomic inner product to calculate the correlation value and preserve the characteristics of the original signal, to select the atom that best matches the residual and improve the reconstruction accuracy. At the same time, to reduce backtracking time in the reconstruction process, regularization is used to select multiple atoms instead of a single atom in each iteration, achieving a balance between reconstruction accuracy and time. Finally, the experimental results of sparse one-dimensional signal and two-dimensional image signal reconstruction show that the proposed DLARBOMP algorithm considers both performance and efficiency when reconstructing one-dimensional signal, and enhances the Peak Signal-to-Noise Ratio (PSNR) when reconstructing two-dimensional compressed image signal, as compared to Orthogonal Matching Pursuit (OMP) and the state-of-the-art greedy algorithms. © 2024 Science Press. All rights reserved.
Keyword ：
Atoms Atoms Compressed sensing Compressed sensing Computerized tomography Computerized tomography Image enhancement Image enhancement Iterative methods Iterative methods Signal reconstruction Signal reconstruction Signal to noise ratio Signal to noise ratio
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Pingping , Chen, Jiahui , Wang, Xuanda et al. Regular Backtracking Fast Orthogonal Matching Pursuit Algorithm Based on Dice Coefficient Forward Prediction [J]. | Journal of Electronics and Information Technology , 2024 , 46 (4) : 1488-1498 . |
| MLA | Chen, Pingping et al. "Regular Backtracking Fast Orthogonal Matching Pursuit Algorithm Based on Dice Coefficient Forward Prediction" . | Journal of Electronics and Information Technology 46 . 4 (2024) : 1488-1498 . |
| APA | Chen, Pingping , Chen, Jiahui , Wang, Xuanda , Fang, Yi , Wang, Feng . Regular Backtracking Fast Orthogonal Matching Pursuit Algorithm Based on Dice Coefficient Forward Prediction . | Journal of Electronics and Information Technology , 2024 , 46 (4) , 1488-1498 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对车联网计算卸载需求量大及车辆网络拓扑变化随机性强的问题，本文提出一种基于邻域跟随的车辆多跳分簇方法，并采取多指标综合加权的方式研究其稳定性特征. 现有针对车辆分簇的研究方案普遍存在指标单一化、分簇机制局限于单跳或固定跳数、分簇效率低及缺少簇头替换机制等问题. 鉴于邻域跟随策略稳定性较优且分簇效率较高等特性，本文提出车辆基于邻居节点内综合指标最优准则选择稳定性最好的节点跟随方案，通过去环和剪枝算法使得车辆的跟随结构规范且扁平化，进而形成一个稳定性更高的车辆簇，并利用主从簇头和簇维护机制增强车辆簇的鲁棒性. 仿真结果表明，与现有的车辆分簇方法相比，所提算法在簇稳定性和分簇效率上均具有较好的性能.
Keyword ：
分簇效率 分簇效率 多跳分簇 多跳分簇 状态转移 状态转移 组网稳定性 组网稳定性 车联网 车联网 邻域跟随 邻域跟随
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 林志坚 , 吴文浩 , 陈小培 et al. 基于邻域跟随的车联网多跳分簇稳定性研究 [J]. | 电子学报 , 2024 . |
| MLA | 林志坚 et al. "基于邻域跟随的车联网多跳分簇稳定性研究" . | 电子学报 (2024) . |
| APA | 林志坚 , 吴文浩 , 陈小培 , 曾泽雄 , 林永航 , 陈平平 . 基于邻域跟随的车联网多跳分簇稳定性研究 . | 电子学报 , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In view of the problems of high demand of computation offloading in vehicular networks and the random⁃ ness of topology variation of vehicular networks, this paper proposes a vehicular multi-hop clustering scheme based on neighbor following and investigates its stability by multiple indicators. Existing research offers various vehicular clustering schemes, but they suffer from issues such as single indicator, being limited to a single hop or fixed number of hops, low clustering efficiency, and lacking a mechanism for cluster head replacement. As the neighbor following strategy has better stability and higher clustering efficiency, in the scheme designed in this paper, vehicles should follow the most stable vehi⁃ cle based on the comprehensive indicators within neighboring nodes. The de-ringing and pruning algorithms are used to standardize and flatten the following structure of vehicles, forming a more stable vehicular cluster. The master-slave cluster header and the cluster maintenance mechanism are employed to enhance the robustness of vehicular cluster. Simulation re⁃ sults show that the proposed algorithm outperforms existing methods in terms of cluster stability and clustering efficiency. © 2024 Chinese Institute of Electronics. All rights reserved.
Keyword ：
Clustering algorithms Clustering algorithms Efficiency Efficiency Stability Stability
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Zhi-Jian , Wu, Wen-Hao , Chen, Xiao-Pei et al. Research on the Stability of Multi-Hop Clustering Based on Neighbor Following Method in Vehicular Networks [J]. | Acta Electronica Sinica , 2024 , 52 (4) : 1260-1268 . |
| MLA | Lin, Zhi-Jian et al. "Research on the Stability of Multi-Hop Clustering Based on Neighbor Following Method in Vehicular Networks" . | Acta Electronica Sinica 52 . 4 (2024) : 1260-1268 . |
| APA | Lin, Zhi-Jian , Wu, Wen-Hao , Chen, Xiao-Pei , Zeng, Ze-Xiong , Lin, Yong-Hang , Chen, Ping-Ping . Research on the Stability of Multi-Hop Clustering Based on Neighbor Following Method in Vehicular Networks . | Acta Electronica Sinica , 2024 , 52 (4) , 1260-1268 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
