检索结果-内蒙古大学图书馆

SAI Computing Conference (SAI)

作者： Li, Yun Jiang, Hua Yu, Yao Du, Sidan Nanjing Univ Sch Elect Sci & Engn Nanjing Jiangsu Peoples R China Nanjing Univ Technol Sch Sci Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781467384605

In this paper, we dedicate to fighting against the multiple carrier frequency offsets (MCFOs) in two-relay decode-and-forward (DF) cooperative networks. A full-rate code named frequency reversal Alamouti code (FRAC) is designed for two-relay cooperative orthogonal frequency-division multiplexing (OFDM) networks. Reversal makes the equivalent channel matrix between the relays and the destination complex orthogonalized. The transmission is capable of achieving full diversity through using a zero-forcing (ZF) decoder. Benefiting from FRAC, operations during equalization at the destination are of low complexity. Theoretical analysis and simulation results both demonstrate that the proposed scheme can completely eliminate the effect of MCFOs.

关键词： Cooperative communication Space-frequency code (SFC) Multiple carrier frequency offsets (MCFOs) OFDM low-complexity decoding

来源：评论

学校读者我要写书评

暂无评论

low complexity suboptimal decode algorithms for quasi- orthogonal space time block codes

引用

Journal of Southeast University(English Edition) 2016年第1期32卷 1-5页

作者：李正权吴名沈连丰王志功贾子彦东南大学移动通信国家重点实验室南京210096 东南大学射频与光电集成电路研究所南京210096

Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate（ BER） performance of the proposed algorithms is compared with that of the current known decoding ***, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF（ pairwise-quasi-MMSE） decoder is equivalent to the pairwiseZF（ pairwise-MMSE） decoder, while the computational complexity is significantly reduced.

关键词： quasi-orthogonal space-time block code（QOSTBC） low-complexity decoding pairwise-quasi-ZF pairwise-quasi-MMSE bit error rate（BER）

来源：评论

学校读者我要写书评

暂无评论

On low-complexity Full-diversity Detection of Multi-User Space-Time Coding

On Low-Complexity Full-diversity Detection of Multi-User Spa...

引用

IEEE International Conference on Communications (ICC)

作者： Ismail, Amr Alouini, Mohamed-Slim KAUST CEMSE Div Thuwal Makkah Province Saudi Arabia

ISBN: (纸本)9781467331227

The incorporation of multiple input multiple output (MIMO) schemes in recent wireless communication standards paved the way to exploit the newly introduced dimension (i.e. space) to efficiently cancel the interference without requiring additional resources. In this paper, we focus on multiple input multiple ouitput (MIMO) multiple access channel (MAC) case and we answer the question about whether it is possible to suppress the interference in a MIMO MAC channel for completely blind users while achieving full-diversity with a simplified decoder in the affirmative. In fact, this goal can be attained by employing space-time block codes (STBC)s that achive full-diversity under partial interference cancellation (PIC). We derive sufficient conditions for a wide range of STBCs to achieve full-diversity under PIC group decoding with or without successive interference cancellation (SIC). Based on the provided design criteria we derive an upper-bound on the achievable rate for a class of codes. A two-user MIMO MAC interference cancellation scheme is presented and proved to achieve full-diversity under PIC group decoding. We compare our scheme to existing beamforming schemes with full or limit feedback.

关键词： Interference cancellation full-diversity low-complexity decoding PIC group decoding

来源：评论

学校读者我要写书评

暂无评论

Decode-and-Forward-Based Differential Modulation for Cooperative Communication System With Unitary and Nonunitary Constellations

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2012年第1期61卷 152-165页

作者： Bhatnagar, Manav R. Indian Inst Technol Delhi Dept Elect Engn New Delhi 110016 India

In this paper, we derive a maximum-likelihood (ML) decoder of the differential data in a decode-and-forward (DF)-based cooperative communication system utilizing uncoded transmissions. This decoder is applicable to complex-valued unitary and nonunitary constellations suitable for differential modulation. The ML decoder helps to improve the diversity of the DF-based differential cooperative system using an erroneous relaying node. We also derive a piecewise linear (PL) decoder of the differential data transmitted in the DF-based cooperative system. The proposed PL decoder significantly reduces the decoding complexity, as compared with the proposed ML decoder, with no significant degradation in the receiver performance. Existing ML and PL decoders of the differentially modulated uncoded data in the DF-based cooperative communication system are only applicable to binary modulated signals like binary phase shift keying and binary frequency shift keying, whereas the proposed decoders are applicable to complex-valued unitary and nonunitary constellations suitable for differential modulation under uncoded transmissions. We derive a closed-form expression of the uncoded average symbol error rate (SER) of the proposed PL decoder with M phase-shift keying constellation in a cooperative communication system with a single relay and one source-destination pair. An approximate average SER by ignoring higher order noise terms is also derived for this setup. It is analytically shown on the basis of the derived approximate SER that the proposed PL decoder provides full diversity of second order. In addition, we also derive the approximate SER of the differential DF system with multiple relays at asymptotically high signal-to-noise ratio (SNR) of the source-relay links. It is shown by simulations that the proposed PL decoder in the differential DF cooperative system with more than one relay also achieves the maximum possible diversity.

关键词： Cooperative communication decode-and-forward (DF) protocol differential modulation low-complexity decoding maximum-likelihood decoder symbol error rate (SER)

来源：评论

学校读者我要写书评

暂无评论

A Space-Time Coding Design for Continuous Phase Modulation Over the Frequency Selective Fading Channel

A Space-Time Coding Design for Continuous Phase Modulation O...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Li, Qiang Luo, Sheng Yan, Qing Chen, Hongyang Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 610054 Peoples R China

