Bounds on the achievable rate of a Gaussian channel in the case that the transmitter knows the
interference signal but not its fading coefficients are given. We generalize the analysis which were studied
in [1] and [4] so that their results are special cases of our analysis. We enforce our bounds by simulations
in which many numerical examples are drawn and investigated under different cases.
Iterative Soft Decision Based Complex K-best MIMO DecoderCSCJournals
This paper presents an iterative soft decision based complex multiple input multiple output (MIMO) decoding algorithm, which reduces the complexity of Maximum Likelihood (ML) detector. We develop a novel iterative complex K-best decoder exploiting the techniques of lattice reduction for 8×8 MIMO. Besides list size, a new adjustable variable has been introduced in order to control the on-demand child expansion. Following this method, we obtain 6.9 to 8.0 dB improvement over real domain K-best decoder and 1.4 to 2.5 dB better performance compared to iterative conventional complex decoder for 4th iteration and 64-QAM modulation scheme. We also demonstrate the significance of new parameter on bit error rate. The proposed decoder not only increases the performance, but also reduces the computational complexity to a certain level.
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding AlgorithmCSCJournals
Multiple-input multiple-output (MIMO) systems have been widely acclaimed in order to provide high data rates. Recently Lattice Reduction (LR) aided detectors have been proposed to achieve near Maximum Likelihood (ML) performance with low complexity. In this paper, we develop the fixed point design of an iterative soft decision based LR-aided K-best decoder, which reduces the complexity of existing sphere decoder. A simulation based word-length optimization is presented for physical implementation of the K-best decoder. Simulations show that the fixed point result of 16 bit precision can keep bit error rate (BER) degradation within 0.3 dB for 8×8 MIMO systems with different modulation schemes.
Mimo radar detection in compound gaussian clutter using orthogonal discrete f...ijma
This paper proposes orthogonal Discrete Frequency Coding Space Time Waveforms (DFCSTW) for
Multiple Input and Multiple Output (MIMO) radar detection in compound Gaussian clutter. The proposed
orthogonal waveforms are designed considering the position and angle of the transmitting antenna when
viewed from origin. These orthogonally optimized show good resolution in spikier clutter with Generalized
Likelihood Ratio Test (GLRT) detector. The simulation results show that this waveform provides better
detection performance in spikier Clutter.
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...IJNSA Journal
This paper proposes a new blind adaptive channel shortening approach for multi-carrier systems. The
performance of the discrete Fourier transform-DMT (DFT-DMT) system is investigated with the proposed
DST-DMT system over the standard carrier serving area (CSA) loop1. Enhanced bit rates demonstrated
and less complexity also involved by the simulation of the DST-DMT system.
In this paper, a new algorithm for a high resolution
Direction Of Arrival (DOA) estimation method for multiple
wideband signals is proposed. The proposed method proceeds
in two steps. In the first step, the received signals data is
decomposed in a Toeplitz form using the first-order statistics.
In the second step, The QR decomposition is applied on the
constructed Toeplitz matrix. Compared with existing schemes,
the proposed scheme provides several advantages. First, it
requires computing the triangular matrix R or the orthogonal
matrix Q to find the DOA; these matrices can be computed
with O(n2) operation. However, most of the existing schemes
required eignvalue decomposition (EVD) for the covariance
matrix or singular value decomposition (SVD) for the data
matrix; using EVD or SVD requires much more complex
computational O(n3) operation. Second, the proposed scheme
is more suitable for high-speed communication since it
requires first-order statistics and a single snapshot. Third,
the proposed scheme can estimate the correlated wideband
signals without using spatial smoothing techniques; whereas,
already-existing schemes do not. Accuracy of the proposed
wideband DOA estimation method is evaluated through
computer simulation in comparison with a conventional
method.
Iterative Soft Decision Based Complex K-best MIMO DecoderCSCJournals
This paper presents an iterative soft decision based complex multiple input multiple output (MIMO) decoding algorithm, which reduces the complexity of Maximum Likelihood (ML) detector. We develop a novel iterative complex K-best decoder exploiting the techniques of lattice reduction for 8×8 MIMO. Besides list size, a new adjustable variable has been introduced in order to control the on-demand child expansion. Following this method, we obtain 6.9 to 8.0 dB improvement over real domain K-best decoder and 1.4 to 2.5 dB better performance compared to iterative conventional complex decoder for 4th iteration and 64-QAM modulation scheme. We also demonstrate the significance of new parameter on bit error rate. The proposed decoder not only increases the performance, but also reduces the computational complexity to a certain level.
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding AlgorithmCSCJournals
Multiple-input multiple-output (MIMO) systems have been widely acclaimed in order to provide high data rates. Recently Lattice Reduction (LR) aided detectors have been proposed to achieve near Maximum Likelihood (ML) performance with low complexity. In this paper, we develop the fixed point design of an iterative soft decision based LR-aided K-best decoder, which reduces the complexity of existing sphere decoder. A simulation based word-length optimization is presented for physical implementation of the K-best decoder. Simulations show that the fixed point result of 16 bit precision can keep bit error rate (BER) degradation within 0.3 dB for 8×8 MIMO systems with different modulation schemes.
Mimo radar detection in compound gaussian clutter using orthogonal discrete f...ijma
This paper proposes orthogonal Discrete Frequency Coding Space Time Waveforms (DFCSTW) for
Multiple Input and Multiple Output (MIMO) radar detection in compound Gaussian clutter. The proposed
orthogonal waveforms are designed considering the position and angle of the transmitting antenna when
viewed from origin. These orthogonally optimized show good resolution in spikier clutter with Generalized
Likelihood Ratio Test (GLRT) detector. The simulation results show that this waveform provides better
detection performance in spikier Clutter.
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...IJNSA Journal
This paper proposes a new blind adaptive channel shortening approach for multi-carrier systems. The
performance of the discrete Fourier transform-DMT (DFT-DMT) system is investigated with the proposed
DST-DMT system over the standard carrier serving area (CSA) loop1. Enhanced bit rates demonstrated
and less complexity also involved by the simulation of the DST-DMT system.
In this paper, a new algorithm for a high resolution
Direction Of Arrival (DOA) estimation method for multiple
wideband signals is proposed. The proposed method proceeds
in two steps. In the first step, the received signals data is
decomposed in a Toeplitz form using the first-order statistics.
In the second step, The QR decomposition is applied on the
constructed Toeplitz matrix. Compared with existing schemes,
the proposed scheme provides several advantages. First, it
requires computing the triangular matrix R or the orthogonal
matrix Q to find the DOA; these matrices can be computed
with O(n2) operation. However, most of the existing schemes
required eignvalue decomposition (EVD) for the covariance
matrix or singular value decomposition (SVD) for the data
matrix; using EVD or SVD requires much more complex
computational O(n3) operation. Second, the proposed scheme
is more suitable for high-speed communication since it
requires first-order statistics and a single snapshot. Third,
the proposed scheme can estimate the correlated wideband
signals without using spatial smoothing techniques; whereas,
already-existing schemes do not. Accuracy of the proposed
wideband DOA estimation method is evaluated through
computer simulation in comparison with a conventional
method.
Joint Timing and Frequency Synchronization in OFDMidescitation
With the advent of OFDM for WLAN
communications, as exemplified by IEEE 802.11a, it has become
imperative to have efficient and reliable synchronization
algorithms for OFDM WLAN receivers. The main challenges
with synchronization deal with the frequency offset and delay
spread introduced by the wireless channel. In this paper,
research is done into OFDM timing synchronization and
frequency synchronization techniques.
Singular Value Decomposition: Principles and Applications in Multiple Input M...IJCNCJournal
The authors discuss the importance of using the singular value decomposition (SVD) in computing the capacity of multiple input multiple output (MIMO) and in estimation the channel gain from the transmitter to the receiver. Examples that show how the SVD simplifies computing the MIMO channel capacity are discussed. Numerical results that show what factors determine the performance of using SVD in channel
estimation are also discussed.
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...ijwmn
Extensive studies have been carried out for reducing the handover time of wireless mobile network at
medium access control (MAC) layer. However, none of them show the impact of reduced handover time
on the overall performance of wireless mobile networks. This paper presents a quantitative analysis to
show the impact of reduced handover time on the performance of wireless mobile networks. The proposed
quantitative model incorporates many critical performance parameters involve in reducing the handover
time for wireless mobile networks. In addition, we analyze the use of active scanning technique with
comparatively shorter beacon interval time in a handoff process. Our experiments verify that the active
scanning can reduce the overall handover time at MAC layer if comparatively shorter beacon intervals are
utilized for packet transmission. The performance measures adopted in this paper for experimental
verifications are network throughput under different network loads.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Hamming net based Low Complexity Successive Cancellation Polar DecoderRSIS International
This paper aims to implement hybrid based Polar
encoder using the knowledge of mutual information and channel
capacity. Further a Hamming weight successive cancellation
decoder is simulated with QPSK modulation technique in
presence of additive white gaussian noise. The experimentation
performed with the effect of channel polarization has shown that
for 256- bit data stream, 30% channels has zero bit and 49%
channels are with a one bit capacity. The decoding complexity is
reduced to almost half as compared to conventional successive
cancellation decoding algorithm. However, the required SNR of
7 dB is achieved at the targeted BER of 10 -4. The penalty paid is
in terms of training time required at the decoding end.
Comparative Analysis of Distortive and Non-Distortive Techniques for PAPR Red...IDES Editor
OFDM is a popular and widely accepted modulation
and multiplexing technique in the area of wireless
communication. IEEE 802.15, a wireless specification defined
for WPAN is an emerging wireless technology for short range
multimedia applications. Two general categories of 802.15
are the low rate 802.15.4 (ZigBee) and high rate 802.15.3
(UWB). In their physical (PHY) layer design, OFDM is a
competing technique due to the various advantages it renders
in the practical wireless media. OFDM has been a popular
technique for many years and adopted as the core technique
in a number of wireless standards. It makes the system more
immune to interference like InterSymbol Interference (ISI)
and InterCarrier Interference (ICI) and dispersive effects of
the channel. It is also a spectrally efficient scheme since the
spectra of the signal are overlapping in nature. Despite these
advantages OFDM suffers from a serious problem of high
Peak to Average Power. This limits the system’s capabilities
and increases the complexity. This paper compares the signal
distortion technique of Amplitude Clipping and the
distortionless technique of SLM for Peak to Average Power
reduction
Improved Timing Estimation Using Iterative Normalization Technique for OFDM S...IJECEIAES
Conventional timing estimation schemes based on autocorrelation experience perfor- mance degradation in the multipath channel environment with high delay spread. To overcome this problem, we proposed an improvement of the timing estimation for the OFDM system based on statistical change of symmetrical correlator. The new method uses iterative normalization technique to the correlator output before the detection based on statistical change of symmetric correlator is applied. Thus, it increases the detection probability and achieves better performance than previously published methods in the multipath environment. Computer simulation shows that our method is very robust in the fading multipath channel.
Matrix Padding Method for Sparse Signal ReconstructionCSCJournals
Compressive sensing has been evolved as a very useful technique for sparse reconstruction of signals that are sampled at sub-Nyquist rates. Compressive sensing helps to reconstruct the signals from few linear projections of the sparse signal. This paper presents a technique for the sparse signal reconstruction by padding the compression matrix for solving the underdetermined system of simultaneous linear equations, followed by an iterative least mean square approximation. The performance of this method has been compared with the widely used compressive sensing recovery algorithms such as l1_ls, l1-magic, YALL1, Orthogonal Matching Pursuit, Compressive Sampling Matching Pursuit, etc.. The sounds generated by 3-blade engine, music, speech, etc. have been used to validate and compare the performance of the proposed technique with the other existing compressive sensing algorithms in ideal and noisy environments. The proposed technique is found to have outperformed the l1_ls, l1-magic, YALL1, OMP, CoSaMP, etc. as elucidated in the results.
A New Approach for Speech Enhancement Based On Eigenvalue Spectral SubtractionCSCJournals
In this paper, a phase space reconstruction-based method is proposed for speech enhancement. The method embeds the noisy signal into a high dimensional reconstructed phase space and uses Spectral Subtraction idea. The advantages of the proposed method are fast performance, high SNR and good MOS. In order to evaluate the proposed method, ten signals of TIMIT database mixed with the white additive Gaussian noise and then the method was implemented. The efficiency of the proposed method was evaluated by using qualitative and quantitative criteria.
A Subspace Method for Blind Channel Estimation in CP-free OFDM SystemsCSCJournals
In this paper, a subspace method is proposed for blind channel estimation in orthogonal frequency-division multiplexing (OFDM) systems over time-dispersive channel. The proposed method does not require a cyclic prefix (CP) and thus leading to higher spectral efficiency. By exploiting the block Toeplitz structure of the channel matrix, the proposed blind estimation method performs satisfactorily with very few received OFDM blocks. Numerical simulations demonstrate the superior performance of the proposed algorithm over methods reported earlier in the literature.
Joint Timing and Frequency Synchronization in OFDMidescitation
With the advent of OFDM for WLAN
communications, as exemplified by IEEE 802.11a, it has become
imperative to have efficient and reliable synchronization
algorithms for OFDM WLAN receivers. The main challenges
with synchronization deal with the frequency offset and delay
spread introduced by the wireless channel. In this paper,
research is done into OFDM timing synchronization and
frequency synchronization techniques.
Singular Value Decomposition: Principles and Applications in Multiple Input M...IJCNCJournal
The authors discuss the importance of using the singular value decomposition (SVD) in computing the capacity of multiple input multiple output (MIMO) and in estimation the channel gain from the transmitter to the receiver. Examples that show how the SVD simplifies computing the MIMO channel capacity are discussed. Numerical results that show what factors determine the performance of using SVD in channel
estimation are also discussed.
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...ijwmn
Extensive studies have been carried out for reducing the handover time of wireless mobile network at
medium access control (MAC) layer. However, none of them show the impact of reduced handover time
on the overall performance of wireless mobile networks. This paper presents a quantitative analysis to
show the impact of reduced handover time on the performance of wireless mobile networks. The proposed
quantitative model incorporates many critical performance parameters involve in reducing the handover
time for wireless mobile networks. In addition, we analyze the use of active scanning technique with
comparatively shorter beacon interval time in a handoff process. Our experiments verify that the active
scanning can reduce the overall handover time at MAC layer if comparatively shorter beacon intervals are
utilized for packet transmission. The performance measures adopted in this paper for experimental
verifications are network throughput under different network loads.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Hamming net based Low Complexity Successive Cancellation Polar DecoderRSIS International
This paper aims to implement hybrid based Polar
encoder using the knowledge of mutual information and channel
capacity. Further a Hamming weight successive cancellation
decoder is simulated with QPSK modulation technique in
presence of additive white gaussian noise. The experimentation
performed with the effect of channel polarization has shown that
for 256- bit data stream, 30% channels has zero bit and 49%
channels are with a one bit capacity. The decoding complexity is
reduced to almost half as compared to conventional successive
cancellation decoding algorithm. However, the required SNR of
7 dB is achieved at the targeted BER of 10 -4. The penalty paid is
in terms of training time required at the decoding end.
Comparative Analysis of Distortive and Non-Distortive Techniques for PAPR Red...IDES Editor
OFDM is a popular and widely accepted modulation
and multiplexing technique in the area of wireless
communication. IEEE 802.15, a wireless specification defined
for WPAN is an emerging wireless technology for short range
multimedia applications. Two general categories of 802.15
are the low rate 802.15.4 (ZigBee) and high rate 802.15.3
(UWB). In their physical (PHY) layer design, OFDM is a
competing technique due to the various advantages it renders
in the practical wireless media. OFDM has been a popular
technique for many years and adopted as the core technique
in a number of wireless standards. It makes the system more
immune to interference like InterSymbol Interference (ISI)
and InterCarrier Interference (ICI) and dispersive effects of
the channel. It is also a spectrally efficient scheme since the
spectra of the signal are overlapping in nature. Despite these
advantages OFDM suffers from a serious problem of high
Peak to Average Power. This limits the system’s capabilities
and increases the complexity. This paper compares the signal
distortion technique of Amplitude Clipping and the
distortionless technique of SLM for Peak to Average Power
reduction
Improved Timing Estimation Using Iterative Normalization Technique for OFDM S...IJECEIAES
Conventional timing estimation schemes based on autocorrelation experience perfor- mance degradation in the multipath channel environment with high delay spread. To overcome this problem, we proposed an improvement of the timing estimation for the OFDM system based on statistical change of symmetrical correlator. The new method uses iterative normalization technique to the correlator output before the detection based on statistical change of symmetric correlator is applied. Thus, it increases the detection probability and achieves better performance than previously published methods in the multipath environment. Computer simulation shows that our method is very robust in the fading multipath channel.
Matrix Padding Method for Sparse Signal ReconstructionCSCJournals
Compressive sensing has been evolved as a very useful technique for sparse reconstruction of signals that are sampled at sub-Nyquist rates. Compressive sensing helps to reconstruct the signals from few linear projections of the sparse signal. This paper presents a technique for the sparse signal reconstruction by padding the compression matrix for solving the underdetermined system of simultaneous linear equations, followed by an iterative least mean square approximation. The performance of this method has been compared with the widely used compressive sensing recovery algorithms such as l1_ls, l1-magic, YALL1, Orthogonal Matching Pursuit, Compressive Sampling Matching Pursuit, etc.. The sounds generated by 3-blade engine, music, speech, etc. have been used to validate and compare the performance of the proposed technique with the other existing compressive sensing algorithms in ideal and noisy environments. The proposed technique is found to have outperformed the l1_ls, l1-magic, YALL1, OMP, CoSaMP, etc. as elucidated in the results.
A New Approach for Speech Enhancement Based On Eigenvalue Spectral SubtractionCSCJournals
In this paper, a phase space reconstruction-based method is proposed for speech enhancement. The method embeds the noisy signal into a high dimensional reconstructed phase space and uses Spectral Subtraction idea. The advantages of the proposed method are fast performance, high SNR and good MOS. In order to evaluate the proposed method, ten signals of TIMIT database mixed with the white additive Gaussian noise and then the method was implemented. The efficiency of the proposed method was evaluated by using qualitative and quantitative criteria.
A Subspace Method for Blind Channel Estimation in CP-free OFDM SystemsCSCJournals
In this paper, a subspace method is proposed for blind channel estimation in orthogonal frequency-division multiplexing (OFDM) systems over time-dispersive channel. The proposed method does not require a cyclic prefix (CP) and thus leading to higher spectral efficiency. By exploiting the block Toeplitz structure of the channel matrix, the proposed blind estimation method performs satisfactorily with very few received OFDM blocks. Numerical simulations demonstrate the superior performance of the proposed algorithm over methods reported earlier in the literature.
INTEGRATION OF MACHINE LEARNING TECHNIQUES TO EVALUATE DYNAMIC CUSTOMER SEGME...IJDKP
The telecommunications industry is highly competitive, which means that the mobile providers need a
business intelligence model that can be used to achieve an optimal level of churners, as well as a minimal
level of cost in marketing activities. Machine learning applications can be used to provide guidance on
marketing strategies. Furthermore, data mining techniques can be used in the process of customer
segmentation. The purpose of this paper is to provide a detailed analysis of the C.5 algorithm, within naive
Bayesian modelling for the task of segmenting telecommunication customers behavioural profiling
according to their billing and socio-demographic aspects. Results have been experimentally implemented.
Turbo Detection in Rayleigh flat fading channel with unknown statisticsijwmn
The turbo detection of turbo coded symbols over correlated Rayleigh flat fading channels generated
according to Jakes’ model is considered in this paper. We propose a method to estimate the channel
signal-to-noise ratio (SNR) and the maximum Doppler frequency. These statistics are required by
the linear minimum mean squared error (LMMSE) channel estimator. To improve the system convergence, we redefine the channel reliability factor by taking into account the channel estimation
error statistics. Simulation results for rate 1/3 turbo code and two different normalized fading rates
show that the use of the new reliability factor greatly improves the performance. The improvement
is more substantial when channel statistics are unknown.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance of cognitive radio networks with maximal ratio combining over cor...Polytechnique Montreal
In this paper, we apply the maximal ratio combining (MRC) technique to achieve higher detection probability in cognitive radio networks over correlated Rayleigh fading channels. We present a simple approach to derive the probability of detection in closed-form expression. The numerical results reveal that the detection performance is a monotonically increasing function with respect to the number of antennas. Moreover, we provide sets of complementary receiver operating characteristic (ROC) curves to illustrate the effect of antenna correlation on the sensing performance of cognitive radio networks employing MRC schemes in some respective scenarios.
Analysis of Space Time Codes Using Modulation TechniquesIOSR Journals
Abstract: In this Paper, Analysis of channel codes for improving the data rate and reliability of communication over fading channels using multiple transmit antennas has been considered. The codes, namely ’Space Time Codes’ render full diversity and amend coding gain. Performance criteria for designing such codes, under this assumption that the fading is slow and nonselective frequency, is also analysed. Under this research, Study of Frame Error Rate(FER) and outage capacity is compared for different no. Of transmit and receive antennas as well as for different modulation techniques. According to theoretical results FER decreases with increasing SNR and No. Of receiving antennas. Numerical and practical result shows that FER decreases with increasing SNR and no. Of receiving antennas. Keywords: Space time Block Codes ,Space time trellis Codes,Frame Error Rate(FER),Outage capacity,Pairwise Error Probability
BER Performance of MU-MIMO System using Dirty Paper CodingIJEEE
In this paper Dirty Paper Coding for communication system is implemented. MIMO application that involves devices such as cell phones, pocket PCs require closely spaced antenna, which suffers from mutual coupling among antennas and high spatial correlation for signals. DPC is used for compensating the degradation due to correlation and mutual coupling.
Multi-carrier Equalization by Restoration of RedundancY (MERRY) for Adaptive ...IJNSA Journal
This paper proposes a new blind adaptive channel shortening approach for multi-carrier systems. The performance of the discrete Fourier transform-DMT (DFT-DMT) system is investigated with the proposed DST-DMT system over the standard carrier serving area (CSA) loop1. Enhanced bit rates demonstrated and less complexity also involved by the simulation of the DST-DMT system.
A review of literature shows that there is a variety of adaptive filters. In this research study, we propose a new type of an adaptive filter that increases the diversification used to compensate the chan-nel distortion effect in the MC-CDMA transmission. First, we show the expressions of the filter’s impulse responses in the case of a perfect channel. The adaptive filter has been simulated and experienced by blind equalization for different cases of Gaussian white noise in the case of an MC-CDMA transmission with orthogonal frequency baseband for a mobile radio downlink channel Bran A. The simulation results show the performance of the proposed identification and blind equalization algorithm for MC-CDMA transmission chain using IFFT.
In this paper, we analyzed a numerical evaluation of the performance of MIMO radio systems in the LTE network environment. Downlink physical layer of the OFDM-MIMO based radio interface is considered for system model and a theoretical analysis of the bit error rate of the two space-time codes (SFBC 2×1 and FSTD 4×2 codes are adopted by the LTE norm as a function of the signal to noise ratio. Analytical expressions are given for transmission over a Rayleigh channel without spatial correlation which is then compared with Monte-Carlo simulations. Further evaluated channel capacity and simulation results show throughput almost reaches to the capacity limit.
Performance of Wideband Mobile Channel with Perfect Synchronism BPSK vs QPSK ...Editor Jacotech
Direct-sequence code-division multiple access (DS-CDMA) is
currently the subject of much research as it is a promising
multiple access capability for third and fourth generations
mobile communication systems. The synchronous DS-CDMA
system is well known for eliminating the effects of multiple
access interference (MAI) which limits the capacity and
degrades the BER performance of the system. In this paper,
we investigate the bit error rate (BER) performance of a
synchronous DS-CDMA system over a wideband mobile
radio channel. The BER performance is affected by the
difference in path length ΔL and the number of arriving
signals N. Furthermore, the effect of these parameters is
examined on the synchronous DS-CDMA system for different
users’ number as well as different processing gain Gp. In this
environment and under the above conditions the performances
of the BPSK (Binary Phase Shift Keying) and the QPSK
(Quadrature Phase Shift Keying) modulations are compared.
The promising simulation results showed the possibility of
applying this system to the wideband mobile radio channel.
Channel and clipping level estimation for ofdm in io t –based networks a reviewIJARIIT
Internet of Things (IoT) is the idea to connect all devices to the internet. To implement such systems, we need to design
low cost and less complex transmitters and make the receiver side complex. Now days OFDM is mainly used for communication
due to its great advantages. But it faces the main problem such as PAPR due to the non-linear performance of High power
amplifiers. There are so many methods are available to reduce the effect of PAPR in OFDM transmission, among this clipping
is the simplest one. In this paper, we propose two algorithms to find the clipping level as well as the channel estimation. The
efficiency of these algorithms is evaluated by using CLRB calculation.
Iterative Soft Decision Based Complex K-best MIMO DecoderCSCJournals
This paper presents an iterative soft decision based complex multiple input multiple output (MIMO) decoding algorithm, which reduces the complexity of Maximum Likelihood (ML) detector. We develop a novel iterative complex K-best decoder exploiting the techniques of lattice reduction for 8×8 MIMO. Besides list size, a new adjustable variable has been introduced in order to control the on-demand child expansion. Following this method, we obtain 6.9 to 8.0 dB improvement over real domain K-best decoder and 1.4 to 2.5 dB better performance compared to iterative conventional complex decoder for 4th iteration and 64-QAM modulation scheme. We also demonstrate the significance of new parameter on bit error rate. The proposed decoder not only increases the performance, but also reduces the computational complexity to a certain level.
An Energy-Efficient Dual Hop Cooperative Relay Model With Best Relay Selectioninventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
A new look on performance of small-cell network with design of multiple anten...journalBEEI
A downlink of small-cell network is studied in this paper studies in term of outage performance. We benefit by design of multiple antennas at the base station and fullduplex transmission mode. The scenario of multiple surrounded small-cell networks is considered to look the impact of interference. We derive the closed-form expression of outage probability to show performance of mobile user. We investigate target rate is main factor affecting to outage performance. According to the considered system, simulation results indicate reasonable value of outage probability and throughput as well. Finally, Monte-Carlo simulation method is deployed to determine exactness of main results found in this article. Finally, the considered system can exhibit improved performance if controlling interference term.
BER Analysis for Downlink MIMO-NOMA Systems over Rayleigh Fading ChannelsIJCNCJournal
The Multiple-input multiple-output (MIMO) technique combined with non-orthogonal multiple access (NOMA) has been considered to enhance total system performance. This paper studies the bit error rate of two-user power-domain NOMA systems using successive interference cancellation receivers, with zeroforcing equalization over quasi-static Rayleigh fading channels. Successive interference cancellation technique at NOMA receivers has been the popular research topic due to its simple implementation, despite its vulnerability to error propagation. Closed-form expressions are derived for downlink NOMA in single-input single-output and uncorrelated quasi-static MIMO Rayleigh fading channel. Analytical results are consolidated with Monte Carlo simulation.
BER ANALYSIS FOR DOWNLINK MIMO-NOMA SYSTEMS OVER RAYLEIGH FADING CHANNELSIJCNCJournal
The Multiple-input multiple-output (MIMO) technique combined with non-orthogonal multiple access (NOMA) has been considered to enhance total system performance. This paper studies the bit error rate of two-user power-domain NOMA systems using successive interference cancellation receivers, with zeroforcing equalization over quasi-static Rayleigh fading channels. Successive interference cancellation technique at NOMA receivers has been the popular research topic due to its simple implementation, despite its vulnerability to error propagation. Closed-form expressions are derived for downlink NOMA in single-input single-output and uncorrelated quasi-static MIMO Rayleigh fading channel. Analytical results are consolidated with Monte Carlo simulation.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
Bounds on the Achievable Rates of Faded Dirty Paper Channel
1. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
DOI: 10.5121/ijcnc.2017.9108 71
Bounds on the Achievable Rates of Faded Dirty
Paper Channel
Zouhair Al-qudah1
, Wael Abu Shehab2
1
Department of Communication Engineering, Al-Hussein Bin Talal University, Ma’an,
Jordan
2
Department of Electrical Engineering, Al-Hussein Bin Talal University, Ma’an, Jordan
ABSTRACT
Bounds on the achievable rate of a Gaussian channel in the case that the transmitter knows the
interference signal but not its fading coefficients are given. We generalize the analysis which were studied
in [1] and [4] so that their results are special cases of our analysis. We enforce our bounds by simulations
in which many numerical examples are drawn and investigated under different cases.
KEYWORDS
Dirty paper coding, lattice encoding and decoding, fading channel, Viterbi Algorithm.
1. INTRODUCTION
Dirty paper coding (DPC) is a communication model deals with Gaussian noise non-causally
known at the transmitter. In this communication model, an encoding technique is used with such a
noise such that its effects can be cancelled completely as Costa showed in his valued paper. The
received signal, Y , is decribed as
ZSXY ++= (1)
where is the transmitted signal and its average power is constrained by XPXE ≤][ 2
. Further,
is the interference non-causally known signal at the transmitter and with power constrained by
SPSE ≤][ 2
. In addition, is the additive white Gaussian noise vector (AWGN), with average
power ZP . DPC has a wide variety of applications includes MIMO broadcast channel where a
perfect knowledge of the interference is available, information hiding and digital watermarking.
In [6], Costa showed that the capacity for this channel doesn’t change when the interference is
non-causally known at the transmitter, and later in [9], they generalize this result for an arbitrary
interference distribution if the noise is Gaussian that is,
2. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
72
+=
Z
X
P
P
C 1log
2
1
2 (2)
In [1], the authors studied the channel model in the case that a lack of interference phase
knowledge at the transmitter, that is where is quasi static and random. In
[theorem (1),[1]], the authors derived an upper bound of the capacity when the phase takes one
of the two values . That is the transmitter does not know the interference in perfect,
instead, it has to select between two points. In [7], they showed that in such a situation, the
system is equivalent to a transmitter wants to send a message simultaneously to two receivers
where each channel add a different interference. Also, the authors in [1] derived an upper bound
on the outage capacity (corollary 1) when the interferer signal has constant magnitude fading.
In [4], the autors followed [1] and studied the compound channel formulation instead of outage
probabilities. In particular, they derived lower and upper bounds on the achievable bounds when
the interference phase is unknown at the transmitter. Their derivation based on an adaption of the
nested lattice approach that is described in [5] for the classic non fading channel and in [3] for the
case of magnitude fading.
In [2], the authors generalized Costa’s formulation, by multiplying and by random fading
coefficients and , respectively, in which the realizations are known only to the receiver.
In addition, they modelled the coefficients as quasi static and assumed that these coefficients are
real valued Rician random variables. (The power inflation factor becomes zero when the fading
coefficients have zero mean, so, they consider the Rician fading channel). They studied the
achievable outage probabilities when the interference signal is known to the transmitter but not
the fading coefficients.
In [3], the authors considered a similar formulation where was constant and was real
valued and random. That is where . Further, a lower bound
is given when the power inflation factor is deterministic and an upper bound is given when the
power inflation factor at the transmitter is random under the following conditions ,
, that is noise free channel, their analysis based on lattice based coding
scheme. In their work, they showed that proactively injecting randomness into the transmission
strategy can produce substantial benefits.
In this paper, we generalize the results of [1,3,4] where we assume that the transmitter has lack of
magnitude and phase knowledge. We refer to such a situation as the faded dirty paper channel(F-
DPC). In this case, the received signal can be modelled as follows
ZhSXY ++= (3)
where h is a random quasi static fading parameter, and it is given by φ
γ j
eh = . The channel has
to support different transmission rates depending on how the fading parameter h varies, where h
can vary in magnitude or phase or both. We extend the lower bound derived in [4] and generalize
the upper bound that were firstly proposed in [1] for a predetermined values of φ and then
generalized to an arbitrary value of φ in [4].
3. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
73
The rest of this paper is organized as follows, we review the principles of lattice dirty paper
coding in Section 2. Lower bounds and upper bounds are presented in Section 3. Bounds are
simulated and discussed in Section 4. Finally, we conclude our paper in Section 5.
2. LATTICE DIRTY PAPER CODING: DEFINITIONS AND PRELIMINARIES
Lattices are firstly used in [5] to achieve the capacity of dirty paper channel. Let Λ be a k-
dimensional lattice with fundamental Voronoi region υ with average second moment
XPP =Λ)( and normalized second moment
k
V
P
G 1
)(
)(
Λ
=Λ where )(υVolV = , then the lattice
transmission procedure is as follows, [5,8]. At first, the sender generates the signal
Λ−−= mod][ dScX α where the input alphabet X is restricted to υ . Further, the Λmod is
defined as )(mod uQuu Λ−=Λ where )(uQΛ is the lattice vector that is nearest to
u inters of the Euclidean distance. At the receiver, the destination computes
Λ+= mod]['
dYY α such that the received signal is reduced to
Λ+= mod][ ''
ZcY where the total noise at the destination is described by
Λ+−= mod])1[('
ZdZ αα .
3. BOUNDS OF FADED DIRTY PAPER CHANNEL
In this section, a lower bound and an upper bound on the achievable rates are derived when the
transmitter knows the interference non-causally but not the fading coefficients, that is the channel
adds faded interference.
3.1. Lower Bound
We follow [4] in which the signal has a block of n bits long. Then, each block is divided into k
blocks where every block contains kn bits. A k dimensional lattice is used to construct the
transmitted signal at each time block, the lattice is defined over complex number field. The
encoding and decoding procedures are as follows. In this procedure, by using modulo lattice
channel encoding scheme, the phase faded AWGN noise channel is converted such that it
contains only the transmitted codeword and the total noise over this channel. In this case, the
transmitted signal is given by
Λ−−= mod][ iiiii dscx α (4)
for knii ,,1, L= . In addition, ic , is and id are the symbols of codeword covers the intended
signal, interference signal and the dither signal at time i , respectively. The minimization factor
α can be selected randomly as in [4] or to be selected as )( ZXX PPP +=α [3,5,8]. This is
because the encoder does not have knowledge of the realizations h and φ . The destination
4. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
74
computes Λ+= mod]['
iiii dyy β where iβ is the noise minimization factor computed at the
receiver and differs than iα and it will be determined later. Here, '
iy is evaluated as follows:
Λ+= mod]['
iiii dyy β
Λ+++= mod][ iii
j
iii dzex βγββ φ
Λ−+++−−+= mod][ iiii
j
iiiiii sdzedxcx αβγββ φ
Λ+−+−−= mod])()1([ iii
j
iiii zsexc βαγββ φ
(5)
In (5), the received signal contains i) the transmitted codeword ic at time i , and ii) the total
noise iii
j
iiii zsexz βαγββ φ
+−+−−= )()1( . This total noise is independent of ic . In
addition, the components ix , is , and iz are assumed to be independent of ic due to the
dither signal. So, for a given values of γα, and φ , the variance of the total noise is given by
+−+−= ZS
j
iXiZ PPePP
222'
1 βαγββ φ
(6)
where iβ is selected to minimize the variance of the effective noise. Then, '
ZP is minimized by
selecting iβ as
ZSX
S
j
X
i
PPP
PeP
++
+
=
−
2
γ
γα
β
φ
(7)
We denote ),,,('
φγβαZP the value of '
ZP in (6) computed at the value of iβ from (7). The
lower bound on the capacity for such a construction is given in [4] for phase faded dirty paper and
we extend to faded dirty paper channel. This lower bound is given by
Λ−
=
+
))((log
),,,(
log),,,( 2'2 eG
P
P
ER
Z
X
LB π
φγβα
φγβα α (8)
Where α is selected randomly with distribution known to the encoder and for any real value x ,
where [ ] ),0max( xx =
+
. A similar formulae was given in [3] for magnitude faded interference
when the value of α is constant and equal to )( ZXX PPP + . A lower bound ( )eG π1)( ≥Λ was
shown in [12,13] . This means that the second term in (11) is almost negative and its maximum
value is zero.
Remarks (1):
5. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
75
1. We note that the formulae in (10) can be reduced to that given in [4] in the case of
1=γ for phase faded. In addition, the formulae in (10) can be reduced to that given in
[3] for magnitude fading and 0=φ or to the case that the channel adds a perfect
interference without fading, that is βα = .
2. In the case of strong interference, the minimization factor is selected to cancel the
interference effects, that is φ
γαβ j
e−
= )( , and so the effective noise is reduced to
( )ZXiZ PPP
22'
1 ββ +−= .
3.2. Upper Bounds
We now analyze the achievable upper bound over faded dirty paper channel. Our bound is valid
for arbitrary h , where φ
γ j
eh −
= can vary in magnitude and phase. Further, we generalize
theorem (1,[4]) which was given for phase faded dirty paper channel. Our bound is given in the
following lemma
Lemma1: The capacity of the compound faded dirty paper channel is upper bounded by
≤
+−
>
+
=
υγγφφ
υ
γγφφ
S
Z
X
ZSX
S
Z
X
UB
P
P
P
PPPJ
P
P
P
R
1log
2
1
),,,,,,(min
1log
2
1
),,,(
22112
2
2121
(9)
where
( )( )
−−+
−
++
+
+
=−
1221
2
2
2
1
2
12
2
2
2
1
22112
cos2
2
cos2
2
log
2
1
),,,,,(
φφγγγγ
φφγγ
γγφφ
SZ
SXZSX
ZSX
PP
PPPPP
PPPJ
This bound is defined over arbitrary fading parameters iγ and iφ . In addition, this bound is
achieved by time sharing for the values of interference power such as υ>SP , where υ is a
parameter determined so that the bound is not an ascending function of SP . Also, the upper
bound can’t be larger than the AWGN channel capacity. The proof of this lemma is a direct
generalization of ( Theorem1, [4] ) and is omitted.
Remarks (2):
1. In the case that 121 == γγ , then, the formula in [4], which was derived for phase
faded dirty paper channel, is obtained.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
76
2. In the case that 121 == γγ , and o
18012 =−φφ , then, we obtain Eq(8) in [1].
4. SIMULATIONS AND DISCUSSIONS
We start our discussion by comparing the upper bound and lower bound for faded (magnitude,
phase, or combined) dirty paper channel. The following values dBPX 12= and dBPZ 0= are
used. In addition, the bounds are plotted as a function of .SP
Figure.1 compares among magnitude, phase and combined of both for a choice of
( )πφφ == 21 ,0 and 2.121 == γγ . It shows that for values of dBPS 9≤ , the achievable rate
of the phase faded performs better than faded (magnitude and phase). For values of dBPS 9> ,
both bounds are achieved by time sharing, that is the channel capacity is achieved by time sharing
. We note also that the upper and lower bounds for magnitude fading coincide (for range under
consideration) and achieved by the time sharing. For lower bound with constant α , it was found
to be calculated as 0
^
φ
α j
e [4], where
^
α is determined by exhaustive search over a fine grid.
Further, 0φ is set to the mean of 1φ and 2φ . In addition γ is set to the mean of 1γ and 2γ .
For the lower bound with variable α , 0φ has a distribution that is independent ofφ . In addition,
this figure shows that for low values of SP , lower bound with constant α doing better than
variable α . These bounds coincide when SP increases and finally they reach their final values
where the lower bound is achieved by time sharing.
Figure 1. Bounds for dirty paper channel.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
77
In an another example, Figure.2 shows the same bounds when the magnitude fading parameters
are changed to 2.11 =γ and 22 =γ . It shows that the gap between the upper bounds for phase
faded and faded interference is larger than the previous case due magnitude fading parameter. It
shows also that the gap between the lower and upper bounds is slightly less than the previous
case. Lower bound with variableα is better than with constant α . Again for values of
dBPS 9> , the bounds can coincide and the channel capacity is achieved by time sharing. Again
for only magnitude fading, the bounds coincide and are achieved by time sharing and so the
channel capacity.
Figure.3 shows the same bounds for )
3
2
,0( 21 πφφ == , and 221 == γγ . It shows that the gap
between the upper bounds with phase faded and faded dirty paper channel larger than the
previous cases due to increasing the magnitude of the fading parameter. Lower bound is achieved
by time sharing for values of dBPS 0> while the upper bound is higher. Discussion of lower
bounds as in the first case just the point of achieving this bound by time sharing is changing from
a case to another as we mentioned in section III.B .
Figure 2. Bounds for dirty paper channel.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
78
Figure 3. Bounds for dirty paper channel.
5. CONCLUSİONS
The faded dirty paper channels with arbitrary coefficients have been studied. The results in [1]
and [4] have been generalized. We show our bounds by simulations for different cases. We have
studied also the performance of faded dirty paper channel and we have showed how the system
performance changed when the interference is faded.
REFERENCES
[1] P. Grover and A. Sahai,(2007) “What is needed to exploit knowledge of primary transmissions?,”
available at arXiv:cs/0702071.
[2] P.Mitran,N.Devroye and V.Tarokh, (2006) “ On Compound Channels with Side Information at the
Transmitter”, IEEE Trans. on Info. Theory, vol. 52, no. 4, pp. 1745-1755.
[3] A.Khina and U.Erez, (2010)“On the Robustness of Dirty Paper Coding”, IEEE Trans. on Comm.,
vol. 58, no. 5, pp. 1437-1446.
[4] A.Bennatan,V.Aggarwal,Y.Wu,A.R.Calderbank,J.Hoydis ,and A.Chindapol, (2007) “Bounds and
Lattice-Based Transmission Strategies for the Phase-Faded Dirty-Paper Channel”, IEEE Trans.
on Wireless Comm., vol. 8, no. 7, pp. 3620-3627.
[5] U. Erez, S. Shamai and R. Zamir, (2005) “Capacity and Lattice-Strategies for Cancelling Known
Interference,” IEEE Trans. on Inform. Theory, vol. 51, no. 11, pp. 3820-3833.
[6] M.Costa, (1983) “Writing on Dirty Paper”,IEEE Trans. On Information theory,vol 29,no.3,pp 439-
441.
[7] A.Cohen and A.Lapidoth, (2002) “The Gaussian watermarking game”,IEEE Trans. Info. Theory
vol.48, pp.1639-1667.
[8] A.Cohen and A.Lapidoth, (2002) “The Gaussian watermarking game”,IEEE Trans. Info. Theory
vol.48 ,pp.1639-1667
[9] U. Erez, S. Shamai (Shitz), and R. Zamir,(2005) “Capacity and lattice strategies for cancelling known
interference,” IEEE Trans. Information. Theory, vol. 51, pp. 3820–3833.
[10] G.D.Forney, (1988) “Coset Codes-Part I:Introduction and Geometrical Clasifications”, IEEE Trans.
On Information Theory , vol. 34, no. 5, pp. 1123-1151
9. International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.1, January 2017
79
[11] R. Zamir, (2009) "Lattices are Everywhere'', Information Theory and Applications (ITA09),
University of California at San Diego, pp. 392-421.
[12] R.Zamir,S.Shamai and U.Erez, (2002) ”Nested Linear /Lattice codes for structured multidimensional
binning”,IEEE Trans. On Information Theory, vol. 48, no. 6, pp. 1250-1276.
[13] R.Zamir and M.Ferder, (1996) ”On lattice quantization noise “, IEEE Trans. On Information
Theory,vol 42,no.4,pp1152-1159.
[14] U.Erez and S.t,Brink, (2005) “A close-to-capacity Dirty Paper Coding Scheme”, IEEE Trans. on
Information Theory, vol. 51, no. 10, pp. 3417-3432.
[15] M.Mzaaotti and M.Chiani, (2006)“A simple rate ½ co-decoding scheme for Writing on Dirty
Paper”, IEEE International Conference on Communications, Istanbul, pp. 1622-1627.
[16] G.B.Kyung and C. Wang, (2009) “On the Design and Challenges of Practical Binary Dirty Paper
Coding”, on the proceeding of 2009 IEEE Wireless Communications and Networking
Conference, Budapest, pp. 1-6..
[17] J.Chen and M.Fossorier, (2002)“Near optimum Universal Belief propogation Based Decoding of
Low-Density Parity Check Codes”, IEEE Trans. on Communications, vol. 50, no. 3, pp. 406-414.