检索结果-南通市图书馆

A class of quasi-cyclic LDPC codes from B2 （mod m） sequences

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Information Sciences) 2011年第8期54卷 1645-1653页

作者： ZHANG GuoHua & WANG xinMei state key Laboratory of integrated Service network,{4.,xi’an 710071,china 1. state key Laboratory of integrated Service network Xidian University Xi’an 710071 China

A new class of binary low-density parity-check (LDPC) codes is proposed based on B 2 (mod m) sequences. The parity-check matrix of such a code has a column weight of three and a row weight of an arbitrary integer,and a quasi-cyclic *** parity-check matrix also has a girth at least 8,and corresponds to a code with minimal distance at least *** m is prime,an 8-cycles reduction method is presented to completely avoid the two types of 8-cycles within the total four types existed in the Tanner *** results show that,for a prime integer m,the new LDPC code outperforms the random (quasi-) regular counterpart generated by the PEG ***,a heuristic algorithm based on a strategy called neighboring extension search is presented to search for the B 2 (mod m) sequences whose lengths approach or meet the upper bound.

关键词： channel coding LDPC code B2 (mod m) sequencegirth

A network coding based hybrid ARQ algorithm for wireless video broadcast

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Information Sciences) 2011年第6期54卷 1327-1332页

作者： LU Ji , WU ChengKe, xiAO Song & DU JianChao state key Laboratory of integrated services {4., xidian university, xi’an 710071, china 1. state key Laboratory of integrated services {4. Xidian University Xi’an 710071 China

This paper proposes a network coding (NC) based hybrid ARQ (HARQ) algorithm for video broad- cast over wireless networks. The sender applies NC technique to combine the lost packets of different terminals, so that multiple terminals can recover their lost packets via per transmission from the sender. The proposed algorithm combines the advantage of FEC scheme and NC based ARQ scheme so as to maximize not only wireless throughput but also video quality for broadcast communication. Simulation results show that our algorithm significantly improves both wireless throughput efficiency and video quality, compared with ARQ and HARQ schemes.

关键词： wireless networks network coding hybrid ARQ video transmission

Quantum threshold group signature

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第10期51卷 1505-1514页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4.1 College of Computer Science and Technology, Beijing university of Technology, Beijing 100124. china 2 state key Laboratory of {4. services network, xidian university, xi’an 710071, china 3 state key Laboratory of Information Security (Graduate university of Chinese Academy of Sciences), Beijing 10004., china 4.state key Laboratory of networking and Switching Technology, Beijing university of Posts and Tele-communications, Beijing 100876, china College of Computer Science and Technology Beijing University of Technology Beijing 100124 China state key Laboratory of integrated services {4. Xidian University Xi’an 710071 China state key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China state key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

In most situations, the signer is generally a single person. However, when the message is written on behalf of an organization, a valid message may require the approval or consent of several persons. Threshold signature is a solution to this problem. Generally speaking, as an authority which can be trusted by all members does not exist, a threshold signature scheme without a trusted party appears more attractive. Following some ideas of the classical Shamir’s threshold signature scheme, a quantum threshold group signature one is proposed. In the proposed scheme, only t or more of n persons in the group can generate the group signature and any t-1 or fewer ones cannot do that. In the verification phase, any t or more of n signature receivers can verify the message and any t-1 or fewer receivers cannot verify the validity of the signature.

关键词： threshold quantum signature trusted party quantum cryptography

Threshold proxy quantum signature scheme with threshold shared verification

在线全文

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第8期51卷 1079-1088页

作者： YANG YuGuang1,3,4.& WEN QiaoYan2 1 College of Computer Science and Technology,Beijing university of Technology,Beijing 100124.china 2 state key Laboratory of {4.ing and Switching Technology,Beijing university of Posts and Tele-communications,Beijing 100876,china 3 state key Laboratory of integrated services {4.,xidian university,xi’an 710071,china 4.state key Laboratory of Information Security(Graduate university of Chinese Academy of Sciences) ,Beijing 10004.,china 1. College of Computer Science and Technology Beijing University of Technology Beijing 100124 China 3. state key Laboratory of integrated services {4. Xidian University Xi’an 710071 China 4. state key Laboratory of Information Security (Graduate university of Chinese Academy of Sciences) Beijing 100049 China 2. state key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold proxy quantum signature scheme with threshold shared verification is proposed. An original signer could authorize a group as its proxy signers. Then only t or more of n persons in the proxy group can generate the proxy signature on behalf of the original signer and any t-1 or fewer ones cannot do that. When the proxy signature needs to be verified,any t or more of n persons belonging to the verification group can verify the message and any t-1 or fewer ones cannot verify the validity of the proxy signature.

关键词： quantum signature threshold proxy quantum group signature threshold shared verification

Threshold quantum secret sharing between multi-party and multi-party

在线全文

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第9期51卷 1308-1315页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4.1 College of Computer Science and Technology,Beijing university of Technology,Beijing 100124.china 2 state key Laboratory of {4. services network,xidian university,xi’an 710071,china 3 state key Laboratory of Information Security (Graduate university of Chinese Academy of Sciences),Beijing 10004.,china 4.state key Laboratory of networking and Switching Technology,Beijing university of Posts and Tele-communications,Beijing 100876,china College of Computer Science and Technology Beijing University of Technology Beijing 100124 China state key Laboratory of integrated services {4. Xidian University Xi’an 710071 China state key Laboratory of Information Security (Graduate university of Chinese Academy of Sciences) Beijing 100049 China state key Laboratory of networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold quantum secret sharing (TQSS) scheme between multi-party and multi-party was proposed using a sequence of single photons,which is useful and efficient when the parties of communication are not all present. We described the process of this TQSS scheme and discussed its security. It was shown that entan-glement is not necessary for quantum secret sharing. Moreover,the theoretic effi-ciency was improved to approach 100% as almost all the instances can be used for generating the private key,and each photon can carry one bit of information. This protocol is feasible with the present-day technique.

关键词： threshold quantum secret sharing quantum cryptography single photon multi-party and multi-party

Optimal user scheduling and power control in multi-user cognitive broadcast systems

在线全文

学校读者我要写书评

暂无评论

Science china(Information Sciences) 2012年第6期55卷 1402-1414页

作者： WANG QunHuan 1,2,3,WANG HuiMing 1,2,3 & YIN QinYe 1,3 1 School of Electronic and Information Engineering,xi'an Jiaotong university,xi'an 71004.,china 2 state key Lab for {4. services networks,xidian university,xi'an 710071,china 3 Ministry of Education key Lab for Intelligent networks and network Security,xi'an Jiaotong university,xi'an 710071,china. 1. School of Electronic and Information Engineering Xi’an Jiaotong University Xi’an 710049 China2. State Key Lab for Integrated Services Networks Xidian University Xi’an 710071 China3. Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an 710071 China

Cognitive radio systems should not only have the ability to sense and exploit "frequency spectrum holes",but also the ability to sense and utilize "spatial spectrum holes".In this paper,we consider the issue of maximizing the throughput of the cognitive systems by fully utilizing "spatial spectrum holes" brought in by multiple cognitive users,in the scenario where a pair of licensed users and a cognitive broadcast system share multiple spectrum *** exploiting the channel reciprocity under the premise that the licensed system adopts the time-division-duplexing (TDD) mode,we propose a more practical cognitive access scheme that can sense the interference at the licensed user caused by the cognitive transmitter,based on the existing feedback signals from the licensed user to the licensed base *** both interferences from the licensed base station to the cognitive receiver and from the cognitive transmitter to the licensed user into consideration,we investigate the optimal user scheduling and power allocation scheme that can maximize the ergodic sum rate of the cognitive *** show that scheduling the user whose channel gain to interference and noise ratio (CGINR) is the largest for each frequency band is *** also derive the dynamic power allocation scheme meeting the three practical constraints,i.e.,the transmitter's average transmission power constraint,the power amplifier's instantaneous transmission power constraint,and the interference power constraint at the licensed *** result shows that in different coherent time intervals and different frequency bands,the power allocation has a multi-level waterfilling *** analysis shows that the strategy scheduling user with the largest CGINR introduces significant performance improvement compared with the traditional strategy scheduling user with the largest channel gain to noise ratio (CGNR).We also illustrate the impact of power constraints and the number of users on system p

关键词： cognitive radio distributed spatial spectrum holes opportunistic scheduling power allocation

Construction of nonbinary quantum cyclic codes by using graph method

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science in china(Series F) 2005年第6期48卷 693-702页

作者： LIU Tailin1,2,3, WEN Qiaoyan1 & LIU Zihui4.1. School of Science, Beijing university of Posts and Telecommunications, Beijing 100876, china 2. state key Laboratory of {4. services network, xidian university, xi’an 710071,china 3. Shandong Finance Institute, Jinan 250014. china 4. School of Mathematical Sciences, Peking university, Beijing 100871, china 1. School of Science Beijing University of Posts and Telecommunications 100876 Beijing China 2. state key Laboratory of integrated services {4. Xidian University 710071 Xi’an China 3. Shandong Finance Institute 250014 Jinan China 4. School of Mathematical Sciences Peking University 100871 Beijing China

Using the graph method proposed by Schlingemann and Werner, this paper introduces a technique to construct nonbinary quantum cyclic codes and provides a specific example. We also construct the quantum codes [[8, 2, 4.... 详细信息

关键词： nonbinary quantum stabilizer codes quantum cyclic codes

Approximating maximum likelihood performance reduced dimension VBLAST detection algorithm

在线全文

学校读者我要写书评

暂无评论

Science china(Information Sciences) 2010年第7期53卷 1439-1445页

作者： CHENG WenChi & ZHANG HaiLin state key Lab of ISN, xidian university, xi’an 710071, {4. 1. state key Lab of ISN Xidian University Xi’an 710071 China

SM (spatial multiplexing) can effectively increase the information rate in multiple input multiple output system. BLAST is the typical representation of SM, especially VBLAST, which has some simple de- tection algorithms such as ML, ZF-DFE and ML-DFE, etc. However, the existing algorithms cannot approach ML performance. This paper discusses the effect for detection performance by the correlation of channel ma- trix, proposes a new algorithm-HPML detection algorithm, which can approach ML performance with low complexity. In the new algorithm, we travel the first d layers, and use the DFE procedure for the remaining layers, then perform ML detection for all obtained signals. Simulation results show that HPML can approach ML performance when the traveling numbers are not less than half of the number of transmitting antennas, and the algorithm complexity is smaller than ML.

关键词： BLAST correlation of channel matrix ML detecting algorithm HPML detecting algorithm

Exact thresholds for low-density parity-check codes over the binary erasure channel

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2009年第7期19卷 897-900页

作者： Jianjun Mu a, xiaopeng Jiao a, xinmei Wangb a School of Computer Science and Technology, xidian university, xi’an 710071, china b state {4. Laboratory of integrated Service networks, xidian university, xi’an 710071, china [a]School of Computer Science and Technology Xidian University Xi’an 710071 China [b]State Key Laboratory of Integrated Service Networks Xidian University Xi’an 710071 China

A simple method for determining the threshold of irregular LDPC codes over the binary erasure channel (BEC) under message-passing decoding is proposed. An exact formula for calculating the threshold of irregular LDPC codes over the BEC is proved. This generalizes the known result on the threshold of regular LDPC codes to irregular LDPC codes. Moreover, our new method can avoid the computation of the inverse of the degree distribution function for irregular LDPC codes. Numerical results demonstrate the correctness of our proposed method.

关键词： Binary erasure channel (BEC) LDPC codes Threshold