ISBN: (纸本)9781467304375;9781467304368

In this paper, we propose an orthogonal space-time block coding (STBC) for continuous phase modulation (CPM) over frequency-selective channels. The new method maintains the constant envelope and the phase continuity of the CPM waveforms by inserting three blocks of data-dependent symbols in addition to a cyclic prefix (CP). At the transmitter, the data blocks are precoded and transmitted in two antennas. And at the receiver, by applying the Laurent decomposition of CPM signals, only linear processing is needed to decode the CPM signal and the decoding complexity is much lower than traditional schemes. Simulation results corroborate that the proposed scheme achieves near-optimum error performances.

关键词： Continuous phase modulation precoding space-time codes low-complexity decoding

来源：评论

学校读者我要写书评

暂无评论

low-complexity decoding of LDPC codes

引用

ELECTRONICS LETTERS 2007年第18期43卷 990-991页

作者： Pandya, N. Honary, B. Univ Lancaster Dept Commun & Syst Infolab21 Lancaster LA1 4WA England

The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity-check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is presented here, to improve the performance of the algorithm.

关键词： belief-propagation algorithm Communications computing low-complexity decoding low-density parity-check codes belief networks Codes Neural computing techniques approximation theory telecommunication computing backpropagation Interpolation and function approximation (numerical analysis) parity check codes offset BP-based algorithm LDPC codes

来源：评论

学校读者我要写书评

暂无评论

Parallel Concatenated Tree Hadamard Codes

引用

IEEE COMMUNICATIONS LETTERS 2011年第7期15卷 743-745页

作者： Che, Shuling Wang, Xinmei Xidian Univ State Key Lab ISN Xian Peoples R China

In this letter, a new class of low-rate error-correcting codes named parallel concatenated tree Hadamard codes (CTrHC) are designed. Tree Hadamard codes consist of Hadamard segments which are connected by carefully chosen positions from a Hadamard codeword. With the same encoding and decoding complexity as the parallel concatenated zigzag Hadamard codes, CTrHC with short code length can achieve much better error floor performance illustrated by simulation results.

关键词： Hadamard codes low-rate codes error floor parallel concatenation low-complexity decoding

来源：评论

学校读者我要写书评

暂无评论

Modulation Diversity in Fading Channels with Quantized Receiver

Modulation Diversity in Fading Channels with Quantized Recei...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Mohammed, Saif Khan Viterbo, Emanuele Hong, Yi Chockalingam, Ananthanarayanan Linkoping Univ Dept Elect Eng ISY Linkoping Sweden Monash Univ Dept ECSE Melbourne Vic 3800 Australia Indian Inst Sci Dept ECE Bangalore 560012 Karnataka India

ISBN: (纸本)9781457705953

In this paper, we address the design of codes which achieve modulation diversity in block fading single-input single-output (SISO) channels with signal quantization at receiver and low-complexity decoding. With an unquantized receiver, coding based on algebraic rotations is known to achieve modulation coding diversity. On the other hand, with a quantized receiver, algebraic rotations may not guarantee diversity. Through analysis, we propose specific rotations which result in the codewords having equidistant component-wise projections. We show that the proposed coding scheme achieves maximum modulation diversity with a low-complexity minimum distance decoder.

关键词： Bit error rate Fading Quadrature amplitude modulation Quantization Receivers SISO channels Signal to noise ratio block fading SISO channels codecs codewords component-wise projections decoding diversity reception fading channels fading channels low-complexity decoding low-complexity minimum distance decoder maximum modulation diversity modulation coding diversity quantized receiver radio receivers signal quantization single-input single-output channels

来源：评论

学校读者我要写书评

暂无评论

Belief Propagation Based decoding of Large Non-Orthogonal STBCs

Belief Propagation Based Decoding of Large Non-Orthogonal ST...

引用

IEEE International Symposium on Information Theory (ISIT 2009)

作者： Suneel, Madhekar Som, Pritam Chockalingam, A. Rajan, B. Sundar Indian Inst Sci Dept ECE Bangalore 560012 Karnataka India

ISBN: (纸本)9781424443123

In this paper, we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having large dimensions. The proposed approach involves message passing on Markov random field (MRF) representation of the STBC MIMO system. Adoption of BP approach to decode non-orthogonal STBCs of large dimensions has not been reported so far. Our simulation results show that the proposed BP-based decoding achieves increasingly closer to SISO AWGN performance for increased number of dimensions. In addition, it also achieves near-capacity turbo coded BER performance;for e.g., with BP decoding of 24 x 24 STBC from CDA using BPSK (i.e., 576 real dimensions) and rate-1/2 turbo code (i.e., 12 bps/Hz spectral efficiency), coded BER performance close to within just about 2.5 dB from the theoretical MIMO capacity is achieved.

关键词： Non-orthogonal STBCs large dimensions low-complexity decoding belief propagation Markov random fields high spectral efficiencies

来源：评论

学校读者我要写书评

暂无评论

Improved low-complexity low-density parity-check decoding

引用

IET COMMUNICATIONS 2008年第8期2卷 1061-1068页

作者： Cui, Z. Wang, Z. Oregon State Univ Sch EECS Corvallis OR 97331 USA

A practical low-complexity decoding of low-density parity-check codes is studied. A fast decoding scheme for weighted bit-flipping (WBF) based algorithms is first proposed. Then, an optimised 2 bit decoding scheme and its VLSI architecture are presented. It is shown that the new approach has significantly better decoding performance while having comparable hardware complexity compared with WBF-based algorithms.

关键词： weighted bit-flipping parity check codes low-complexity decoding low-density parity-check decoding computational complexity decoding WBF VLSI telecommunication computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：