Enhanced 3-D OCDMA code family using asymmetric run length constraints

Abstract : This paper suggests an enhanced performance of the 3-D optical code division multiple access (OCDMA) codes, a space/wavelength/time spreading family of codes. The initial codes are in the format wavelength hopping/time sequence (WH/TS), selected according to their performance requirements and the TS sequence is constructed to achieve a linear space- time complexity. The asymmetric run length constraints are introduced in that regard, such that the positive bit positions align with the encoder/decoder frequency spacing pattern, yielding a 3-D WH/WS/TS. The selected 2-D OCDMA codes are one- coincidence frequency hopping codes (OCFHC) and optical orthogonal codes (OOC). As a time sequence code, the OOC code length is extended with a code rate of 0.04. The complexity and the bit error rate (BER) are herein given and compared with previous work. The results of the performance show not only an improvement in the number of simultaneous users due to the code length extension, but better correlation properties and hence a better signal-to-noise ratio

A ranking method for rating the performances of permutation codes

Abstract: Minimum Hamming distance, dm, has been widely used as the yardstick for the performance of permutation codes (PCs). However, a number of PCs with the same dm and cardinality can have different performances, even if they have the same distance optimality. Since PC is a robust channel coding scheme in power line communications applications, we present a simple and fast ranking method that predicts the relative performance of PCs, by using the information extracted from their Hamming distance distributions. This tool is useful for selecting an efficient PC codebook out of a number of similar ones

Investigation of the effects on embedded watermarks under image manipulations

Abstract: In this paper, different types of image watermarking techniques, the embedding of data or copyright information into the data file, are investigated. Three image watermarking techniques are discussed, namely: least significant bit, least significant bit and discrete cosine transform combined, and discrete cosine transform and discrete wavelet transform combined. These embedded watermarking techniques are evaluated on how robust each technique is under image manipulations. Simulations are done using the three image watermarking techniques to determine the effects on how well the embedded watermarking technique resists manipulations..

Encoding and Decoding of Balanced q-ary sequences using a gray code prefix

Abstract: Balancing sequences over a non-binary alphabet is considered, where the algebraic sum of the components (also known as the weight) is equal to some specific value. Various schemes based on Knuth’s simple binary balancing algorithm have been proposed. However, these have mostly assumed that the prefix describing the balancing point in the algorithm can easily be encoded. In this paper we show how non-binary Gray codes can be used to generate these prefixes. Together with a non-binary balancing algorithm, this forms a complete balancing system with straightforward and efficient encoding/decoding

A construction for balancing non-binary sequences based on gray code prefixes

Abstract: We introduce a new construction for the balancing of non-binary sequences that make use of Gray codes for prefix coding. Our construction provides full encoding and decoding of sequences, including the prefix. This construction is based on a generalization of Knuth’s parallel balancing approach, which can handle very long information sequences. However, the overall sequence—composed of the information sequence, together with the prefix—must be balanced. This is reminiscent of Knuth’s serial algorithm. The encoding of our construction does not make use of lookup tables, while the decoding process is simple and can be done in parallel

A multilevel construction for mappings from binary sequences to permutation sequences

Abstract: A multilevel construction is introduced to create distance-preserving mappings from binary sequences to permutation sequences. It is also shown that for certain values, the new mappings attain the upper bound on the sum of Hamming distances obtainable for such mappings, and in the other cases improve on those of previous mappings

Analysis of permutation distance-preserving mappings using graphs

Abstract A new way of analyzing permutation distance preserving mappings is presented by making use of a graph representation. The properties necessary to make such graphs distance-preserving and how this relates to the total sum of distances that exist for such mappings, are investigated. This new knowledge is used to analyze previous constructions, as well as showing the existence or non-existence of simple algorithms for mappings attaining the upper bound on the sum of distances. Finally, two applications for such graphs are considered

Construction of efficient q-ary balanced codes

Abstract : Abstract—Knuth proposed a simple scheme for balancing codewords, which was later extended for generating q-ary balanced codewords. The redundancy of existing schemes for balancing q-ary sequences is larger than that of the full balanced set which is the minimum achievable redundancy. In this article, we present a simple and efficient method to encode the prefix that results in less redundancy for the construction of q-ary balanced codewords

Efficient balancing of q-ary sequences with parallel decoding

Abstract: Balancing of q-ary sequences, using a generalization of Knuth’s efficient parallel balancing scheme, is considered. It is shown that the new general scheme is as simple as the original binary scheme, which lends itself to parallel decoding of the balanced sequences

Cognitive radio DAB MAC protocol performance using a CR specific simulator and software defined radio

Abstract: With the constant advances in wireless technology, radio spectrum has become a very scarce resource. Cognitive Radio (CR) has emerged as a viable way to deal with our inefficient use of the radio spectrum by utilizing unused spectrum holes or white spaces, as they are referred to. Using Software Defined Radio (SDR) we are able to realize CRs and their unique properties. Most of the research that has been done on CR protocols has been based on analytical assessments and simulations using non-CR specific network simulators. In this paper we code and compare two existing CR specific Medium Access Control (MAC) protocols using a CR specific simulator. We then prototype the chosen protocols using the Universal Software Radio Peripheral (USRP). This allows us to see how close the simulated performance results come to those actually achieved in a real prototype