A true random coded photon counting Lidar system is proposed in this paper,in which a single photon detector acts as the true random sequence signal generator instead of the traditional function generator.Compared wit...A true random coded photon counting Lidar system is proposed in this paper,in which a single photon detector acts as the true random sequence signal generator instead of the traditional function generator.Compared with the traditional pseudo-random coded method,the true random coded method not only improves the anti-crosstalk capability of the system,but more importantly,it effectively overcomes the adverse effect of the detector’s dead time on the ranging performance.The experiment results show that the ranging performance of the true random coded method is obviously better than that of the pseudo-random coded method.As a result,a three-dimensional scanning imaging of a model car is completed by the true random coded method.展开更多
Introduces in brief the principle of three kinds pseudo-random code fuzes, viz. the pseudo-random code phase modulation fuze,the pseudo-random code phase modulation and pulse amplitude modulation(PAM) combined fuze,an...Introduces in brief the principle of three kinds pseudo-random code fuzes, viz. the pseudo-random code phase modulation fuze,the pseudo-random code phase modulation and pulse amplitude modulation(PAM) combined fuze,and the pseudo-random code phase modulation and random(pseudo-random) pulse position modulation(PPM) combined fuze. On this basis, their SNR gains in signal processing after band pass filter to the correlation detection, and the overall SNR gains of the whole procedure after correlation detection are deduced in detail. The results show that the latter two kinds of fuzes have the same performances concerning antinoise that are stronger than that of the pseudo-random code phase modulation fuze.展开更多
The distribution law of the random code structure of randomly constructed irregular low-density parity-check （LDPC） codes is studied, Based on the Progressive Edge-Growth （PEG） algorithm, a new algorithm which can...The distribution law of the random code structure of randomly constructed irregular low-density parity-check （LDPC） codes is studied, Based on the Progressive Edge-Growth （PEG） algorithm, a new algorithm which can both ellminate short cycles and keep the distribution of the random code structure is presented, The experimentsl results show that the performance of the irregular LDPC codes constructed by the new algorithm is superior to that of the PEG algorithm,展开更多
The frequency bands used in mobile communications are allocated according to the type of application.With the need for more channels,the frequency spectrum has become a scarce natural resource.This study shows the res...The frequency bands used in mobile communications are allocated according to the type of application.With the need for more channels,the frequency spectrum has become a scarce natural resource.This study shows the results of a proposed modulation using a variation of the autocorrelation of pseudo-random codes to carry information.The work also presents the generation of multiple orthogonal axes to increase the bit rate thus improving the channel efficiency.展开更多
Recently, Tavakoli et al.proposed a self-testing scheme in the prepare-and-measure scenario, showing that self-testing is not necessarily based on entanglement and violation of a Bell inequality [Phys.Rev.A 98 062307(...Recently, Tavakoli et al.proposed a self-testing scheme in the prepare-and-measure scenario, showing that self-testing is not necessarily based on entanglement and violation of a Bell inequality [Phys.Rev.A 98 062307(2018)].They realized the self-testing of preparations and measurements in an N → 1(N ≥ 2) random access code(RAC), and provided robustness bounds in a 2 → 1 RAC.Since all N → 1 RACs with shared randomness are combinations of 2 → 1 and 3 → 1 RACs, the3 → 1 RAC is just as important as the 2 → 1 RAC.In this paper, we find a set of preparations and measurements in the3 → 1 RAC, and use them to complete the robustness self-testing analysis in the prepare-and-measure scenario.The method is robust to small but inevitable experimental errors.展开更多
This paper investigates rate adaptation schemes for decoding-and-forward (DF) relay system based on random projections codes (RPC). We consider a classic three node relay system model, where relay node performs on hal...This paper investigates rate adaptation schemes for decoding-and-forward (DF) relay system based on random projections codes (RPC). We consider a classic three node relay system model, where relay node performs on half-duplex mode. Then, we give out receiving diversity relay scheme and coding diversity relay scheme, and present their jointly decoding methods. Furthermore, we discuss the performance of the two schemes with different power allocation coefficients. Simulations show that our relay schemes can achieve different gain with the help of relay node. And, we should allocate power to source node to just guarantee relay node can decode successfully, and allocate remain power to relay node as far as possible. In this way, this DF relay system not only achieves diversity gain, but also achieves higher and smooth spectrum efficiency.展开更多
Random Projection Code (RPC) is a mechanism that combines channel coding and modulation together and realizes rate adaptation in the receiving end. Random projection code’s mapping matrix has significant influences o...Random Projection Code (RPC) is a mechanism that combines channel coding and modulation together and realizes rate adaptation in the receiving end. Random projection code’s mapping matrix has significant influences on decoding performance as well as hardware implementation complexity. To reduce hardware implementation complexity, we design a quasi-cyclic mapping matrix for RPC codes. Compared with other construction approaches, our design gets rid of data filter component, thus reducing chip area 7284.95 um2, and power consumption 331.46 uW in 0.13 um fabrication. Our simulation results show that our method does not cause any performance loss and even gets 0.2 dB to 0.5 dB gain at BER 10-4.展开更多
This paper proved the statement that a good linear block encoder is in fact a good local-random sequence generator. Furthermore, this statement discovers the deep relationship between the error-correcting coding theor...This paper proved the statement that a good linear block encoder is in fact a good local-random sequence generator. Furthermore, this statement discovers the deep relationship between the error-correcting coding theory and the modern cryptography.展开更多
In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, c...In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.展开更多
Codebook-based multiple input multiple output(MIMO) beamforming can significantly improve the system spectral efficiency with limited feedback and gets widely adopted.However,this scheme has a drawback of heavy feedba...Codebook-based multiple input multiple output(MIMO) beamforming can significantly improve the system spectral efficiency with limited feedback and gets widely adopted.However,this scheme has a drawback of heavy feedback load that the sum feedback rate can be a bottleneck for the communication system,especially when the number of users is large.In this paper,a new scheme using pseudo-random beamforming vectors and angle based threshold in the feedback process is proposed.In the proposed scheme,both the base-station and the users have no need to store a codebook.In each access procedure,the base-station generates a pseudo-random beamforming vector,and each user calculates the angle between the beamforming vectors and its channel state information(CSI) vector.If the angle is less than a predefined angle-threshold,the user feeds back its channel quality indicators(CQI),otherwise it keep silence.Compared with the codebook based scheme,the proposed scheme can largely reduce the sum feedback rate with negligible throughput loss.In particular,when the system has a constraint on the total sum feedback rate in uplink channel,the proposed scheme can increase the system throughput significantly.展开更多
To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation o...To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.展开更多
In this paper, we propose two novel efficient scheduling schemes with network coding in multi-relay wireless network to maximize the transmission efficiency. The first one uses adaptive forwarding with network coding(...In this paper, we propose two novel efficient scheduling schemes with network coding in multi-relay wireless network to maximize the transmission efficiency. The first one uses adaptive forwarding with network coding(AF-NC), in which each relay adaptively calculates the number of packets having innovative information according to the feedback from the sink. With AF-NC, duplicate packets are not sent, and the total number of time slots needed to complete transmission can be significantly reduced. The second scheme, named adaptive forwarding with network coding and retransmission(AFR-NC), combines AF-NC with automatic repeat request(ARQ) to guarantee reliable end-to-end communication with limited resource occupation. Numerical results show that compared with simple forwarding with network coding(F-NC), AF-NC has close successful delivery rate with dramatically less time slots, while AFR-NC achieves strict reliability with limited resource cost.展开更多
In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenar...In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is considered.Since the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency collaboratively.It is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss rate.In order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of communication.Under the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate nodes.It is not surprised that the reduction in the Galois field size can further reduce the transmission latency.展开更多
A numerical model has been developed to simulate the transport and fate of oil spilled at sea. The model combines the transport and fate processes of spilled oil with the random walk technique. Oil movement under th...A numerical model has been developed to simulate the transport and fate of oil spilled at sea. The model combines the transport and fate processes of spilled oil with the random walk technique. Oil movement under the influence of tidal currents, wind driven currents, and turbulent eddies is simulated by the PLUME RW dispersion model developed by HR Wallingford. The weathering processes in the model represent physical and chemical changes of soil slicks with time, and comprise mechanical spreading, dispersion, evaporation and emulsification. Shoreline stranding is determined approximately using a capacity method for different shoreline types. This paper presents details of the model, and describe the results of various sensitivity tests. The model is suitable for oil spill contingency planning.展开更多
Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in ...Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.展开更多
A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by...A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar＇s multi-target detection ability.展开更多
To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is de...To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is deduced, and the coding condition is also presented. Analyses and simulations show that random convolutional coding is capacity-achieving with probability approaching 1.展开更多
基金This work was supported by the National Natural Science Foundation of China(NSFC)(61805249)the Youth Innovation Promotion Association CAS(2019369).
文摘A true random coded photon counting Lidar system is proposed in this paper,in which a single photon detector acts as the true random sequence signal generator instead of the traditional function generator.Compared with the traditional pseudo-random coded method,the true random coded method not only improves the anti-crosstalk capability of the system,but more importantly,it effectively overcomes the adverse effect of the detector’s dead time on the ranging performance.The experiment results show that the ranging performance of the true random coded method is obviously better than that of the pseudo-random coded method.As a result,a three-dimensional scanning imaging of a model car is completed by the true random coded method.
基金Sponsored by National Defence Key Technology Pre-research Program During the Tenth Five-Year Plan Period
文摘Introduces in brief the principle of three kinds pseudo-random code fuzes, viz. the pseudo-random code phase modulation fuze,the pseudo-random code phase modulation and pulse amplitude modulation(PAM) combined fuze,and the pseudo-random code phase modulation and random(pseudo-random) pulse position modulation(PPM) combined fuze. On this basis, their SNR gains in signal processing after band pass filter to the correlation detection, and the overall SNR gains of the whole procedure after correlation detection are deduced in detail. The results show that the latter two kinds of fuzes have the same performances concerning antinoise that are stronger than that of the pseudo-random code phase modulation fuze.
基金Supported by the National Natural Science Foundation of China (Grant No. 60172030)Huawei Science FoundationXidian ISN National Key Laboratory
文摘The distribution law of the random code structure of randomly constructed irregular low-density parity-check （LDPC） codes is studied, Based on the Progressive Edge-Growth （PEG） algorithm, a new algorithm which can both ellminate short cycles and keep the distribution of the random code structure is presented, The experimentsl results show that the performance of the irregular LDPC codes constructed by the new algorithm is superior to that of the PEG algorithm,
文摘The frequency bands used in mobile communications are allocated according to the type of application.With the need for more channels,the frequency spectrum has become a scarce natural resource.This study shows the results of a proposed modulation using a variation of the autocorrelation of pseudo-random codes to carry information.The work also presents the generation of multiple orthogonal axes to increase the bit rate thus improving the channel efficiency.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61572081,61672110,and 61671082)
文摘Recently, Tavakoli et al.proposed a self-testing scheme in the prepare-and-measure scenario, showing that self-testing is not necessarily based on entanglement and violation of a Bell inequality [Phys.Rev.A 98 062307(2018)].They realized the self-testing of preparations and measurements in an N → 1(N ≥ 2) random access code(RAC), and provided robustness bounds in a 2 → 1 RAC.Since all N → 1 RACs with shared randomness are combinations of 2 → 1 and 3 → 1 RACs, the3 → 1 RAC is just as important as the 2 → 1 RAC.In this paper, we find a set of preparations and measurements in the3 → 1 RAC, and use them to complete the robustness self-testing analysis in the prepare-and-measure scenario.The method is robust to small but inevitable experimental errors.
文摘This paper investigates rate adaptation schemes for decoding-and-forward (DF) relay system based on random projections codes (RPC). We consider a classic three node relay system model, where relay node performs on half-duplex mode. Then, we give out receiving diversity relay scheme and coding diversity relay scheme, and present their jointly decoding methods. Furthermore, we discuss the performance of the two schemes with different power allocation coefficients. Simulations show that our relay schemes can achieve different gain with the help of relay node. And, we should allocate power to source node to just guarantee relay node can decode successfully, and allocate remain power to relay node as far as possible. In this way, this DF relay system not only achieves diversity gain, but also achieves higher and smooth spectrum efficiency.
文摘Random Projection Code (RPC) is a mechanism that combines channel coding and modulation together and realizes rate adaptation in the receiving end. Random projection code’s mapping matrix has significant influences on decoding performance as well as hardware implementation complexity. To reduce hardware implementation complexity, we design a quasi-cyclic mapping matrix for RPC codes. Compared with other construction approaches, our design gets rid of data filter component, thus reducing chip area 7284.95 um2, and power consumption 331.46 uW in 0.13 um fabrication. Our simulation results show that our method does not cause any performance loss and even gets 0.2 dB to 0.5 dB gain at BER 10-4.
基金Supported by Trans-century Training Program Foundation for the Talents by the State Education Commission
文摘This paper proved the statement that a good linear block encoder is in fact a good local-random sequence generator. Furthermore, this statement discovers the deep relationship between the error-correcting coding theory and the modern cryptography.
文摘In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.
文摘Codebook-based multiple input multiple output(MIMO) beamforming can significantly improve the system spectral efficiency with limited feedback and gets widely adopted.However,this scheme has a drawback of heavy feedback load that the sum feedback rate can be a bottleneck for the communication system,especially when the number of users is large.In this paper,a new scheme using pseudo-random beamforming vectors and angle based threshold in the feedback process is proposed.In the proposed scheme,both the base-station and the users have no need to store a codebook.In each access procedure,the base-station generates a pseudo-random beamforming vector,and each user calculates the angle between the beamforming vectors and its channel state information(CSI) vector.If the angle is less than a predefined angle-threshold,the user feeds back its channel quality indicators(CQI),otherwise it keep silence.Compared with the codebook based scheme,the proposed scheme can largely reduce the sum feedback rate with negligible throughput loss.In particular,when the system has a constraint on the total sum feedback rate in uplink channel,the proposed scheme can increase the system throughput significantly.
基金supported by the National Science Foundation （NSF） under Grants No.60832001,No.61271174 the National State Key Lab oratory of Integrated Service Network （ISN） under Grant No.ISN01080202
文摘To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.
基金the National Natural Science Foundation of China(Nos.61102051,61221001 and 61301117)the National High Technology Research and Development Program(863)of China(Nos.2012AA011701 and 2012AA121601)+1 种基金the Shanghai Jiao Tong University Science and Technology Innovation Foundation(No.AF0300021)the Shanghai Key Laboratory Funding(No.12DZ2272600)
文摘In this paper, we propose two novel efficient scheduling schemes with network coding in multi-relay wireless network to maximize the transmission efficiency. The first one uses adaptive forwarding with network coding(AF-NC), in which each relay adaptively calculates the number of packets having innovative information according to the feedback from the sink. With AF-NC, duplicate packets are not sent, and the total number of time slots needed to complete transmission can be significantly reduced. The second scheme, named adaptive forwarding with network coding and retransmission(AFR-NC), combines AF-NC with automatic repeat request(ARQ) to guarantee reliable end-to-end communication with limited resource occupation. Numerical results show that compared with simple forwarding with network coding(F-NC), AF-NC has close successful delivery rate with dramatically less time slots, while AFR-NC achieves strict reliability with limited resource cost.
基金This work was supported in part by the Guangdong Basic and Applied Basic Research Foundation under Key Project 2019B1515120032in part by the National Science Foundation of China(NSFC)with grant no.61901534+3 种基金in part by the Science,Technology and Innovation Commission of Shenzhen Municipality with grant no.JCYJ20190807155617099in part by the University Basic Research Fund 20lgpy43in part by the Guangdong Natural Science Foundation of Grant No.2019A1515011622the Foundation of Grant No.2019-JCJQ-JJ-411.
文摘In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is considered.Since the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency collaboratively.It is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss rate.In order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of communication.Under the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate nodes.It is not surprised that the reduction in the Galois field size can further reduce the transmission latency.
文摘A numerical model has been developed to simulate the transport and fate of oil spilled at sea. The model combines the transport and fate processes of spilled oil with the random walk technique. Oil movement under the influence of tidal currents, wind driven currents, and turbulent eddies is simulated by the PLUME RW dispersion model developed by HR Wallingford. The weathering processes in the model represent physical and chemical changes of soil slicks with time, and comprise mechanical spreading, dispersion, evaporation and emulsification. Shoreline stranding is determined approximately using a capacity method for different shoreline types. This paper presents details of the model, and describe the results of various sensitivity tests. The model is suitable for oil spill contingency planning.
基金Supported by the National Natural Science Foundation of China(61271174,61301178)the Science and Technology Innovation Foundation of Xi’an(CXY1352WL28)
文摘Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.
文摘A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar＇s multi-target detection ability.
基金Supported by National Natural Science Foundation of China (No.61271174)Young Teachers' Innovation Foundation of Xidian University(K5051303137)
文摘To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is deduced, and the coding condition is also presented. Analyses and simulations show that random convolutional coding is capacity-achieving with probability approaching 1.
