ma112008id371
•Download as PPT, PDF•
0 likes•368 views
The document proposes a new multiuser detection algorithm for CDMA based on the belief propagation algorithm. It develops a factor graph that represents the posterior distribution of information bits in a way that reduces the number of cycles compared to previous factor graphs. Numerical simulations show the proposed belief propagation algorithm outperforms the parallel interference canceller detector, especially for signature sequences that produce factor graphs with fewer cycles and weaker cross-correlations between users. The approach shows promise for application to other communication systems.
Report
Share
Report
Share
![Research background ,[object Object],[object Object],Demand :Sub-optimal Low-complexity detector ,[object Object],[object Object],[object Object],[object Object],[object Object],Computational complexity increases with the number of users](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Predicting churn in telco industry: machine learning approach - Marko Mitić
Predicting churn in telco industry: machine learning approach - Marko MitićInstitute of Contemporary Sciences
On this presentation we will have an opportunity to see how can we predict churn in telco industry. Marko will tell us how he done this at Telenor Srbija. Evolving CSP Algorithm in Predicting the Path Loss of Indoor Propagation Models
Constraint programming is the study of system which is based on constraints. The solution of a constraint satisfaction problem is a set of
variable value assignments, which satisfies all members of the set of constraints in the CSP. In this paper the application of constraint satisfaction
programming is used in predicting the path loss of various indoor propagation models using chronological backtrack algorithm, which is basic
algorithm of CSP. After predicting the path loss at different set of parameters such as frequencies (f), floor attenuation factor (FAF), path loss
coefficient (n), we find the optimum set of parameter frequency (f), floor attenuation factor (FAF), path loss coefficient(n) at which the path loss is
minimum. The Branch and bound algorithm is used to optimize the constraint satisfaction problem.
29fe586301a42c2d2e7279d658da178ae1e6
1) The document discusses hybrid beamforming (HB) for downlink multiuser massive MIMO systems with frequency selective channels. It aims to quantify the number of RF chains and phase shifters needed for HB to achieve the same performance as digital beamforming (DB), which uses N RF chains.
2) The paper shows that HB can achieve the same performance as DB using rt RF chains and 2rt(N − rt + 1) phase shifters, where rt is the rank of the combined digital precoder matrices across subcarriers. Additionally, it provides a method to reduce the number of phase shifters with negligible performance loss.
3) For the scenario where the number of deployed RF chains (Na)
ma112006id337
The document proposes reducing the computational complexity of message passing algorithms like belief propagation (BP) and concave-convex procedure (CCCP) for multiuser detection in CDMA systems. It does this by changing the factor graph structure used to represent the detection problem from a fully connected graph (Factor Graph I) to a sparsely connected graph (Factor Graph II). Simulation results show the proposed CCCP detector for the new factor graph achieves near optimal performance with lower complexity than existing approaches.
first_assignment_Report
This document discusses intra-frame compression using Huffman and arithmetic entropy coding techniques. It implements both techniques in MATLAB on two test images and evaluates the results. Huffman coding performed slightly better, with lower bit rates and higher compression rates. However, arithmetic coding would likely perform better on images with larger symbol dictionaries or alphabets due to its adaptive modeling capabilities. Both techniques achieved high efficiency for the test images.
data compression technique
There are two categories of data compression methods: lossless and lossy. Lossless methods preserve the integrity of the data by using compression and decompression algorithms that are exact inverses, while lossy methods allow for data loss. Common lossless methods include run-length encoding and Huffman coding, while lossy methods like JPEG, MPEG, and MP3 are used to compress images, video, and audio by removing imperceptible or redundant data.
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
F0331031037
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Recommended
Predicting churn in telco industry: machine learning approach - Marko Mitić
Predicting churn in telco industry: machine learning approach - Marko MitićInstitute of Contemporary Sciences
On this presentation we will have an opportunity to see how can we predict churn in telco industry. Marko will tell us how he done this at Telenor Srbija. Evolving CSP Algorithm in Predicting the Path Loss of Indoor Propagation Models
Constraint programming is the study of system which is based on constraints. The solution of a constraint satisfaction problem is a set of
variable value assignments, which satisfies all members of the set of constraints in the CSP. In this paper the application of constraint satisfaction
programming is used in predicting the path loss of various indoor propagation models using chronological backtrack algorithm, which is basic
algorithm of CSP. After predicting the path loss at different set of parameters such as frequencies (f), floor attenuation factor (FAF), path loss
coefficient (n), we find the optimum set of parameter frequency (f), floor attenuation factor (FAF), path loss coefficient(n) at which the path loss is
minimum. The Branch and bound algorithm is used to optimize the constraint satisfaction problem.
29fe586301a42c2d2e7279d658da178ae1e6
1) The document discusses hybrid beamforming (HB) for downlink multiuser massive MIMO systems with frequency selective channels. It aims to quantify the number of RF chains and phase shifters needed for HB to achieve the same performance as digital beamforming (DB), which uses N RF chains.
2) The paper shows that HB can achieve the same performance as DB using rt RF chains and 2rt(N − rt + 1) phase shifters, where rt is the rank of the combined digital precoder matrices across subcarriers. Additionally, it provides a method to reduce the number of phase shifters with negligible performance loss.
3) For the scenario where the number of deployed RF chains (Na)
ma112006id337
The document proposes reducing the computational complexity of message passing algorithms like belief propagation (BP) and concave-convex procedure (CCCP) for multiuser detection in CDMA systems. It does this by changing the factor graph structure used to represent the detection problem from a fully connected graph (Factor Graph I) to a sparsely connected graph (Factor Graph II). Simulation results show the proposed CCCP detector for the new factor graph achieves near optimal performance with lower complexity than existing approaches.
first_assignment_Report
This document discusses intra-frame compression using Huffman and arithmetic entropy coding techniques. It implements both techniques in MATLAB on two test images and evaluates the results. Huffman coding performed slightly better, with lower bit rates and higher compression rates. However, arithmetic coding would likely perform better on images with larger symbol dictionaries or alphabets due to its adaptive modeling capabilities. Both techniques achieved high efficiency for the test images.
data compression technique
There are two categories of data compression methods: lossless and lossy. Lossless methods preserve the integrity of the data by using compression and decompression algorithms that are exact inverses, while lossy methods allow for data loss. Common lossless methods include run-length encoding and Huffman coding, while lossy methods like JPEG, MPEG, and MP3 are used to compress images, video, and audio by removing imperceptible or redundant data.
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
F0331031037
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
IRJET- Structured Compression Sensing Method for Massive MIMO-OFDM Systems
The document presents a structured compression sensing method for massive MIMO-OFDM systems called Priori information-assisted adaptive structured subspace pursuit (PA-ASSP) algorithm. PA-ASSP aims to improve channel estimation accuracy with reduced complexity compared to existing algorithms like adaptive structured subspace pursuit (ASSP). It initializes channel estimation using prior information and exploits common sparsity of MIMO channels across OFDM symbols. Simulation results show PA-ASSP achieves better bit error rate and normalized mean square error performance than ASSP and other algorithms under different SNR levels.
Data compression
This document provides an overview of data compression techniques. It discusses lossless compression algorithms like Huffman encoding and LZW encoding which allow for exact reconstruction of the original data. It also discusses lossy compression techniques like JPEG and MPEG which allow for approximate reconstruction for images and video in order to achieve higher compression rates. JPEG divides images into 8x8 blocks and applies discrete cosine transform, quantization, and run length encoding. MPEG spatially compresses each video frame using JPEG and temporally compresses frames by removing redundant frames.
Performance analysis of image compression using fuzzy logic algorithm
With the increase in demand, product of multimedia is increasing fast and thus contributes to insufficient
network bandwidth and memory storage. Therefore image compression is more significant for reducing
data redundancy for save more memory and transmission bandwidth. An efficient compression technique
has been proposed which combines fuzzy logic with that of Huffman coding. While normalizing image
pixel, each value of pixel image belonging to that image foreground are characterized and interpreted. The
image is sub divided into pixel which is then characterized by a pair of set of approximation. Here
encoding represent Huffman code which is statistically independent to produce more efficient code for
compression and decoding represents rough fuzzy logic which is used to rebuilt the pixel of image. The
method used here are rough fuzzy logic with Huffman coding algorithm (RFHA). Here comparison of
different compression techniques with Huffman coding is done and fuzzy logic is applied on the Huffman
reconstructed image. Result shows that high compression rates are achieved and visually negligible
difference between compressed images and original images
Compression techniques
This document discusses different compression techniques including lossless and lossy compression. Lossless compression recovers the exact original data after compression and is used for databases and documents. Lossy compression results in some loss of accuracy but allows for greater compression and is used for images and audio. Common lossless compression algorithms discussed include run-length encoding, Huffman coding, and arithmetic coding. Lossy compression is used in applications like digital cameras to increase storage capacity with minimal quality degradation.
Data compression
This document discusses data compression algorithms including lossless and lossy methods. It defines lossless compression as allowing perfect reconstruction of the original data and lossy compression as permitting only approximate reconstruction. Specific lossless methods covered are run-length encoding, Huffman coding, and Lempel-Ziv encoding. Lossy methods discussed are JPEG compression for images, discrete cosine transform, and MPEG video compression. The document concludes that the presented approach of using the Hartley transform for image compression with separate magnitude and phase processing achieved good performance.
Entropy
This document is an introduction to Claude Shannon's seminal 1948 paper "A Mathematical Theory of Communication". It provides an overview of communication systems and introduces Shannon's concept of using a logarithmic measure to quantify information. Specifically:
1) It defines the key components of a general communication system including an information source, transmitter, channel, receiver, and destination.
2) It explains Shannon's proposal to use a logarithmic measure (typically base 2, resulting in units called "bits") to quantify the information content of messages. This provides a convenient way to measure the capacity of communication channels.
3) It outlines Shannon's plan to develop a mathematical theory of communication by modeling different types of systems - discrete, continuous,
info
This document introduces a mathematical theory of communication developed by Claude Shannon. It begins with an overview of communication systems and their components. Shannon then defines the capacity of a discrete channel as the maximum rate at which information can be transmitted, which is the logarithm of the number of possible signals over time. He examines discrete noiseless systems and sources of information, explaining how the statistical structure of messages can be used to reduce the required channel capacity through proper encoding.
Hufman coding basic
In this slide i hd presented basic about hufman coding.this wil gv some idea about hufman coding using binary tree.
IRJET- The RTL Model of a Reconfigurable Pipelined MCM
This document presents two Register Transfer Level (RTL) models for a reconfigurable pipelined multiple constant multiplier (MCM) architecture. The first model uses a ripple carry adder, while the second model replaces it with a carry lookahead adder. Both models are constructed using Verilog and simulated using ModelSim. Simulation results show the second model has a 3.53% higher maximum clock frequency and throughput due to the faster carry lookahead adder. It also has 3.53% lower latency but uses 1.65% more power. The second model provides faster performance with moderate increases in resource usage and power consumption.
Novel design algorithm for low complexity programmable fir filters based on e...
Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Nagar, Chennai-83. Landmark: Next to Kotak Mahendra Bank/Bharath Scans
Landline: (044) - 43012642 / Mobile: (0)9952649690
Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry - 9
Landmark: Opp. to Thattanchavady Industrial Estate & Next to VVP Nagar Arch.
Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690
Image compression
This document summarizes image compression techniques. It discusses:
1) The goal of image compression is to reduce the amount of data required to represent a digital image while preserving as much information as possible.
2) There are three main types of data redundancy in images - coding, interpixel, and psychovisual - and compression aims to reduce one or more of these.
3) Popular lossless compression techniques, like Run Length Encoding and Huffman coding, exploit coding and interpixel redundancies. Lossy techniques introduce controlled loss for further compression.
Some Studies on Different Power Allocation Schemes of Superposition Modulation
Superposition Modulation/Mapping (SM) is a newly
evolving modulation technique in which the conversion from
binary digits to symbols is done by linear superposition of the
binary digits instead of bijective (one-to-one) mapping. Due
to linear superposition, the symbol distribution of the data
symbols thus formed are Gaussian shaped which is capacity
achieving without active signal shaping. In this paper, a detailed
study on SM has been presented with respect to its different
power allocation schemes namely Equal Power Allocation
(EPA), Unequal Power Allocation (UPA) and Grouped Power
Allocation (GPA). Also, it has been shown that SM is more
capacity achieving than the conventional modulation
technique such as Quadrature Amplitude Modulation (QAM)
COMPARING VARIOUS CHANNEL ESTIMATION TECHNIQUES FOR OFDM SYSTEMS USING MATLAB
This document compares the performance of five channel estimation techniques for OFDM systems over quasi-static channels using MATLAB simulations. The techniques evaluated are: decision directed (DD), linear interpolation, second-order interpolation, discrete Fourier transform (DFT) interpolation, and minimum mean square error (MMSE) interpolation. Simulation results show that DD channel estimation provides the lowest bit-error rate and mean square error, but has extra processing delay and is sensitive to channel variations. MMSE interpolation outperforms the other interpolation techniques.
Compression
The document discusses different types of data compression techniques. It explains that compression reduces the size of data to reduce bandwidth and storage requirements when transmitting or storing audio, video, and images. It describes how compression works by exploiting redundancies in the data as well as properties of human perception. Various compression methods are outlined, including lossless techniques that preserve all information as well as lossy methods for audio and video that can tolerate some loss of information. Specific algorithms discussed include Huffman coding, run-length coding, LZW coding, and arithmetic coding. The document also provides details on JPEG image compression and MPEG video compression standards.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMS
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
Nsl seminar(2)
1. The document proposes a low-overhead uplink scheduling method for real-time services in WiMAX networks using load prediction to reduce scheduling overhead. It uses an Earlier Deadline First (EDF) scheduling algorithm and adaptive bandwidth scheduling scheme.
2. The method includes three modules: an information module to collect data on connection delays and bandwidth requirements, a scheduling database module to store this information, and a service assignment module to determine uplink subframe allocation.
3. Simulation results show the proposed method achieves better performance than weighted fair queuing (WFQ) and weighted round-robin (WRR) in terms of frame utilization, average throughput, average queuing delay, and packet loss
Data compression
This document summarizes image compression techniques. It discusses why images need to be compressed to reduce file sizes and speed up transmission. It describes how digital images are composed of pixels and color components. The document then covers lossless compression algorithms like Run Length Encoding (RLE) and LZW, which use statistical redundancy or dictionaries to compress images without loss of information. It also mentions lossy compression techniques like quantization that can achieve higher compression ratios but result in some loss of visual quality.
Evaluation of STBC and Convolutional Code Performance for Wireless Communicat...
Under rich dissipating environment, Multiple Input Multiple Output (MIMO) scheme have better performance in term of reliability and increasing the throughput. Space Time Block Code (STBC) can reduce the Bit Error Rate (BER) with suitable data rate. In order to raise the amount of throughput more, high modulation order is used but it degrade the performance. To address this problem, a Convolutional Code (CC) can be support such system with various code rate to deal with different circumstances. This research is proposed a system with serial concatenation of STBC and CC with various modulation levels. Such system is tested with Rayleigh flat and selective fading channel by Matlab package R2015b with a list of modulation order and changing the code of each STBC and CC. The results show that such system can cover a range of Signal to Noise Ratio (SNR) from 0 to 21 dB of SNR for selective fading channel and -2 to 19 dBfor flat fading channel for a targeted BER of 10-4 with a various modulation index and code rate which lead to a flexible system to change the throughput depending on user conditions.
Shannon1948
1. The document summarizes Shannon's seminal paper on "A Mathematical Theory of Communication" which established information theory. It introduces discrete, continuous, and mixed communication systems and discusses measuring a channel's information capacity.
2. For discrete systems like telegraphy with a finite set of symbols, the channel capacity can be measured as the base-2 logarithm of the number of possible symbols transmitted per second.
3. The paper aims to develop a mathematical theory to represent communication systems and analyze factors like noise and message statistics to understand information transmission.
ALGORITHMS FOR PACKET ROUTING IN SWITCHING NETWORKS WITH RECONFIGURATION OVER...
Given a set of messages to be transmitted in packages from a set of sending stations to a set of
receiving stations, we are required to schedule the packages so as to achieve the minimum
possible time from the moment the 1st transmission initiates to the concluding of the last.
Preempting packets in order to reroute message remains, as part of some other packet to be
transmitted at a later time would be a great means to achieve our goal, if not for the fact that
each preemption will come with a reconfiguration cost that will delay our entire effort. The
problem has been extensively studied in the past and various algorithms have been proposed to
handle many variations of the problem. In this paper we propose an improved algorithm that we
call the Split-Graph Algorithm (SGA). To establish its efficiency we compare it, to two of the
algorithms developed in the past. These two are the best presented in bibliography so far, one in
terms of approximation ratio and one in terms of experimental results.
Multi user performance on mc cdma single relay cooperative system by distribu...
Increasing data rate and high performance is the target focus of wireless communication. The multi carrier on multi-hop communication system using relay's diversity technique which is supported by a reliable coding is a system that may give high performance. This research is developing a model of multi user and two scheme of multi carrier CDMA on multi hop communication system with diversity technique which is using Alamouti codes in Rayleigh fading channel. By Alamouti research, Space Time Block Code (STBC) for MIMO system can perform high quality signal at the receiver in the Rayleigh fading channel and the noisy system. In this research, MIMO by STBC is applied to single antenna system (Distributed-STBC/DSTBC) with multi carrier CDMA on multi hop wireless communication system (relay diversity) which is able to improve the received signal performance.
MC DS CDMA on multi hop wireless communication system with 2 hops is better performing than MC CDMA on multi user without Multi User Detector. To reach BER 10-3 multi hop system with MC CDMA needs more power 5 dB than MC DS CDMA at 5 users using Alamouti scheme for symbol transmission at the relay.
ma112011id535
This document proposes a linear programming (LP) based approach for solving maximum a posteriori (MAP) estimation problems on factor graphs that contain multiple-degree non-indicator functions. It presents an existing LP method for problems with single-degree functions, then introduces a transformation to handle multiple-degree functions by introducing auxiliary variables. This allows applying the existing LP method. As an example, it applies this to maximum likelihood decoding for the Gaussian multiple access channel. Simulation results demonstrate the LP approach decodes correctly with polynomial complexity.
More Related Content
What's hot
IRJET- Structured Compression Sensing Method for Massive MIMO-OFDM Systems
The document presents a structured compression sensing method for massive MIMO-OFDM systems called Priori information-assisted adaptive structured subspace pursuit (PA-ASSP) algorithm. PA-ASSP aims to improve channel estimation accuracy with reduced complexity compared to existing algorithms like adaptive structured subspace pursuit (ASSP). It initializes channel estimation using prior information and exploits common sparsity of MIMO channels across OFDM symbols. Simulation results show PA-ASSP achieves better bit error rate and normalized mean square error performance than ASSP and other algorithms under different SNR levels.
Data compression
This document provides an overview of data compression techniques. It discusses lossless compression algorithms like Huffman encoding and LZW encoding which allow for exact reconstruction of the original data. It also discusses lossy compression techniques like JPEG and MPEG which allow for approximate reconstruction for images and video in order to achieve higher compression rates. JPEG divides images into 8x8 blocks and applies discrete cosine transform, quantization, and run length encoding. MPEG spatially compresses each video frame using JPEG and temporally compresses frames by removing redundant frames.
Performance analysis of image compression using fuzzy logic algorithm
With the increase in demand, product of multimedia is increasing fast and thus contributes to insufficient
network bandwidth and memory storage. Therefore image compression is more significant for reducing
data redundancy for save more memory and transmission bandwidth. An efficient compression technique
has been proposed which combines fuzzy logic with that of Huffman coding. While normalizing image
pixel, each value of pixel image belonging to that image foreground are characterized and interpreted. The
image is sub divided into pixel which is then characterized by a pair of set of approximation. Here
encoding represent Huffman code which is statistically independent to produce more efficient code for
compression and decoding represents rough fuzzy logic which is used to rebuilt the pixel of image. The
method used here are rough fuzzy logic with Huffman coding algorithm (RFHA). Here comparison of
different compression techniques with Huffman coding is done and fuzzy logic is applied on the Huffman
reconstructed image. Result shows that high compression rates are achieved and visually negligible
difference between compressed images and original images
Compression techniques
This document discusses different compression techniques including lossless and lossy compression. Lossless compression recovers the exact original data after compression and is used for databases and documents. Lossy compression results in some loss of accuracy but allows for greater compression and is used for images and audio. Common lossless compression algorithms discussed include run-length encoding, Huffman coding, and arithmetic coding. Lossy compression is used in applications like digital cameras to increase storage capacity with minimal quality degradation.
Data compression
This document discusses data compression algorithms including lossless and lossy methods. It defines lossless compression as allowing perfect reconstruction of the original data and lossy compression as permitting only approximate reconstruction. Specific lossless methods covered are run-length encoding, Huffman coding, and Lempel-Ziv encoding. Lossy methods discussed are JPEG compression for images, discrete cosine transform, and MPEG video compression. The document concludes that the presented approach of using the Hartley transform for image compression with separate magnitude and phase processing achieved good performance.
Entropy
This document is an introduction to Claude Shannon's seminal 1948 paper "A Mathematical Theory of Communication". It provides an overview of communication systems and introduces Shannon's concept of using a logarithmic measure to quantify information. Specifically:
1) It defines the key components of a general communication system including an information source, transmitter, channel, receiver, and destination.
2) It explains Shannon's proposal to use a logarithmic measure (typically base 2, resulting in units called "bits") to quantify the information content of messages. This provides a convenient way to measure the capacity of communication channels.
3) It outlines Shannon's plan to develop a mathematical theory of communication by modeling different types of systems - discrete, continuous,
info
This document introduces a mathematical theory of communication developed by Claude Shannon. It begins with an overview of communication systems and their components. Shannon then defines the capacity of a discrete channel as the maximum rate at which information can be transmitted, which is the logarithm of the number of possible signals over time. He examines discrete noiseless systems and sources of information, explaining how the statistical structure of messages can be used to reduce the required channel capacity through proper encoding.
Hufman coding basic
In this slide i hd presented basic about hufman coding.this wil gv some idea about hufman coding using binary tree.
IRJET- The RTL Model of a Reconfigurable Pipelined MCM
This document presents two Register Transfer Level (RTL) models for a reconfigurable pipelined multiple constant multiplier (MCM) architecture. The first model uses a ripple carry adder, while the second model replaces it with a carry lookahead adder. Both models are constructed using Verilog and simulated using ModelSim. Simulation results show the second model has a 3.53% higher maximum clock frequency and throughput due to the faster carry lookahead adder. It also has 3.53% lower latency but uses 1.65% more power. The second model provides faster performance with moderate increases in resource usage and power consumption.
Novel design algorithm for low complexity programmable fir filters based on e...
Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Nagar, Chennai-83. Landmark: Next to Kotak Mahendra Bank/Bharath Scans
Landline: (044) - 43012642 / Mobile: (0)9952649690
Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry - 9
Landmark: Opp. to Thattanchavady Industrial Estate & Next to VVP Nagar Arch.
Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690
Image compression
This document summarizes image compression techniques. It discusses:
1) The goal of image compression is to reduce the amount of data required to represent a digital image while preserving as much information as possible.
2) There are three main types of data redundancy in images - coding, interpixel, and psychovisual - and compression aims to reduce one or more of these.
3) Popular lossless compression techniques, like Run Length Encoding and Huffman coding, exploit coding and interpixel redundancies. Lossy techniques introduce controlled loss for further compression.
Some Studies on Different Power Allocation Schemes of Superposition Modulation
Superposition Modulation/Mapping (SM) is a newly
evolving modulation technique in which the conversion from
binary digits to symbols is done by linear superposition of the
binary digits instead of bijective (one-to-one) mapping. Due
to linear superposition, the symbol distribution of the data
symbols thus formed are Gaussian shaped which is capacity
achieving without active signal shaping. In this paper, a detailed
study on SM has been presented with respect to its different
power allocation schemes namely Equal Power Allocation
(EPA), Unequal Power Allocation (UPA) and Grouped Power
Allocation (GPA). Also, it has been shown that SM is more
capacity achieving than the conventional modulation
technique such as Quadrature Amplitude Modulation (QAM)
COMPARING VARIOUS CHANNEL ESTIMATION TECHNIQUES FOR OFDM SYSTEMS USING MATLAB
This document compares the performance of five channel estimation techniques for OFDM systems over quasi-static channels using MATLAB simulations. The techniques evaluated are: decision directed (DD), linear interpolation, second-order interpolation, discrete Fourier transform (DFT) interpolation, and minimum mean square error (MMSE) interpolation. Simulation results show that DD channel estimation provides the lowest bit-error rate and mean square error, but has extra processing delay and is sensitive to channel variations. MMSE interpolation outperforms the other interpolation techniques.
Compression
The document discusses different types of data compression techniques. It explains that compression reduces the size of data to reduce bandwidth and storage requirements when transmitting or storing audio, video, and images. It describes how compression works by exploiting redundancies in the data as well as properties of human perception. Various compression methods are outlined, including lossless techniques that preserve all information as well as lossy methods for audio and video that can tolerate some loss of information. Specific algorithms discussed include Huffman coding, run-length coding, LZW coding, and arithmetic coding. The document also provides details on JPEG image compression and MPEG video compression standards.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMS
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
Nsl seminar(2)
1. The document proposes a low-overhead uplink scheduling method for real-time services in WiMAX networks using load prediction to reduce scheduling overhead. It uses an Earlier Deadline First (EDF) scheduling algorithm and adaptive bandwidth scheduling scheme.
2. The method includes three modules: an information module to collect data on connection delays and bandwidth requirements, a scheduling database module to store this information, and a service assignment module to determine uplink subframe allocation.
3. Simulation results show the proposed method achieves better performance than weighted fair queuing (WFQ) and weighted round-robin (WRR) in terms of frame utilization, average throughput, average queuing delay, and packet loss
Data compression
This document summarizes image compression techniques. It discusses why images need to be compressed to reduce file sizes and speed up transmission. It describes how digital images are composed of pixels and color components. The document then covers lossless compression algorithms like Run Length Encoding (RLE) and LZW, which use statistical redundancy or dictionaries to compress images without loss of information. It also mentions lossy compression techniques like quantization that can achieve higher compression ratios but result in some loss of visual quality.
Evaluation of STBC and Convolutional Code Performance for Wireless Communicat...
Under rich dissipating environment, Multiple Input Multiple Output (MIMO) scheme have better performance in term of reliability and increasing the throughput. Space Time Block Code (STBC) can reduce the Bit Error Rate (BER) with suitable data rate. In order to raise the amount of throughput more, high modulation order is used but it degrade the performance. To address this problem, a Convolutional Code (CC) can be support such system with various code rate to deal with different circumstances. This research is proposed a system with serial concatenation of STBC and CC with various modulation levels. Such system is tested with Rayleigh flat and selective fading channel by Matlab package R2015b with a list of modulation order and changing the code of each STBC and CC. The results show that such system can cover a range of Signal to Noise Ratio (SNR) from 0 to 21 dB of SNR for selective fading channel and -2 to 19 dBfor flat fading channel for a targeted BER of 10-4 with a various modulation index and code rate which lead to a flexible system to change the throughput depending on user conditions.
Shannon1948
1. The document summarizes Shannon's seminal paper on "A Mathematical Theory of Communication" which established information theory. It introduces discrete, continuous, and mixed communication systems and discusses measuring a channel's information capacity.
2. For discrete systems like telegraphy with a finite set of symbols, the channel capacity can be measured as the base-2 logarithm of the number of possible symbols transmitted per second.
3. The paper aims to develop a mathematical theory to represent communication systems and analyze factors like noise and message statistics to understand information transmission.
ALGORITHMS FOR PACKET ROUTING IN SWITCHING NETWORKS WITH RECONFIGURATION OVER...
Given a set of messages to be transmitted in packages from a set of sending stations to a set of
receiving stations, we are required to schedule the packages so as to achieve the minimum
possible time from the moment the 1st transmission initiates to the concluding of the last.
Preempting packets in order to reroute message remains, as part of some other packet to be
transmitted at a later time would be a great means to achieve our goal, if not for the fact that
each preemption will come with a reconfiguration cost that will delay our entire effort. The
problem has been extensively studied in the past and various algorithms have been proposed to
handle many variations of the problem. In this paper we propose an improved algorithm that we
call the Split-Graph Algorithm (SGA). To establish its efficiency we compare it, to two of the
algorithms developed in the past. These two are the best presented in bibliography so far, one in
terms of approximation ratio and one in terms of experimental results.
What's hot (20)
IRJET- Structured Compression Sensing Method for Massive MIMO-OFDM Systems
IRJET- Structured Compression Sensing Method for Massive MIMO-OFDM Systems
Performance analysis of image compression using fuzzy logic algorithm
Performance analysis of image compression using fuzzy logic algorithm
IRJET- The RTL Model of a Reconfigurable Pipelined MCM
IRJET- The RTL Model of a Reconfigurable Pipelined MCM
Novel design algorithm for low complexity programmable fir filters based on e...
Novel design algorithm for low complexity programmable fir filters based on e...
Some Studies on Different Power Allocation Schemes of Superposition Modulation
Some Studies on Different Power Allocation Schemes of Superposition Modulation
COMPARING VARIOUS CHANNEL ESTIMATION TECHNIQUES FOR OFDM SYSTEMS USING MATLAB
COMPARING VARIOUS CHANNEL ESTIMATION TECHNIQUES FOR OFDM SYSTEMS USING MATLAB
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMS
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMS
Evaluation of STBC and Convolutional Code Performance for Wireless Communicat...
Evaluation of STBC and Convolutional Code Performance for Wireless Communicat...
ALGORITHMS FOR PACKET ROUTING IN SWITCHING NETWORKS WITH RECONFIGURATION OVER...
ALGORITHMS FOR PACKET ROUTING IN SWITCHING NETWORKS WITH RECONFIGURATION OVER...
Viewers also liked
Multi user performance on mc cdma single relay cooperative system by distribu...
Increasing data rate and high performance is the target focus of wireless communication. The multi carrier on multi-hop communication system using relay's diversity technique which is supported by a reliable coding is a system that may give high performance. This research is developing a model of multi user and two scheme of multi carrier CDMA on multi hop communication system with diversity technique which is using Alamouti codes in Rayleigh fading channel. By Alamouti research, Space Time Block Code (STBC) for MIMO system can perform high quality signal at the receiver in the Rayleigh fading channel and the noisy system. In this research, MIMO by STBC is applied to single antenna system (Distributed-STBC/DSTBC) with multi carrier CDMA on multi hop wireless communication system (relay diversity) which is able to improve the received signal performance.
MC DS CDMA on multi hop wireless communication system with 2 hops is better performing than MC CDMA on multi user without Multi User Detector. To reach BER 10-3 multi hop system with MC CDMA needs more power 5 dB than MC DS CDMA at 5 users using Alamouti scheme for symbol transmission at the relay.
ma112011id535
This document proposes a linear programming (LP) based approach for solving maximum a posteriori (MAP) estimation problems on factor graphs that contain multiple-degree non-indicator functions. It presents an existing LP method for problems with single-degree functions, then introduces a transformation to handle multiple-degree functions by introducing auxiliary variables. This allows applying the existing LP method. As an example, it applies this to maximum likelihood decoding for the Gaussian multiple access channel. Simulation results demonstrate the LP approach decodes correctly with polynomial complexity.
MMSE Receiver for DS/CDMA Communications
This document summarizes a research paper that proposes a new reduced-rank minimum mean squared error (MMSE) receiver for direct-sequence code division multiple access (DS/CDMA) communications. The proposed receiver partitions the MMSE filter coefficients using a classification algorithm to significantly reduce computational complexity while maintaining good performance. It is shown to perform better than other reduced-rank MMSE receivers using even fewer taps. The paper also proposes an adaptive partition algorithm that can simultaneously update the receiver partition and coefficients with low complexity, suitable for both synchronous and asynchronous systems.
CDMA
1: Direct sequence and frequency hopped spread spectrum, spreading sequence and their correlation functions, Acquisition and tracking of spread spectrum signals.
2: Error probability for DS-CDMA, on AWGN channels, DS-CDMA on frequency selective fading, channels, Performance analysis of cellular CDMA.
3: Capacity estimation, Power control, effect of imperfect power control on DS CDMA performance, Soft Handoffs.
4: Spreading /coding tradeoffs, multi-carrier CDMA, IS-95 CDMA system, third generation CDMA systems, multi-user detection.
Code Division Multiple Access- CDMA
CDMA is a digital cellular standard that allows multiple users to access the same radio frequency channel simultaneously through the use of unique code sequences. Users are separated by spreading their transmitted signals across the frequency band using pseudo-random codes. CDMA provides advantages over other multiple access techniques like FDMA and TDMA such as increased capacity, soft handoffs between cells, and covert operation due to its noise-like signals. The IS-95 standard introduced CDMA to cellular networks and specified the use of orthogonal codes to separate signals and a 1.25 MHz channel bandwidth to support multiple simultaneous voice calls.
telecommunication-ppt
Édouard Estaunié coined the term "télécommunication" in 1904 from the Greek prefix "tele-" meaning "far off" and the Latin word "communicare" meaning "to share". The first commercial electrical telegraph was constructed in 1839 and the first commercial telephone services began in the late 1870s. Today, Bharti Airtel is India's largest telecommunications company with over 300 million subscribers across its mobile, fixed line, high speed broadband and DTH services. Airtel continues to invest heavily in expanding its network across India with a goal of covering 95% of the population by 2010.
Viewers also liked (6)
Multi user performance on mc cdma single relay cooperative system by distribu...
Multi user performance on mc cdma single relay cooperative system by distribu...
Similar to ma112008id371
MIMO OFDM
This presentation makes note of different techniques present with respect to MIMO OFDM and which can be implemented to improve the wireless system.
International Journal of Engineering Research and Development (IJERD)
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Fpga based efficient multiplier for image processing applications using recur...
The Digital Image processing applications like medical imaging, satellite imaging, Biometric trait images
etc., rely on multipliers to improve the quality of image. However, existing multiplication techniques
introduce errors in the output with consumption of more time, hence error free high speed multipliers has
to be designed. In this paper we propose FPGA based Recursive Error Free Mitchell Log Multiplier
(REFMLM) for image Filters. The 2x2 error free Mitchell log multiplier is designed with zero error by
introducing error correction term is used in higher order Karastuba-Ofman Multiplier (KOM)
Architectures. The higher order KOM multipliers is decomposed into number of lower order multipliers
using radix 2 till basic multiplier block of order 2x2 which is designed by error free Mitchell log multiplier.
The 8x8 REFMLM is tested for Gaussian filter to remove noise in fingerprint image. The Multiplier is
synthesized using Spartan 3 FPGA family device XC3S1500-5fg320. It is observed that the performance
parameters such as area utilization, speed, error and PSNR are better in the case of proposed architecture
compared to existing architectures.
Plan_design and FPGA implement of MIMO OFDM SDM systems
The document describes the design and FPGA implementation of MIMO OFDM SDM systems for high speed data transmission. It discusses using MIMO and OFDM techniques together to provide increased transmission speed and spectrum efficiency. The author presents their own design of MIMO OFDM SDM systems in Matlab and implementation on an FPGA development kit. They evaluate the bit error rate performance and resource usage of their design. The document includes sections on related work, the proposed project plan and timeline, and conclusions from their implementation results.
A05410105
1. The document presents a design for a modified Booth recoder using a fused add-multiply (FAM) operator to implement digital signal processing applications more efficiently.
2. It proposes a new recoding technique to decrease the critical path delay and reduce area and power consumption of the FAM unit compared to existing recoding schemes.
3. The technique is also applied to the implementation of finite impulse response (FIR) filters to further optimize hardware usage and achieve faithfully rounded outputs within tight area and power constraints for mobile applications.
DSM Based low oversampling using SDR transmitter
The oversampling recruitment is a limiting factor in high frequency application such as software defined radio. This project is a high frequency processing and low oversampling ratio. A single bit semi parallel processing is proposed in this paper. Using this single bit PDSM Architecture, high speed, high complexity computations are executed in parallel. The single bit DSM is to build an RF transmitter that includes a one bit quantifier with two level switching power amplifier for high linearity and high efficiency. Performance analysis by using the MATLAB simulations by reducing the oversampling ratio by same signal to noise ratio. The DSM implemented on field programmable gate array and using a signal code division multiple access signal. This project will give bandwidth of the low oversampled signal increased four times without increasing frequency. Finally they can be achieved signal to noise ratio is very low and also oversampling ratio is small.
Design and Hardware Implementation of Low-Complexity Multiuser Precoders (ETH...
Design and Hardware Implementation of Low-Complexity Multiuser Precoders (ETH...TSC University of Mondragon
Presentation on the design and FPGA implementation of low-complexity multiuser vector precoders, given at ETHZ Zurich in October 2010Network coding
The document discusses using network coding to optimize routing schemes for multicasting in mobile ad-hoc networks. It defines the problem and assumptions, such as independent information sources and specifying multicast requirements. Network coding is described as employing coding at nodes rather than just relaying data. Simulations show that calculating the optimal routing scheme is much less complex with network coding compared to conventional routing, and the network coding solution uses close to the minimum possible energy.
z3417835 Bradley Alderton
The document discusses developing a 3D transported probability density function (TPDF) code to model combustion. It aims to extend an existing 1D TPDF code to 2D and 3D by copying 1D data to additional dimensions and testing different mixing models. Testing showed the code is dimensionally analogous and produces promising results, though validation with 3D direct numerical simulation data is still needed. The TPDF code uses a composition TPDF approach and is intended to enable more efficient combustion engine design simulations.
Pwm technique to overcome the effect of
Many current communication systems suffer from performance degradation due to the high sensitivity to
high power peaks especially in the nonlinear devices. The author introduces a new concept based on the
Pulse Width Modulation (PWM), namely MIMO-OFDM system based PWM (MO-PWM) to overcome this
deficiency. Here, the peak-to-average power ratio (PAPR) problem in Orthogonal Frequency Division
Multiplexing (OFDM) technique is used as a criterion to check the validity of the proposed work.
Moreover, the proposed system work has been implemented over Field Programmable Gate Array (FPGA),
which is designed to characterize both of the complexity and the speed issues.
The systems performance based MO-PWM and validity have been checked based on a numerical analysis
and a conducted simulation. The simulation results show that the MO-PWM can clearly reduce the PAPR
values nevertheless the used OFDM systems’ specifications, and gives a promising results over some
techniques found in the literature, such as clipping, SLM and PTS under same bandwidth occupancy and
system’s specifications.
International Journal of Engineering Research and Development
The document summarizes an emerging VP8 video codec that is designed for mobile devices. It aims to significantly reduce computational complexity through several techniques while maintaining good video quality. The key techniques include a predictive algorithm for motion estimation that reduces computation by 18.5-20x compared to full search, using integer discrete cosine transform instead of floating point to achieve 2.6-3.5x speed improvement, and skipping DCT and quantization for some macroblocks to reduce computations. Experimental results on test sequences show negligible quality degradation of 0.2-0.5dB for integer DCT and 0.5dB on average for the full codec, while achieving real-time encoding rates on mobile devices. The proposed low-complexity
A New Bit Split and Interleaved Channel Coding for MIMO Decoder
Authors:-C. Amar Singh Feroz1, S. Karthikeyan2, K. Mala3
Abstract– In wireless communications, the use of multiple antennas at both the
transmitter and receiver is a key technology to enable high data transmission without
additional bandwidth or transmit power. MIMO schemes are widely used in many
wireless standards, allowing higher throughput using spatial multiplexing techniques.
Bit split mapping based on JDD is designed. Here ETI coding is used for encoding and
Viterbi is used for decoding. Experimental results for 16-QAM and 64 QAM with the
code rate of ½ and 1/3 codes are shown to verify the proposed approach and to elucidate
the design tradeoffs in terms the BER performance. This bit split mapping based JDD
algorithm can greatly improve BER performance with different system settings.
BER Performance Improvement for 4 X 4 MIMO Single Carrier FDMA System Using M...
This document describes a system that aims to improve the bit error rate (BER) performance of 4x4 MIMO single-carrier frequency-division multiple access (SC-FDMA) uplink transmission. It investigates using minimum mean square error (MMSE) equalization at the receiver to better detect MIMO data over Rayleigh fading channels. Simulation results using MATLAB show that the proposed MMSE detection scheme decreases BER as signal-to-noise ratio increases for 16-QAM modulation. The BER performance is also compared to orthogonal frequency-division multiple access (OFDMA) MIMO systems, showing improved results for SC-FDMA.
Thesis Giani UIC Slides EN
The document proposes an approach for identifying core designs for reconfigurable systems driven by specification self-similarity. It involves partitioning a specification's data flow graph (DFG) to identify recurrent subgraphs that can be implemented as reusable configurable modules. This is done through two phases: template identification to produce equivalence classes of isomorphic subgraphs, and graph covering to select templates for implementation. The approach was tested on real-world benchmarks, demonstrating coverage of 70-90% and runtimes of seconds to minutes. Future work includes refining template selection and online scheduling of reconfigurable cores.
Implementation of OFDM System Using Various Channel Modulation Schemes
This report discusses the planning Associate in
nursing the implementation of an OFDM system
in several information module schemes like MQPSK,
M-QAM. First, a short introduction is
provided by explaining the background and the
specification of the project. Then the report deals
with the system model, every block of the OFDM
system is represented (IFFT, FFT, Cyclic prefix,
modulation / reception, Channel estimation, bit
error rate). System design is analyzed. The
transmission techniques, further because the
system parameters for transmission and reception
are explained well. Finally, the results are
provided.
Titan X Research Paper
The document discusses the technology and physics behind compact discs (CDs). It explains that CDs are thin circular discs made of metal and plastic layers that can store up to 74 minutes of audio or 682 MB of digital data. The data is encoded in tiny indentations called "pits" arranged in a spiral track on the metal layer. When a laser beam scans the pits and lands, the reflected beam experiences a phase change that is read as binary data. The document outlines the layer structure of a CD and the microscopic size of the pits that represent the encoded data. It also explains how the optical reading system works by detecting changes in the reflected laser beam that indicate pit and land locations.
Xevgenis_Michael_CI7110_ Data_Communications.DOC
This document appears to be a student paper submission for a networking course. It discusses using a microwave backhaul link to connect two company branch offices located on different Greek islands. The paper will analyze how the bit error rate of the microwave link at different signal-to-noise ratios can impact the TCP throughput between the two branches. It will include simulations of the microwave link and the network implementation to examine this relationship and draw conclusions. The paper is divided into sections covering the theoretical background of the communication channel, analysis of error correction coding and modulation, and the planned simulations.
Comparative study of_digital_modulation (1)
This document compares different digital modulation techniques that can be used in orthogonal frequency division multiplexing (OFDM) and WiMAX networks. It simulates BPSK, QPSK, 16-QAM and 64-QAM modulation in MATLAB and measures their performance in terms of bit error rate and throughput. The results show that higher order modulations like 64-QAM provide much higher throughput but also higher bit error rates compared to lower order modulations at a given signal-to-noise ratio. The best configuration balances low bit error rates and high throughput.
BER performance simulation in a multi user MIMO Presentation
This document summarizes a simulation of bit error rate (BER) performance for a multi-user MIMO system using transmit antenna selection/maximal ratio combining (TAS/MRC) over a Nakagami-m fading channel. Modulation schemes evaluated include BPSK, QPSK, and QAM. Simulations were conducted for systems with 200 and 500 users. Results show BER decreasing as the number of users increases or modulation order increases from BPSK to QAM. Findings can inform the design of future MIMO devices.
A new efficient way based on special stabilizer multiplier permutations to at...
BCH codes represent an important class of cyclic error-correcting codes; their minimum distances are known only for some cases and remains an open NP-Hard problem in coding theory especially for large lengths. This paper presents an efficient scheme ZSSMP (Zimmermann Special Stabilizer Multiplier Permutation) to find the true value of the minimum distance for many large BCH codes. The proposed method consists in searching a codeword having the minimum weight by Zimmermann algorithm in the sub codes fixed by special stabilizer multiplier permutations. These few sub codes had very small dimensions compared to the dimension of the considered code itself and therefore the search of a codeword of global minimum weight is simplified in terms of run time complexity. ZSSMP is validated on all BCH codes of length 255 for which it gives the exact value of the minimum distance. For BCH codes of length 511, the proposed technique passes considerably the famous known powerful scheme of Canteaut and Chabaud used to attack the public-key cryptosystems based on codes. ZSSMP is very rapid and allows catching the smallest weight codewords in few seconds. By exploiting the efficiency and the quickness of ZSSMP, the true minimum distances and consequently the error correcting capability of all the set of 165 BCH codes of length up to 1023 are determined except the two cases of the BCH(511,148) and BCH(511,259) codes. The comparison of ZSSMP with other powerful methods proves its quality for attacking the hardness of minimum weight search problem at least for the codes studied in this paper.
Similar to ma112008id371 (20)
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)
Fpga based efficient multiplier for image processing applications using recur...
Fpga based efficient multiplier for image processing applications using recur...
Plan_design and FPGA implement of MIMO OFDM SDM systems
Plan_design and FPGA implement of MIMO OFDM SDM systems
Design and Hardware Implementation of Low-Complexity Multiuser Precoders (ETH...
Design and Hardware Implementation of Low-Complexity Multiuser Precoders (ETH...
International Journal of Engineering Research and Development
International Journal of Engineering Research and Development
A New Bit Split and Interleaved Channel Coding for MIMO Decoder
A New Bit Split and Interleaved Channel Coding for MIMO Decoder
BER Performance Improvement for 4 X 4 MIMO Single Carrier FDMA System Using M...
BER Performance Improvement for 4 X 4 MIMO Single Carrier FDMA System Using M...
Implementation of OFDM System Using Various Channel Modulation Schemes
Implementation of OFDM System Using Various Channel Modulation Schemes
BER performance simulation in a multi user MIMO Presentation
BER performance simulation in a multi user MIMO Presentation
A new efficient way based on special stabilizer multiplier permutations to at...
A new efficient way based on special stabilizer multiplier permutations to at...
More from matsushimalab
ma99992012id537
This document proposes a unified framework for approximating the optimal key estimation of stream ciphers using probabilistic inference. It formulates the key estimation problem as determining the secret key that maximizes the joint probability based on the observed keystream. An approximation algorithm called the sum-product algorithm is used to efficiently compute approximate marginal probabilities on a factor graph representing the cipher structure. Preprocessing techniques can reduce the complexity of the sum-product algorithm when applied to ciphers using linear feedback shift registers.
ma12012id536
This document analyzes the asymptotic properties of expected cumulative logarithmic loss in Bayesian estimation when models are nested and when there is misspecification. The main theorem states that if the true distribution does not belong to the model class, the asymptotic loss per symbol goes to the Kullback-Leibler divergence between the true and model distributions, rather than 0. If the true distribution does belong to the model class, the results reduce to previous studies. The proof is separated into two parts and relies on a lemma showing posterior concentration at the true model.
ma52009id421
The document proposes a new method for document classification with small training data. It discusses previous methods that estimate parameters for prior distributions either using fixed values or estimating data. The new proposed method estimates parameters for prior distributions as a weighted combination of estimating data and training data. Experiments show the new method achieves higher accuracy than previous methods, especially with small training data sizes.
ma52009id420
The document proposes a method to calculate the theoretical throughput limit of type-I hybrid selective-repeat ARQ with a finite receiver buffer using Markov decision processes. The authors model the problem as an MDP and develop an algorithm to compute the maximum expected utility and throughput limit by applying dynamic programming. Simulation results show the throughput of previous methods approaches the proposed theoretical limit with increasing buffer size.
More from matsushimalab (20)
ma112008id371
- 1. Multiuser Detection Algorithm for CDMA based on the Belief Propagation Algorithm Shunsuke Horii Tota Suko Toshiyasu Matsushima Shigeichi Hirasawa Waseda Univ.
- 3. Research background They said in the paper it is impossible to apply the BP for MUD directly. Parallel Interference Canceller (PIC) is derived as an approximation of the BP. Analysis of the PIC for large size system. (large number of users) Develop the BP based MUD algorithm which provides good performance for moderate size system. Purpose of our research Assertion of them: Main result The BP can be applied for the MUD problem by converting the graph structure. Proposed graph has some superior points comparing with existing one. Purpose:
- 7. MUD problem Uniform Prior: Gaussian Channel: MPM detector estimate Posterior distribution of information bits
- 15. Previous work FG representation [T. Tanaka and M. Okada]
- 22. BP based MUD － Proposed work － The number of cycles decreases furthermore for some cases! The number of cycles of proposed FG is possibly small depending on the signature sequence.
- 25. Numerical Simulation Simulation Conditions Performances of the detectors depend on the signature sequence. Especially, that of the BP depends on the number of cycles. Simulate under the three kind of the signature sequences ※ Sequence C is Shift-M sequence 0.143 (all) 0/21 Sequence C 0.262 5/21 Sequence B 0.167 11/21 Sequence A Absolute value of cross correlations (average) Portion of 0 elements in cross correlations
- 26. Numerical Simulation The BP outperforms the PIC The BP’s performance is near to optimum Sequence A （ Number of cycles ： small ）
- 27. The BP doesn’t provide good performance Numerical Simulation Sequence B （ Number of cycles : large Correlation : strong ） The BP outperforms the PIC
- 28. Numerical Simulation Sequence C （ Number of cycles : large Correlation : weak ） BP’s performance is near to optimum The BP outperforms the PIC
- 31. Appendix Algorithm of the PIC
- 32. Appendix
- 34. Appendix Sequence B （ Number of loops : large Correlation : strong ）
- 35. Appendix Sequence C （ Number of loops : large Correlation : weak ）