期刊文献+
共找到1,246篇文章
< 1 2 63 >
每页显示 20 50 100
TLS Blind Recognition Algorithm of LDPC Codes 认领 引用
1
作者 Ning Xiaoyan Sun Jingjing +1 位作者 Wang Zhenduo Sun Zhiguo 《China Communications》 SCIE EI CSCD 2026年第2期112-121,共10页
Blind recognition of low-density paritycheck(LDPC)codes has gradually attracted more attention with the development of military and civil communications.However,in the case of the paritycheck matrices with relatively ... Blind recognition of low-density paritycheck(LDPC)codes has gradually attracted more attention with the development of military and civil communications.However,in the case of the paritycheck matrices with relatively high row weights,the existing blind recognition algorithms based on a candidate set generally perform worse.In this paper,we propose a blind recognition method for LDPC codes,called as tangent function assisted least square(TLS)method,which improves recognition performances by constructing a new cost function.To characterize the constraint degree among received vectors and paritycheck vectors,a feature function based on tangent function is constructed in the proposed algorithm.A cost function based on least square method is also established according to the feature function values satisfying the parity-check relationship.Moreover,the minimum average value in TLS is obtained on the candidate set.Numerical analysis and simulation results show that recognition performances of TLS algorithm are consistent with theoretical results.Compared with existing algorithms,the proposed method possesses better recognition performances. 展开更多
关键词 blind recognition cost function least square low-density parity-check(LDPC)codes
暂未订购 下载PDF
Performances of Chaos Coded Modulation Schemes Based on Mod-MAP Mapping and High Dimensional LDPC Based Mod-MAP Mapping with Belief Propagation 认领 引用
2
作者 Naim Khodor Jean-pierre Cances +1 位作者 Vahid Meghdadi Raymond Quere 《International Journal of Communications, Network and System Sciences》 2010年第6期495-506,共12页
In this paper, we propose to generalize the coding schemes first proposed by Kozic &amp;amp;amp;al to high spectral efficient modulation schemes. We study at first Chaos Coded Modulation based on the use of small ... In this paper, we propose to generalize the coding schemes first proposed by Kozic &amp;amp;amp;al to high spectral efficient modulation schemes. We study at first Chaos Coded Modulation based on the use of small dimensional modulo-MAP encoding process and we give a solution to study the distance spectrum of such coding schemes to accurately predict their performances. However, the obtained performances are quite poor. To improve them, we use then a high dimensional modulo-MAP mapping process similar to the low-density generator-matrix codes (LDGM) introduced by Kozic &amp;amp;amp;al. The main difference with their work is that we use an encoding and decoding process on GF (2m) which enables to obtain better performances while preserving a quite simple decoding algorithm when we use the Extended Min-Sum (EMS) algorithm of Declercq &amp;amp;amp;Fossorier. 展开更多
关键词 Chaos Coded Modulation Expectation Maximization Gaussian or Rayleigh Mixtures Low-Density Parity-Check (LDPC) Low-Density Generator-Matrix (LDGM) Factor Graph Extended Min-Sum (EMS)
暂未订购 下载PDF
Construction of Rate-Compatible(RC) Low-Density Parity-Check(LDPC) Convolutional Codes Based on RC-LDPC Block Codes 认领 引用 被引量:1
3
作者 穆丽伟 韩国军 刘志勇 《Journal of Shanghai Jiaotong university(Science)》 EI 2016年第6期679-683,共5页
In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are de... In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are derived by permuting the matrices of the corresponding RC-LDPC block codes,are systematic and have maximum encoding memory.Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation(BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels(BI-AWGNCs). 展开更多
关键词 rate-compatible(RC) low-density parity-check(LDPC) convolutional codes systematic maximum encoding memory belief propagation(BP) decoding
暂未订购 下载PDF
Parity-check and G-matrix based intelligent early stopping criterion for belief propagation decoder for polar codes 认领 引用
4
作者 Qasim Jan Shahid Hussain +4 位作者 Zhiwen Pan Nan Liu Zakir Ali Zechen Liu Xiaohu You 《Digital Communications and Networks》 SCIE CSCD 2023年第5期1148-1156,共9页
The error correction performance of Belief Propagation(BP)decoding for polar codes is satisfactory compared with the Successive Cancellation(SC)decoding.Nevertheless,it has to complete a fixed number of iterations,whi... The error correction performance of Belief Propagation(BP)decoding for polar codes is satisfactory compared with the Successive Cancellation(SC)decoding.Nevertheless,it has to complete a fixed number of iterations,which results in high computational complexity.This necessitates an intelligent identification of successful BP decoding for early termination of the decoding process to avoid unnecessary iterations and minimize the computational complexity of BP decoding.This paper proposes a hybrid technique that combines the“paritycheck”with the“G-matrix”to reduce the computational complexity of BP decoder for polar codes.The proposed hybrid technique takes advantage of the parity-check to intelligently identify the valid codeword at an early stage and terminate the BP decoding process,which minimizes the overhead of the G-matrix and reduces the computational complexity of BP decoding.We explore a detailed mechanism incorporating the parity bits as outer code and prove that the proposed hybrid technique minimizes the computational complexity while preserving the BP error correction performance.Moreover,mathematical formulation for the proposed hybrid technique that minimizes the computation cost of the G-matrix is elaborated.The performance of the proposed hybrid technique is validated by comparing it with the state-of-the-art early stopping criteria for BP decoding.Simulation results show that the proposed hybrid technique reduces the iterations by about 90%of BP decoding in a high Signal-to-Noise Ratio(SNR)(i.e.,3.5~4 dB),and approaches the error correction performance of G-matrix and conventional BP decoder for polar codes. 展开更多
关键词 Belief propagation Early termination G-matrix Parity-check Polar codes
暂未订购 下载PDF
Three dimensional particles identification and shape parameters research on coarse aggregates of asphalt mixture using X-ray CT images 认领 引用
5
作者 段跃华 张肖宁 +1 位作者 张顺先 苑苗苗 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2011年第5期103-107,共5页
In this paper a series of digital image processing methods were adopted for getting separated coarse aggregates from asphalt mixture specimen using high-resolution X-ray Computed Tomography (CT) images.The existing th... In this paper a series of digital image processing methods were adopted for getting separated coarse aggregates from asphalt mixture specimen using high-resolution X-ray Computed Tomography (CT) images.The existing three dimensional (3D) particles matching methods based on two dimensional (2D) continuous cross-sections were analyzed and a new 'overlap area method' was presented.After the 3D particles were extracted one by one successfully,the basic parameters of each aggregate:perimeter,area,surface area,and volume were calculated by chain code method.Finally,the 3D mass center coordinates and the sphericity index were introduced. 展开更多
关键词 asphalt mixture X-ray CT three dimensional matching chain code sphericity
暂未订购 下载PDF
LOW-DIMENSIONAL STRUCTURES:SP ARSE CODING FOR NEURONAL ACTIVITY 认领 引用
6
作者 YUNHUA XU WENWEN BAI XIN TIAN 《Journal of Innovative Optical Health Sciences》 SCIE EI 2013年第1期44-52,共9页
Neuronal ensemble activity codes working memory.In this work,we developed a neuronal ensemble sparse coding method,which can effectively reduce the dimension of the neuronal activity and express neural coding.Multicha... Neuronal ensemble activity codes working memory.In this work,we developed a neuronal ensemble sparse coding method,which can effectively reduce the dimension of the neuronal activity and express neural coding.Multichannel spike trains were recorded in rat prefrontal cortex during a work memory task in Y-maze.As discretesignals,spikes were transferred into cont inuous signals by estinating entropy.Then the normalized continuous signals were decomposed via non-negative sparse met hod.The non-negative components were extracted to reconstruct a low-dimensional ensemble,while none of the feature components were missed.The results showed that,for well-trained rats,neuronal ensemble activities in the prefrontal cortex changed dynamically during the.working memory task.And the neuronal ensemble is more explicit via using non-negative sparse coding.Our results indicate that the neuronal ensemblesparse coding method can effectively reduce the dimnension of neuronal activity and it is a useful tool to express neural coding. 展开更多
关键词 Low dimensional structures sparse coding neuronal ensemble activity working memory rat
暂未订购 下载PDF
A three-dimensional model for the transportation of Fe and Mn in Arha Reservoir 认领 引用
7
作者 Xiao-hong, C. Brimicombe, A.J. 《Journal of Environmental Sciences》 SCIE EI CAS 2000年第2期36-46,共11页
Coupling with a three dimensional (3D) hydrodynamic model and a suspended solids model, a 3D model for the transport of Fe and Mn in Arha Reservoir, China, was developed. The 3D velocity fields for the flood season ar... Coupling with a three dimensional (3D) hydrodynamic model and a suspended solids model, a 3D model for the transport of Fe and Mn in Arha Reservoir, China, was developed. The 3D velocity fields for the flood season are computed to drive the 3D model of Fe and Mn in which the processes of advection, diffusion, redox, sorption, desorption, deposition, and re suspension are included. The model has been calibrated by matching observed fluid, suspended solids, and total concentrations of Fe and Mn in the water column and in the sediment, successively. The model simulated both horizontal and vertical gradients of Fe and Mn in Arha Reservoir. It was found that Fe and especially Mn stratify in accordance with the stratification of DO during summer. The redox cycles across the water sediment interface has a principal role in the rise of Fe and Mn concentrations in the overlying water. It was also found that Fe and Mn loadings from the tributaries have a carryover effect on the water quality through a secondary contamination in the reservoir. 展开更多
关键词 three dimensional model Fe Mn transport flow field Arha Reservoir CLC number: X1 Document code: A
暂未订购 下载PDF
Low-Complexity Optimization Algorithm for Irregular Low-Density Parity-Check Codes 认领 引用
8
作者 左健存 邵宇丰 桂林 《Journal of Donghua University(English Edition)》 EI CAS 2013年第4期330-335,共6页
A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check (LDPC) codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional densit... A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check (LDPC) codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost. 展开更多
关键词 irregular low-density parity-check (LDPC) codes Turbo codes optimizationCLC number:TN911.22Document code:AArticle ID:1672-5220(2013)04-0330-06
暂未订购 下载PDF
Code Optimization, Frozen Glassy Phase and Improved Decoding Algorithms for Low-Density Parity-Check Codes 认领 引用
9
作者 黄海平 《Communications in Theoretical Physics》 SCIE CAS CSCD 2015年第1期115-124,共10页
The statistical physics properties of low-density parity-cheek codes for the binary symmetric channel are investigated as a spin glass problem with multi-spin interactions and quenched random fields by the cavity meth... The statistical physics properties of low-density parity-cheek codes for the binary symmetric channel are investigated as a spin glass problem with multi-spin interactions and quenched random fields by the cavity method. By evaluating the entropy function at the Nishimori temperature, we find that irregular constructions with heterogeneous degree distribution of check (bit) nodes have higher decoding thresholds compared to regular counterparts with homo- geneous degree distribution. We also show that the instability of the mean-field caiculation takes place only after the entropy crisis, suggesting the presence of a frozen glassy phase at low temperatures. When no prior knowledge of channel noise is assumed (searching for the ground state), we find that a reinforced strategy on normal belief propagation will boost the decoding threshold to a higher value than the normal belief propagation. This value is dose to the dynamicai transition where all local search heuristics fail to identify the true message (codeword or the ferromagnetic state). After the dynamical transition, the number of metastable states with larger energy density (than the ferromagnetic state) becomes exponentially numerous. When the noise level of the transmission channel approaches the static transition point, there starts to exist exponentiaily numerous codewords sharing the identical ferromagnetic energy. 展开更多
关键词 inierence low-density parity-check codes spin glass
暂未订购 下载PDF
CONSTRUCTION OF NONSYSTEMATIC LOW-DENSITY PARITY-CHECK CODES BASED ON SYMMETRIC BALANCED INCOMPLETE BLOCK DESIGN 认领 引用
10
作者 Lin Dengsheng Li Qiang Li Shaoqian 《Journal of Electronics(China)》 2008年第4期445-449,共5页
This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block co... This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block codes is bounded by the average row weight of generalizedinverses of their generator matrices and code rate.Then a class of nonsystematic LDPC codes con-structed based on SBIBD is presented.Their characteristics include:both generator matrices andparity-check matrices are sparse and cyclic,which are simple to encode and decode;and almost arbi-trary rate codes can be easily constructed,so they are rate-compatible codes.Because there aresparse generalized inverses of generator matrices,the performance of the proposed codes is only0.15dB away from that of the traditional systematic LDPC codes. 展开更多
关键词 Low-Density Parity-Check (LDPC) codes Nonsystematic codes Symmetric Balanced Incomplete Block Design (SBIBD) Finite projective geometries
暂未订购 下载PDF
Multi-dimensional blind separation method for STBC systems 认领 引用 被引量:3
11
作者 Minggang Luo Liping Li +1 位作者 Guobing Qian Huaguo Zhang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2013年第6期912-918,共7页
Intercepted signal blind separation is a research topic with high importance for both military and civilian communication systems. A blind separation method for space-time block code (STBC) systems is proposed by us... Intercepted signal blind separation is a research topic with high importance for both military and civilian communication systems. A blind separation method for space-time block code (STBC) systems is proposed by using the ordinary independent component analysis (ICA). This method cannot work when specific complex modulations are employed since the assumption of mutual independence cannot be satisfied. The analysis shows that source signals, which are group-wise independent and use multi-dimensional ICA (MICA) instead of ordinary ICA, can be applied in this case. Utilizing the block-diagonal structure of the cumulant matrices, the JADE algorithm is generalized to the multidimensional case to separate the received data into mutually independent groups. Compared with ordinary ICA algorithms, the proposed method does not introduce additional ambiguities. Simulations show that the proposed method overcomes the drawback and achieves a better performance without utilizing coding information than channel estimation based algorithms. 展开更多
关键词 multiple input multiple output (MIMO) space-time block code (STBC) multi-dimensional independent component analysis (MICA) blind separation
暂未订购 下载PDF
A Construction of Low-Density Parity-Check Codes 认领 引用
12
作者 Xiuling SHAN Tienan LI 《Journal of Mathematical Research with Applications》 CSCD 2013年第3期330-336,共7页
Low-density parity-check (LDPC) codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate (BER) performance approaches remarkably close to the Shannon limit. The LDPC cod... Low-density parity-check (LDPC) codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate (BER) performance approaches remarkably close to the Shannon limit. The LDPC codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular LDPC codes based on group divisible designs which have Tanner graphs free of four-cycles. 展开更多
关键词 low-density parity-check code iterative decoding group divisible design.
暂未订购 下载PDF
Low-Density Parity-Check Codes: Research Status and Development Direction 认领 引用
13
作者 Jie Xu Zhiyong Zheng Kun Tian 《Journal of Information Security》 2022年第4期257-271,共15页
In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the ... In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the analysis of the code rate and parameters of these eight kinds of structures, we find that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced. We propose that the current development cost should be lower with the progress of electronic technology and we need research on more practical Low-Density Parity-Check Codes (LDPC). Combined with the application of the quantum distribution key, we urgently need to explore the research direction of relevant theories and technologies of LDPC codes in other fields of quantum information in the future. 展开更多
关键词 Low-Density Parity-Check (LDPC) Parity Check Matrix H Quasi-Cyclic (QC) LDPC Spatially Coupled Low-Density Parity-Check (SC-LDPC) Codes
暂未订购 下载PDF
ON THE DIMENSION AND MINIMUM DISTANCE OF BCH CODES OVER GF(q) 认领 引用 被引量:1
14
作者 Yue Dianwu Hu Zhengming 《Journal of Electronics(China)》 1996年第3期216-221,共6页
In this paper, only narrow-sense primitive BCH codes over GF(q) are considered. A formula, that can be used in many cases, is first presented for computing the dimension of BCH codes. It improves the result given by M... In this paper, only narrow-sense primitive BCH codes over GF(q) are considered. A formula, that can be used in many cases, is first presented for computing the dimension of BCH codes. It improves the result given by MacWilliams and Sloane in 1977. A new method for finding the dimension of all types of BCH codes is proposed. In second part, it is proved that the BCH bound is the leader of some cyclotomic coset, and we guess that the minimum distance for any BCH code is also the leader of some cyclotomic coset. 展开更多
关键词 BCH code Cyclotomic coset Dimension Minimum distance
暂未订购 下载PDF
Edges Metric Constrained PEG Algorithm for Designing LDPC Codes 认领 引用
15
作者 Qin Xin Yang Chuanchuan +3 位作者 Jiang Xiaotian Hu Jiazhe Wang Xinyue Wang Ziyu 《China Communications》 SCIE EI CSCD 2025年第10期179-185,共7页
The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance ... The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance of LDPC codes,many im-proved PEG(IPEG)algorithms employ multi metrics to select surviving edges in turn.In this paper,the pro-posed edges metric(EM)based on message-passing algorithm(MPA)is introduced to PEG algorithm and the proposed EM constrained PEG(EM-PEG)algo-rithm mainly considers the independence of message passing from different nodes in Tanner graph.The numerical results show that our EM-PEG algorithm brings better bit error rate(BER)performance gains to LDPC codes than the traditional PEG algorithm and the powerful multi-edge multi-metric constrained PEG algorithm(MM-PEGA)proposed recently.In ad-dition,the multi-edge EM constrained PEG(M-EM-PEG)algorithm which adopts multi-edge EM may fur-ther improve the BER performance. 展开更多
关键词 low-density parity-check(LDPC)codes message-passing algorithm(MPA) progressive edge-growth(PEG)algorithm
暂未订购 下载PDF
REGULAR LOW-DENSITY PARITY-CHECK CODES BASED ON SHIFTED IDENTITY MATRICES 认领 引用
16
作者 He Shanbao Zhao Chunming Jiang Ming 《Journal of Electronics(China)》 2006年第1期20-22,共3页
This paper extends the class of Low-Density Parity-Check (LDPC) codes that can be constructed from shifted identity matrices. To construct regular LDPC codes, a new method is proposed. Two simple inequations are adopt... This paper extends the class of Low-Density Parity-Check (LDPC) codes that can be constructed from shifted identity matrices. To construct regular LDPC codes, a new method is proposed. Two simple inequations are adopted to avoid the short cycles in Tanner graph, which makes the girth of Tanner graphs at least 8. Because their parity-check matrices are made up of circulant matrices, the new codes are quasi-cyclic codes. They perform well with iterative decoding. 展开更多
关键词 Low-Density Parity-Check (LDPC) codes Quasi-cyclic codes Construction of codes Sumproduct decoding
暂未订购 下载PDF
THE Q-MATRIX LOW-DENSITY PARITY-CHECK CODES 认领 引用
17
作者 Peng Li Zhu Guangxi 《Journal of Electronics(China)》 2006年第1期35-38,共4页
This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that t... This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that the problem of constructing the sparse parity-check matrix requires an algorithm that is efficient in search environments and also is able to work with constraint satisfaction problem. The definition of Q-matrix is given, and it is found that the queen algorithm enables to search the Q-matrix. With properly permuting Q-matrix as sub-matrix, the sparse parity-check matrix which satisfied constraint condition is created, and the good regular-LDPC code that is called the Q-matrix LDPC code is generated. The result of this paper is significant not only for designing low complexity encoder, improving performance and reducing complexity of iterative decoding arithmetic, but also for building practical system of encodable and decodable LDPC code. 展开更多
关键词 Low-density parity-check code Encoder Constraint satisfaction problems n-queens problem
暂未订购 下载PDF
THE TRUE DIMENSION OF CERTAIN ALTERNANT CODES 认领 引用
18
作者 Yue Dianwu Feng Guangzeng 《Journal of Electronics(China)》 2000年第4期352-356,共5页
By applying a result from geometric Goppa codes, due to H.Schtenoth, the true dimension of certain alternant codes is calculated. The results lead in many cases to an improvement of the usual lower bound for the dimen... By applying a result from geometric Goppa codes, due to H.Schtenoth, the true dimension of certain alternant codes is calculated. The results lead in many cases to an improvement of the usual lower bound for the dimension. 展开更多
关键词 Alternant code Dimension Algebraic funtion field Geometric Goppa code
暂未订购 下载PDF
多路并联直线型变压器驱动源装置的二维电路模型 认领 引用 被引量:1
19
作者 范思源 魏浩 +1 位作者 李鹏超 邱爱慈 《西安交通大学学报》 EI CAS CSCD 北大核心 2026年第2期1-10,共10页
为了准确理解多路并联高功率脉冲装置的功率流传输特性并对脉冲源不同步馈电或故障状态时的电参数进行诊断,基于传输线电路编码方法,建立了6路并联直线型变压器驱动源(linear transformer drivers,LTD)脉冲功率装置的二维电路模型,采用... 为了准确理解多路并联高功率脉冲装置的功率流传输特性并对脉冲源不同步馈电或故障状态时的电参数进行诊断,基于传输线电路编码方法,建立了6路并联直线型变压器驱动源(linear transformer drivers,LTD)脉冲功率装置的二维电路模型,采用LTD脉冲源同步馈电和波形调控两种工作模式下的实验结果对模型进行验证。结果表明,与一维电路模型相比,二维电路模型能够更精确地预测装置输出特性,模拟和实验测量的电压或电流峰值相对偏差小于5%,并可对实验中难以直接测量的电场强度和线电流密度的空间分布特性进行分析。沿绝缘堆-磁绝缘传输线(magnetically insulated transmission line,MITL)系统径向向内,电场强度的角向不均匀系数从29%下降到1%,线电流密度的角向不均匀系数从120%下降到2%。在多路LTD脉冲源输出波形调控时,二维电路模型不仅给出了典型触发时序下负载电流波形,并且获得了绝缘堆-MITL系统不同角向位置的电压和电流空间分布。绝缘堆-MITL的电场强度和线电流密度空间分布极不均匀,沿绝缘堆向内,电场角向不均匀系数从319%下降到13%,线电流密度的角向不均匀系数从1330%下降到199%。建立的二维电路模型可用于多路并联LTD装置的波形调控和功率传输特性分析。 展开更多
关键词 直线型变压器驱动源 二维电路模型 传输线电路编码 波形调控 空间分布
暂未订购 下载PDF
High-dimensional multiplexing through vortex electromagnetic wave manipulation by spacetime-coding metasurfaces 认领 引用
20
作者 Chenfeng Yang Si Ran Wang +5 位作者 Jia Chen Du Man Ting Wang Zheng Xing Wang Ka Fai Chan Dong-Ze Zheng Geng-Bo Wu 《Light: Science & Applications》 SCIE EI CAS CSCD 2026年第6期1848-1860,共13页
Orbital angular momentum(OAM)is a fundamental property of light,with widespread applications across various fields,from quantum mechanics to advanced imaging and telecommunications.The inherent orthogonality of OAM be... Orbital angular momentum(OAM)is a fundamental property of light,with widespread applications across various fields,from quantum mechanics to advanced imaging and telecommunications.The inherent orthogonality of OAM beams allows information multiplexing in unique,high-dimensional states.However,conventional OAM-based systems encounter long-standing integration and scalability challenges due to the heavy reliance on complex optical components and redundant radio frequency chains for multi-channel transmission.Here,we propose a dual-polarized asynchronous space-time-coding metasurface(DASM)for producing coaxial OAM beams in multiple physical domains through a single aperture.By synergistically combining OAM,polarization,and frequency division multiplexing,DASM constructs a highdimensional communication framework,dramatically increasing the number of supported channels.Notably,DASM further streamlines the framework by directly modulating the information carried by OAM beams,eliminating the need for complicated external modulators.The high-dimensional multiplexing framework offers a simplified,versatile,and efficient solution for substantial development in wireless communications capacity and scalability. 展开更多
关键词 information multiplexing high dimensional multiplexing quantum mechanics orbital angular momentum oam complex optical components spacetime coding metasurfaces advanced imaging radio frequency chains
暂未订购 下载PDF
上一页 1 2 63 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