The problem of soft-input so,output （ SISO ） detection for time-varying frequency-selec- tive fading channels is considered. Based on a suitably-designed factor graph and the sum-product al- gorithm, a low-complexit...The problem of soft-input so,output （ SISO ） detection for time-varying frequency-selec- tive fading channels is considered. Based on a suitably-designed factor graph and the sum-product al- gorithm, a low-complexity iterative message passing scheme is proposed for joint channel estima- tion, equalization and decoding. Two kinds of schedules （parallel and serial） are adopted in message updates to produce two algorithms with different latency. The computational complexity per iteration of the proposed algorithms grows only linearly with the channel length, which is a significantly de- crease compared to the optimal maximum a posteriori （MAP） detection with the exponential com- plexity. Computer simulations demonstrate the effectiveness of the proposed schemes in terms of bit error rate performance.展开更多
针对现有正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统信道估计和迭代检测算法中频谱效率低和鲁棒性差等问题,提出了一种基于酉近似消息传递和叠加导频的信道估计与联合检测方法。首先,在软调制/解调中叠加导频...针对现有正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统信道估计和迭代检测算法中频谱效率低和鲁棒性差等问题,提出了一种基于酉近似消息传递和叠加导频的信道估计与联合检测方法。首先,在软调制/解调中叠加导频对正交幅度调制的星座点进行预处理,检测时将叠加的导频作为频域符号的先验分布,利用置信传播算法进行调制和解调,实现检测模型的简化。然后,应用因子图-消息传递算法对OFDM传输系统和信道进行建模和全局优化,引入酉变换加强信道估计算法的鲁棒性。最后,建立OFDM仿真环境对现有方法进行仿真分析。仿真结果表明,相对于现有的独立导频类算法,所提算法能够以相同复杂度显著提升OFDM系统的频谱效率和鲁棒性。展开更多
In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destinatio...In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.展开更多
Discusses how to assign a set of noninterference radio channels to a symmetric network of transmitter location over a large planar area, the minimum of the span and the assignment of the channels with the changing of ...Discusses how to assign a set of noninterference radio channels to a symmetric network of transmitter location over a large planar area, the minimum of the span and the assignment of the channels with the changing of minimum distance among the same channels and the changing of the minimum difference among the adjacent channels. The minimum interval in the frequency spectrum of 9 interger channels is proved and obtained by using the graphic theory and the reduction to absurdity on condition that interference from nearby transmitters is avoided in the whole given grid and the grid spreading arbitrarily far in all directions.展开更多
Let G = (V, E) be a graph and C<sub>m</sub> be the cycle graph with m vertices. In this paper, we continued Yeh’s work [1] on the distance labeling of the cycle graph Cm</sub>. An n-set distance lab...Let G = (V, E) be a graph and C<sub>m</sub> be the cycle graph with m vertices. In this paper, we continued Yeh’s work [1] on the distance labeling of the cycle graph Cm</sub>. An n-set distance labeling of a graph G is the labeling of the vertices (with n labels per vertex) of G under certain constraints depending on the distance between each pair of the vertices in G. Following Yeh’s notation [1], the smallest value for the largest label in an n-set distance labeling of G is denoted by λ<sub>1</sub><sup>(n)</sup>(G). Basic results were presented in [1] for λ1</sub>(2)</sup>(C<sub>m</sub>) for all m and λ1</sub>(n)</sup>(C<sub>m</sub>) for some m where n ≥ 3. However, there were still gaps left unstudied due to case-by-case complexities. For these uncovered cases, we proved a lower bound for λ1</sub>(n)</sup>(C<sub>m</sub>). Then we proposed an algorithm for finding an n-set distance labeling for n ≥ 3 based on our proof of the lower bound. We verified every single case for n = 3 up to n = 500 by this same algorithm, which indicated that the upper bound is the same as the lower bound for n ≤ 500.展开更多
从无结构化自然语言文本中抽取实体关系三元组是构建大型知识图谱中最为关键的一步,但现有研究仍存在3方面问题:1)忽略文本中因多个三元组共享同一实体而产生的实体关系重叠问题;2)当前以编码器-解码器为基础的联合抽取模型未充分考虑...从无结构化自然语言文本中抽取实体关系三元组是构建大型知识图谱中最为关键的一步,但现有研究仍存在3方面问题:1)忽略文本中因多个三元组共享同一实体而产生的实体关系重叠问题;2)当前以编码器-解码器为基础的联合抽取模型未充分考虑文本语句词之间的依赖关系;3)部分三元组序列过长导致误差累积与传播,影响实体关系抽取的精度和效率.基于此,提出基于图卷积增强多路解码的实体关系联合抽取模型(graph convolution-enhanced multi-channel decoding joint entity and relation extraction model,GMCD-JERE).首先,基于BiLSTM作为模型编码器,强化文本中词的双向特征融合;其次,通过图卷积多跳特征融合句中词之间的依赖关系,提高关系抽取准确性;此外,改进传统模型按三元组先后顺序的解码机制,通过多路解码三元组机制,解决实体关系重叠问题,同时缓解三元组序列过长造成误差累积、传播的影响;最后,实验选用当前3个主流模型进行性能验证,在NYT(New York times)数据集上结果表明在精确率、召回率和F1这3个指标上分别提升了4.3%,5.1%,4.8%,同时在WebNLG(Web natural language generation)数据集上验证以关系为开始的抽取顺序.展开更多
基金Supported by the National Natural Science Foundation of China(61201181)Specialized Research Fund for the Doctoral Program of Higher Education(20121101120020)the Co-innovation Laboratory of Aerospace Broadband Network Technology
文摘The problem of soft-input so,output （ SISO ） detection for time-varying frequency-selec- tive fading channels is considered. Based on a suitably-designed factor graph and the sum-product al- gorithm, a low-complexity iterative message passing scheme is proposed for joint channel estima- tion, equalization and decoding. Two kinds of schedules （parallel and serial） are adopted in message updates to produce two algorithms with different latency. The computational complexity per iteration of the proposed algorithms grows only linearly with the channel length, which is a significantly de- crease compared to the optimal maximum a posteriori （MAP） detection with the exponential com- plexity. Computer simulations demonstrate the effectiveness of the proposed schemes in terms of bit error rate performance.
文摘针对现有正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统信道估计和迭代检测算法中频谱效率低和鲁棒性差等问题,提出了一种基于酉近似消息传递和叠加导频的信道估计与联合检测方法。首先,在软调制/解调中叠加导频对正交幅度调制的星座点进行预处理,检测时将叠加的导频作为频域符号的先验分布,利用置信传播算法进行调制和解调,实现检测模型的简化。然后,应用因子图-消息传递算法对OFDM传输系统和信道进行建模和全局优化,引入酉变换加强信道估计算法的鲁棒性。最后,建立OFDM仿真环境对现有方法进行仿真分析。仿真结果表明,相对于现有的独立导频类算法,所提算法能够以相同复杂度显著提升OFDM系统的频谱效率和鲁棒性。
基金Supported by the Open Research Fund of National Moblie Communications Research Laboratory of Southeast Uni-versity (No. W200704)
文摘In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.
文摘Discusses how to assign a set of noninterference radio channels to a symmetric network of transmitter location over a large planar area, the minimum of the span and the assignment of the channels with the changing of minimum distance among the same channels and the changing of the minimum difference among the adjacent channels. The minimum interval in the frequency spectrum of 9 interger channels is proved and obtained by using the graphic theory and the reduction to absurdity on condition that interference from nearby transmitters is avoided in the whole given grid and the grid spreading arbitrarily far in all directions.
文摘Let G = (V, E) be a graph and C<sub>m</sub> be the cycle graph with m vertices. In this paper, we continued Yeh’s work [1] on the distance labeling of the cycle graph Cm</sub>. An n-set distance labeling of a graph G is the labeling of the vertices (with n labels per vertex) of G under certain constraints depending on the distance between each pair of the vertices in G. Following Yeh’s notation [1], the smallest value for the largest label in an n-set distance labeling of G is denoted by λ<sub>1</sub><sup>(n)</sup>(G). Basic results were presented in [1] for λ1</sub>(2)</sup>(C<sub>m</sub>) for all m and λ1</sub>(n)</sup>(C<sub>m</sub>) for some m where n ≥ 3. However, there were still gaps left unstudied due to case-by-case complexities. For these uncovered cases, we proved a lower bound for λ1</sub>(n)</sup>(C<sub>m</sub>). Then we proposed an algorithm for finding an n-set distance labeling for n ≥ 3 based on our proof of the lower bound. We verified every single case for n = 3 up to n = 500 by this same algorithm, which indicated that the upper bound is the same as the lower bound for n ≤ 500.
文摘从无结构化自然语言文本中抽取实体关系三元组是构建大型知识图谱中最为关键的一步,但现有研究仍存在3方面问题:1)忽略文本中因多个三元组共享同一实体而产生的实体关系重叠问题;2)当前以编码器-解码器为基础的联合抽取模型未充分考虑文本语句词之间的依赖关系;3)部分三元组序列过长导致误差累积与传播,影响实体关系抽取的精度和效率.基于此,提出基于图卷积增强多路解码的实体关系联合抽取模型(graph convolution-enhanced multi-channel decoding joint entity and relation extraction model,GMCD-JERE).首先,基于BiLSTM作为模型编码器,强化文本中词的双向特征融合;其次,通过图卷积多跳特征融合句中词之间的依赖关系,提高关系抽取准确性;此外,改进传统模型按三元组先后顺序的解码机制,通过多路解码三元组机制,解决实体关系重叠问题,同时缓解三元组序列过长造成误差累积、传播的影响;最后,实验选用当前3个主流模型进行性能验证,在NYT(New York times)数据集上结果表明在精确率、召回率和F1这3个指标上分别提升了4.3%,5.1%,4.8%,同时在WebNLG(Web natural language generation)数据集上验证以关系为开始的抽取顺序.
