Rebelatto, João Luiz; Li, Yonghui; Vucetic, Branka
2010-01-01
In this work, we propose and analyze a generalized construction of distributed network codes for a network consisting of M users sending different information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its code rate. The proposed scheme, called generalized dynamic network codes (GDNC), is a generalization of the dynamic network codes (DNC) recently proposed by Xiao and Skoglung. The design of the network codes that maximizes the diversity order is recognized as equivalent to the design of linear block codes over a nonbinary finite field under the Hamming metric. The proposed scheme offers a much better tradeoff between rate and diversity order. An outage probability analysis showing the improved performance is carried out, and computer simulations results are shown to agree with the analytical results.
STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM
H. Prashantha Kumar
2012-03-01
Full Text Available The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decoding of block codes using tree structure. Many good block codes are presently known. Several of them have been used in applications ranging from deep space communication to error control in storage systems. But the primary difficulty with applying Viterbi or BCJR algorithms to decode of block codes is that, even though they are optimum decoding methods, the promised bit error rates are not achieved in practice at data rates close to capacity. This is because the decoding effort is fixed and grows with block length, and thus only short block length codes can be used. Therefore, an important practical question is whether a suboptimal realizable soft decision decoding method can be found for block codes. A noteworthy result which provides a partial answer to this question is described in the following sections. This result of near optimum decoding will be used as motivation for the investigation of different soft decision decoding methods for linear block codes which can lead to the development of efficient decoding algorithms. The code tree can be treated as an expanded version of the trellis, where every path is totally distinct from every other path. We have derived the tree structure for (8, 4 and (16, 11 extended Hamming codes and have succeeded in implementing the soft decision stack algorithm to decode them. For the discrete memoryless channel, gains in excess of 1.5dB at a bit error rate of 10-5 with respect to conventional hard decision decoding are demonstrated for these codes.
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
Lin, Shu
1998-01-01
A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and
Map Algorithms for Decoding Linear Block codes Based on Sectionalized Trellis Diagrams
Lin, Shu
1999-01-01
The MAP algorithm is a trellis-based maximum a posteriori probability decoding algorithm. It is the heart of the turbo (or iterative) decoding which achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applications, this decoding algorithm must be simplified and its decoding complexity and delay must be reduced. In this paper, the MAP algorithm and its variations, such as Log-MAP and Max-Log-MAP algorithms, are first applied to sectionalized trellises for linear block codes and carried out as two-stage decodings. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Computation-wise optimum sectionalizations of a trellis for MAP algorithms are investigated. Also presented in this paper are bi-directional and parallel MAP decodings.
Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms
Ahmed Azouaoui
2012-01-01
Full Text Available A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.
Rahman, Imadur Mohamed; Marchetti, Nicola; Fitzek, Frank;
2005-01-01
In this work, we have analyzed a joint spatial diversity and multiplexing transmission structure for MIMO-OFDM system, where Orthogonal Space-Frequency Block Coding (OSFBC) is used across all spatial multiplexing branches. We have derived a BLAST-like non-linear Successive Interference Cancellation...... in this paper. We have found that a linear two-stage receiver for the proposed system [1] performs very close to the non-linear receiver studied in this work. Finally, we compared the system performance in spatially correlated scenario. It is found that higher amount of spatial correlation at the transmitter...... (SIC) receiver where the detection is done on subcarrier by sub-carrier basis based on both Zero Forcing (ZF) and Minimum Mean Square Error (MMSE) nulling criterion for the system. In terms of Frame Error Rate (FER), MMSE based SIC receiver performs better than all other receivers compared...
New Considerations of Turbo Block Codes
YUEDianwu; EdSHWEDYK
2004-01-01
It is shown that (1) a general linear systematic block code can be expressed as a turbo block code and therefore can be decoded using any turbo decoding algorithm; (2) a turbo block code can be also encoded and decoded without any interleaver with the same performance as when an interleaver is present.
Lin, Shu; Fossorier, Marc
1998-01-01
The Viterbi algorithm is indeed a very simple and efficient method of implementing the maximum likelihood decoding. However, if we take advantage of the structural properties in a trellis section, other efficient trellis-based decoding algorithms can be devised. Recently, an efficient trellis-based recursive maximum likelihood decoding (RMLD) algorithm for linear block codes has been proposed. This algorithm is more efficient than the conventional Viterbi algorithm in both computation and hardware requirements. Most importantly, the implementation of this algorithm does not require the construction of the entire code trellis, only some special one-section trellises of relatively small state and branch complexities are needed for constructing path (or branch) metric tables recursively. At the end, there is only one table which contains only the most likely code-word and its metric for a given received sequence r = (r(sub 1), r(sub 2),...,r(sub n)). This algorithm basically uses the divide and conquer strategy. Furthermore, it allows parallel/pipeline processing of received sequences to speed up decoding.
Samir Abdul Cathem Khother
2017-07-01
Full Text Available This search present trellis structures of linear block code capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. First we describe minimal trellis of linear block code that minimizes one or more measures of trellis complexity for the code. We identify the primitive structures that can appear in a minimal trellis , then we applied the sectionalized to trellis, where only uniform sectionalizations of the code trellis diagram are considered .Next, parallel and structurally identical subtrellises for a code without exceeding the maximum state complexity of the minimal trellis of the code is discussed. The complexity of decoder based on a sectionalized trellis diagram for a code is described. In This paper we describe how to apply SISO(soft input soft output max-log-MAP decoder using parallel structure of sectionalized trellis for block code. The (8,4 and (16,5RM (Reed Muller code are included here because they offers parallel and structurally identical subtrellises without cross connections among them that will reduces the decoding complexity and improves decoding speed. This paper also gives simulation results for iterative decoding of parallel concatenated block code of these two codes over AWGN channel by using SISO max-log-MAP decoder based on parallel trellises structure.
Properties of blocked linear systems.
Chen, Weitian; Anderson, Brian D O; Deistler, Manfred; Filler, Alexander
2012-10-01
This paper presents a systematic study on the properties of blocked linear systems that have resulted from blocking discrete-time linear time invariant systems. The main idea is to explore the relationship between the blocked and the unblocked systems. Existing results are reviewed and a number of important new results are derived. Focus is given particularly on the zero properties of the blocked system as no such study has been found in the literature.
Random linear codes in steganography
Kamil Kaczyński
2016-12-01
Full Text Available Syndrome coding using linear codes is a technique that allows improvement in the steganographic algorithms parameters. The use of random linear codes gives a great flexibility in choosing the parameters of the linear code. In parallel, it offers easy generation of parity check matrix. In this paper, the modification of LSB algorithm is presented. A random linear code [8, 2] was used as a base for algorithm modification. The implementation of the proposed algorithm, along with practical evaluation of algorithms’ parameters based on the test images was made.[b]Keywords:[/b] steganography, random linear codes, RLC, LSB
Rumen Daskalov
2017-07-01
Full Text Available Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ over $GF(q$. One of the most important problems in coding theory is to construct codes with optimal minimum distances. In this paper 22 new ternary linear codes are presented. Two of them are optimal. All new codes improve the respective lower bounds in [11].
On constructing disjoint linear codes
ZHANG Weiguo; CAI Mian; XIAO Guozhen
2007-01-01
To produce a highly nonlinear resilient function,the disjoint linear codes were originally proposed by Johansson and Pasalic in IEEE Trans.Inform.Theory,2003,49(2):494-501.In this paper,an effective method for finding a set of such disjoint linear codes is presented.When n≥2k,we can find a set of[n,k] disjoint linear codes with joint linear codes exists with cardinality at least 2.We also describe a result on constructing a set of [n,k] disjoint linear codes with minimum distance at least some fixed positive integer.
Network coding for computing: Linear codes
Appuswamy, Rathinakumar; Karamchandani, Nikhil; Zeger, Kenneth
2011-01-01
In network coding it is known that linear codes are sufficient to achieve the coding capacity in multicast networks and that they are not sufficient in general to achieve the coding capacity in non-multicast networks. In network computing, Rai, Dey, and Shenvi have recently shown that linear codes are not sufficient in general for solvability of multi-receiver networks with scalar linear target functions. We study single receiver networks where the receiver node demands a target function of the source messages. We show that linear codes may provide a computing capacity advantage over routing only when the receiver demands a `linearly-reducible' target function. % Many known target functions including the arithmetic sum, minimum, and maximum are not linearly-reducible. Thus, the use of non-linear codes is essential in order to obtain a computing capacity advantage over routing if the receiver demands a target function that is not linearly-reducible. We also show that if a target function is linearly-reducible,...
Lin, Shu; Fossorier, Marc
1998-01-01
In a coded communication system with equiprobable signaling, MLD minimizes the word error probability and delivers the most likely codeword associated with the corresponding received sequence. This decoding has two drawbacks. First, minimization of the word error probability is not equivalent to minimization of the bit error probability. Therefore, MLD becomes suboptimum with respect to the bit error probability. Second, MLD delivers a hard-decision estimate of the received sequence, so that information is lost between the input and output of the ML decoder. This information is important in coded schemes where the decoded sequence is further processed, such as concatenated coding schemes, multi-stage and iterative decoding schemes. In this chapter, we first present a decoding algorithm which both minimizes bit error probability, and provides the corresponding soft information at the output of the decoder. This algorithm is referred to as the MAP (maximum aposteriori probability) decoding algorithm.
BILINEAR FORMS AND LINEAR CODES
高莹
2004-01-01
Abraham Lempel et al[1] made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.
Scheduling Linearly Indexed Assignment Codes
Kailath, Thomas; Roychowdhury, Vwani P.
1989-05-01
It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.
Forms and Linear Network Codes
Hansen, Johan P.
spaces of Veronese varieties. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang introduced a metric on the set af vector spaces and showed that a minimal......We present a general theory to obtain linear network codes utilizing forms and obtain explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces intersect in the same small dimension. The theory is inspired by the methods of the author utilizing the osculating...... them suitable for linear network coding. The parameters of the resulting linear network codes are determined....
Squares of Random Linear Codes
Cascudo Pueyo, Ignacio; Cramer, Ronald; Mirandola, Diego
2015-01-01
a positive answer, for codes of dimension $k$ and length roughly $\\frac{1}{2}k^2$ or smaller. Moreover, the convergence speed is exponential if the difference $k(k+1)/2-n$ is at least linear in $k$. The proof uses random coding and combinatorial arguments, together with algebraic tools involving the precise......Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code ``typically'' fill the whole space? We give...
Index coding via linear programming
Blasiak, Anna; Lubetzky, Eyal
2010-01-01
Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to Network Coding. The basic setting of Index Coding encodes the side-information relation, the problem input, as an undirected graph and the fundamental parameter is the broadcast rate $\\beta$, the average communication cost per bit for sufficiently long messages (i.e. the non-linear vector capacity). Recent nontrivial bounds on $\\beta$ were derived from the study of other Index Coding capacities (e.g. the scalar capacity $\\beta_1$) by Bar-Yossef et al (FOCS'06), Lubetzky and Stav (FOCS'07) and Alon et al (FOCS'08). However, these indirect bounds shed little light on the behavior of $\\beta$ and its exact value remained unknown for \\emph{any graph} where Index Coding is nontrivial. Our main contribution is a hierarchy of linear programs whose solutions trap $\\beta$ between them. This enables a direct information-...
Code-excited linear predictive coding of multispectral MR images
Hu, Jian-Hong; Wang, Yao; Cahill, Patrick
1996-02-01
This paper reports a multispectral code excited linear predictive coding method for the compression of well-registered multispectral MR images. Different linear prediction models and the adaptation schemes have been compared. The method which uses forward adaptive autoregressive (AR) model has proven to achieve a good compromise between performance, complexity and robustness. This approach is referred to as the MFCELP method. Given a set of multispectral images, the linear predictive coefficients are updated over non-overlapping square macroblocks. Each macro-block is further divided into several micro-blocks and, the best excitation signals for each microblock are determined through an analysis-by-synthesis procedure. To satisfy the high quality requirement for medical images, the error between the original images and the synthesized ones are further specified using a vector quantizer. The MFCELP method has been applied to 26 sets of clinical MR neuro images (20 slices/set, 3 spectral bands/slice, 256 by 256 pixels/image, 12 bits/pixel). It provides a significant improvement over the discrete cosine transform (DCT) based JPEG method, a wavelet transform based embedded zero-tree wavelet (EZW) coding method, as well as the MSARMA method we developed before.
C++ application development with Code::Blocks
Modak, Biplab Kumar
2013-01-01
This is a comprehensive tutorial with step-by-step instructions on how to develop applications with Code::Blocks.This book is for C++ developers who wish to use Code::Blocks to create applications with a consistent look and feel across multiple platforms. This book assumes that you are familiar with the basics of the C++ programming language.
Multi-Dimensional Systematic Block Codes
YUEDianwu; CHENTao
2004-01-01
This paper is concerned with a family of Mmulti-dimensional systematic block (MDSB) codes,which can be decoded iteratively. Simulation results of MDSB codes based on Single-parity-check (SPC) and Hamming codes are presented for an additive white Gaussian noise channel. It is shown that performance improves and the code rate decreases with the increasing dimension-ality. Convergence characteristics of iterative decoding are described in detail. Simulation results show that these systematic codes perform better than 2-dimensional counterparts, but have a disadvantage of error floor although they can provide near Shannon capacity's limit performance.MDSB codes offer a good performance versus complexity tradeoff if they use mixture of SPC and Hamming codes as their component codes.
Surface code implementation of block code state distillation
Fowler, Austin G.; Devitt, Simon J.; Jones, Cody
2013-01-01
State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states produced a single improved |A〉 state given 15 input copies. New block code state distillation methods can produce k improved |A〉 states given 3k + 8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three. PMID:23736868
On the linear programming bound for linear Lee codes.
Astola, Helena; Tabus, Ioan
2016-01-01
Based on an invariance-type property of the Lee-compositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field [Formula: see text] on the set of Lee-compositions. We show some useful properties of certain sums of Lee-numbers, which are the eigenvalues of the Lee association scheme, appearing in the linear programming problem of linear Lee codes. Using the additional equality constraints, we formulate the linear programming problem of linear Lee codes in a very compact form, leading to a fast execution, which allows to efficiently compute the bounds for large parameter values of the linear codes.
Finding maximum JPEG image block code size
Lakhani, Gopal
2012-07-01
We present a study of JPEG baseline coding. It aims to determine the minimum storage needed to buffer the JPEG Huffman code bits of 8-bit image blocks. Since DC is coded separately, and the encoder represents each AC coefficient by a pair of run-length/AC coefficient level, the net problem is to perform an efficient search for the optimal run-level pair sequence. We formulate it as a two-dimensional, nonlinear, integer programming problem and solve it using a branch-and-bound based search method. We derive two types of constraints to prune the search space. The first one is given as an upper-bound for the sum of squares of AC coefficients of a block, and it is used to discard sequences that cannot represent valid DCT blocks. The second type constraints are based on some interesting properties of the Huffman code table, and these are used to prune sequences that cannot be part of optimal solutions. Our main result is that if the default JPEG compression setting is used, space of minimum of 346 bits and maximum of 433 bits is sufficient to buffer the AC code bits of 8-bit image blocks. Our implementation also pruned the search space extremely well; the first constraint reduced the initial search space of 4 nodes down to less than 2 nodes, and the second set of constraints reduced it further by 97.8%.
Quantum codes from linear codes over finite chain rings
Liu, Xiusheng; Liu, Hualu
2017-10-01
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring {\\mathbb {F}}_{p^{2m}}+u{\\mathbb {F}}_{p^{2m}}. The good parameters of quantum codes from cyclic codes over finite chain rings are obtained.
Speech coding code- excited linear prediction
Bäckström, Tom
2017-01-01
This book provides scientific understanding of the most central techniques used in speech coding both for advanced students as well as professionals with a background in speech audio and or digital signal processing. It provides a clear connection between the whys hows and whats thus enabling a clear view of the necessity purpose and solutions provided by various tools as well as their strengths and weaknesses in each respect Equivalently this book sheds light on the following perspectives for each technology presented Objective What do we want to achieve and especially why is this goal important Resource Information What information is available and how can it be useful and Resource Platform What kind of platforms are we working with and what are their capabilities restrictions This includes computational memory and acoustic properties and the transmission capacity of devices used. The book goes on to address Solutions Which solutions have been proposed and how can they be used to reach the stated goals and ...
Capacitor blocks for linear transformer driver stages.
Kovalchuk, B M; Kharlov, A V; Kumpyak, E V; Smorudov, G V; Zherlitsyn, A A
2014-01-01
In the Linear Transformer Driver (LTD) technology, the low inductance energy storage components and switches are directly incorporated into the individual cavities (named stages) to generate a fast output voltage pulse, which is added along a vacuum coaxial line like in an inductive voltage adder. LTD stages with air insulation were recently developed, where air is used both as insulation in a primary side of the stages and as working gas in the LTD spark gap switches. A custom designed unit, referred to as a capacitor block, was developed for use as a main structural element of the transformer stages. The capacitor block incorporates two capacitors GA 35426 (40 nF, 100 kV) and multichannel multigap gas switch. Several modifications of the capacitor blocks were developed and tested on the life time and self breakdown probability. Blocks were tested both as separate units and in an assembly of capacitive module, consisting of five capacitor blocks. This paper presents detailed design of capacitor blocks, description of operation regimes, numerical simulation of electric field in the switches, and test results.
Linear codes associated to determinantal varieties
Beelen, Peter; Ghorpade, Sudhir R.; Hasan, Sartaj Ul
2015-01-01
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The case of varieties defined by the vanishing of 2×2 minors...
Linear-programming Decoding of Non-binary Linear Codes
Flanagan, Mark F; Byrne, Eimear; Greferath, Marcus
2007-01-01
We develop a framework for linear-programming (LP) decoding of non-binary linear codes over rings. We prove that the resulting LP decoder has the `maximum likelihood certificate' property, and we show that the decoder output is the lowest cost pseudocodeword. Equivalence between pseudocodewords of the linear program and pseudocodewords of graph covers is proved. LP decoding performance is illustrated for the (11,6,5) ternary Golay code with ternary PSK modulation over AWGN, and in this case it is shown that the LP decoder performance is comparable to codeword-error-rate-optimum hard-decision based decoding.
Non-linear index coding outperforming the linear optimum
Lubetzky, Eyal
2008-01-01
The following source coding problem was introduced by Birk and Kol: a sender holds a word $x\\in\\{0,1\\}^n$, and wishes to broadcast a codeword to $n$ receivers, $R_1,...,R_n$. The receiver $R_i$ is interested in $x_i$, and has prior \\emph{side information} comprising some subset of the $n$ bits. This corresponds to a directed graph $G$ on $n$ vertices, where $i j$ is an edge iff $R_i$ knows the bit $x_j$. An \\emph{index code} for $G$ is an encoding scheme which enables each $R_i$ to always reconstruct $x_i$, given his side information. The minimal word length of an index code was studied by Bar-Yossef, Birk, Jayram and Kol (FOCS 2006). They introduced a graph parameter, $\\minrk_2(G)$, which completely characterizes the length of an optimal \\emph{linear} index code for $G$. The authors of BBJK showed that in various cases linear codes attain the optimal word length, and conjectured that linear index coding is in fact \\emph{always} optimal. In this work, we disprove the main conjecture of BBJK in the following s...
Grayscale Image Compression Based on Min Max Block Truncating Coding
Hilal Almarabeh
2011-11-01
Full Text Available This paper presents an image compression techniques based on block truncating coding. In this work, a min max block truncating coding (MM_BTC is presented for grayscale image compression relies on applying dividing image into non-overlapping blocks. MM_BTC differ from other block truncating coding such as block truncating coding (BTC in the way of selecting the quantization level in order to remove redundancy. Objectives measures such as: Bit Rate (BR, Mean Square Error (MSE, Peak Signal to Noise Ratio (PSNR, and Redundancy (R, were used to present a detailed evaluation of MM_BTC of image quality.
Zhaolin Jiang
2014-01-01
Full Text Available We first give the block style spectral decomposition of arbitrary block skew circulant matrix with skew circulant blocks. Secondly, we obtain the singular value of block skew circulant matrix with skew circulant blocks as well. Finally, based on the block style spectral decomposition, we deal with the optimal backward perturbation analysis for the block skew circulant linear system with skew circulant blocks.
Deterministic mediated superdense coding with linear optics
Pavičić, Mladen, E-mail: mpavicic@physik.hu-berlin.de [Department of Physics—Nanooptics, Faculty of Mathematics and Natural Sciences, Humboldt University of Berlin (Germany); Center of Excellence for Advanced Materials and Sensing Devices (CEMS), Photonics and Quantum Optics Unit, Ruđer Bošković Institute, Zagreb (Croatia)
2016-02-22
We present a scheme of deterministic mediated superdense coding of entangled photon states employing only linear-optics elements. Ideally, we are able to deterministically transfer four messages by manipulating just one of the photons. Two degrees of freedom, polarization and spatial, are used. A new kind of source of heralded down-converted photon pairs conditioned on detection of another pair with an efficiency of 92% is proposed. Realistic probabilistic experimental verification of the scheme with such a source of preselected pairs is feasible with today's technology. We obtain the channel capacity of 1.78 bits for a full-fledged implementation. - Highlights: • Deterministic linear optics mediated superdense coding is proposed. • Two degrees of freedom, polarization and spatial, are used. • Heralded source of conditioned entangled photon pairs, 92% efficient, is proposed.
BLOCK BIDIAGONALIZATION METHODS FOR MULTIPLE NONSYMMETRIC LINEAR SYSTEMS
戴华
2001-01-01
The symmetric linear system gives us many simplifications and a possibility to adapt the computations to the computer at hand in order to achieve better performance. The aim of this paper is to consider the block bidiagonalization methods derived from a symmetric augmented multiple linear systems and make a comparison with the block GMRES and block biconjugate gradient methods.
Linear Index Coding via Semidefinite Programming
Chlamtac, Eden
2011-01-01
In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is known to be equal to a graph parameter called minrank (Bar-Yossef et al., FOCS, 2006). We show a polynomial time algorithm that, given an n vertex graph G with minrank k, finds a linear index code for G of length $\\widetilde{O}(n^{f(k)})$, where f(k) depends only on k. For example, for k=3 we obtain f(3) ~ 0.2574. Our algorithm employs a semidefinite program (SDP) introduced by Karger, Motwani and Sudan (J. ACM, 1998) for graph coloring and its refined analysis due to Arora, Chlamtac and Charikar (STOC, 2006). Since the SDP we use is not a relaxation of the minimization problem we consider, a crucial component of our ana...
Rateless Coding for MIMO Block Fading Channels
Fan, Yijia; Erkip, Elza; Poor, H Vincent
2008-01-01
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed from the analysis that the design of such rateless codes follows the design principle of approximately universal codes for parallel multiple-input multiple-output (MIMO) channels, in which each sub-channel is a MIMO channel. More specifically, it is shown that for a single-input single-output (SISO) channel, the previously developed permutation codes of unit length for parallel channels having rate LR can be transformed directly into rateless codes of length L having multiple rate levels (R, 2R, . . ., LR), to achieve the DMT performance limit.
Block diagonalization for algebra's associated with block codes
Gijswijt, D.
2009-01-01
For a matrix *-algebra B, consider the matrix *-algebra A consisting of the symmetric tensors in the n-fold tensor product of B. Examples of such algebras in coding theory include the Bose-Mesner algebra and Terwilliger algebra of the (non)binary Hamming cube, and algebras arising in SDP-hierarchies
QUASI-SYSTEMATIC BLOCK-CIRCULANT LDPC CODES
Xu Ying; Wei Guo
2008-01-01
A class of Quasi-Systematic Block-Circulant Low-Density Parity-Check (QSBC-LDPC) codes is proposed. Block-circulant LDPC codes have been studied a lot recently,because the simple structures of their parity-check matrices are very helpful to reduce the implementation complexities.QSBC-LDPC codes are special block-circulant LDPC codes with quasi-systematic parity-check ma-trices. The memories for encoders of QSBC-LDPC codes are limited,and the encoding process can be carried out in a simple recursive way with low complexities. Researches show that the QSBC-LDPC codes can provide remarkable performances with low encoding complexities.
Some new quasi-twisted ternary linear codes
Rumen Daskalov
2015-09-01
Full Text Available Let [n, k, d]_q code be a linear code of length n, dimension k and minimum Hamming distance d over GF(q. One of the basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6].
Sparsity in Linear Predictive Coding of Speech
Giacobello, Daniele
modern speech coders. In the first part of the thesis, we provide an overview of Sparse Linear Predic- tion, a set of speech processing tools created by introducing sparsity constraints into the LP framework. This approach defines predictors that look for a sparse residual rather than a minimum variance...... of high-order sparse predictors. These predictors, by modeling efficiently the spectral envelope and the harmonics components with very few coefficients, have direct applications in speech processing, engendering a joint estimation of short-term and long-term predictors. We also give preliminary results...... sensing formulation. Furthermore, we define a novel re-estimation procedure to adapt the predictor coefficients to the given sparse excitation, balancing the two representations in the context of speech coding. Finally, the advantages of the compact parametric representation of a segment of speech, given...
LPNORM: A linear programming normative analysis code
de Caritat, Patrice; Bloch, John; Hutcheon, Ian
1994-04-01
The computer code LPNORM implements the mathematical method of linear programming to calculate the mineralogical makeup of mineral mixtures, such as rock, sediment, or soil samples, from their bulk geochemical composition and from the mineralogical (or geochemical) composition of the contained minerals. This method simultaneously solves the set of linear equations governing the distribution of oxides into these minerals, subject to an objective function and a set of basic constraints. LPNORM allows the user to specify what minerals will be considered for normative analysis, what their composition is (in terms of mineral formula or geochemical composition), and whether to maximize mineral abundances, minimize slack variables (oxides that can not be accounted for), or do both at once in the objective function. Independent knowledge about the abundance of one or several of the minerals in the sample can be entered as additional equality or inequality constraints. Trial-and-error approach enables the user to "optimize" the composition of one or a few of the contained minerals. Results of comparative tests, highlighting the efficiency, as well as the shortcomings, of LPNORM are presented.
GENETIC ALGORITHM FOR DECODING LINEAR CODES OVER AWGN AND FADING CHANNELS
H. BERBIA
2011-08-01
Full Text Available This paper introduces a decoder for binary linear codes based on Genetic Algorithm (GA over the Gaussian and Rayleigh flat fading channel. The performances and compututional complexity of our decoder applied to BCH and convolutional codes are good compared to Chase-2 and Viterbi algorithm respectively. It show that our algorithm is less complex for linear block codes of large block length; furthermore it's performances can be improved by tuning the decoder's parameters, in particular the number of individuals by population and the number of generations
On Random Linear Network Coding for Butterfly Network
Guang, Xuan
2010-01-01
Random linear network coding is a feasible encoding tool for network coding, specially for the non-coherent network, and its performance is important in theory and application. In this letter, we study the performance of random linear network coding for the well-known butterfly network by analyzing the failure probabilities. We determine the failure probabilities of random linear network coding for the well-known butterfly network and the butterfly network with channel failure probability p.
Differential modulation based on space-time block codes
李正权; 胡光锐
2004-01-01
A differential modulation scheme using space-time block codes is put forward. Compared with other schemes,our scheme has lower computational complexity and has a simpler decoder. In the case of three or four transmitter antennas, our scheme has a higher rate a higher coding gain and a lower bit error rate for a given rate. Then we made simulations for space-time block codes as well as group codes in the case of two, three, four and five transmit antennas. The simulations prove that using two transmit antennas, one receive antenna and code rate of 4 bits/s/Hz, the differential STBC method outperform the differential group codes method by 4 dB. Useing three, four and five transmit antennas,one receive antenna, and code rate of 3 bits/s/Hz are adopted, the differential STBC method outperform the differential group codes method by 5 dB, 6.5 dB and 7 dB, respectively. In other words, the differential modulation scheme based on space-time block code is better than the corresponding differential modulation scheme
Channel Coding over Multiple Coherence Blocks with Queueing Constraints
Qiao, Deli; Velipasalar, Senem
2010-01-01
This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading model, in which fading stays constant in each coherence block and change independently between blocks, is considered. It is assumed that channel coding is performed over multiple coherence blocks. An approximate lower bound on the transmission rate is obtained from Feintein's Lemma. This lower bound is considered as the service rate and is incorporated into the effective capacity formulation, which characterizes the maximum constant arrival rate that can be supported under statistical queuing constraints. Performances of variable-rate and fixed-rate transmissions are studied. The optimum error probability for variable rate transmission and the optimum coding rate for fixed rate transmission are shown to be unique. Moreover, the tradeoff between the throughput and the number of...
Adaptive cosine transform image coding with variable block size and constant block distortion
Daut, David G.; Wu, Jia-Chyi
1996-02-01
An adaptive discrete cosine transform (DCT) image coding system is implemented with the same average distortion designated for each variable size image block. The variable block size segmentation is performed using a quadtree data structure by dividing the perceptually more important regions of an image into smaller size blocks compared to the size of blocks containing lesser amounts of spatial activity. Due to the nonstationarity of real-world images, each image block is described by a space-varying nonstationary Gauss-Markov random field. The space-varying autoregressive parameters are estimated using an on-line modified least- squares estimator. For each assumed space-varying nonstationary image block, a constant average distortion is assigned and the code rate for each image block is allowed to vary in order to meet the fixed distortion criterion. Simulation results show that reconstructed images coded at low average distortion, based on an assumed space-varying nonstationary image model, using variable size blocks and with variable bit rate per block possess high-quality subjective (visual) and objective (measured) quality at low average bit rates. Performance gains are achieved due to the distortion being distributed more uniformly among the blocks as compared with fixed-rate, stationary image transform coding schemes.
Space-Time Block Coding for Time Slotted CDMA Systems with Frequency-Selective Fading
WANGYingmin; YIKechu; NIUZhongxia; TIANHongxin
2003-01-01
The radio channel fading is one of the most important physical limitations for wireless mobile communications. Space-time coding is a coding technique that is designed for use with multiple transmit antennas and offers an effective transmit diversity technique to combat fading. However, most existing space-time coding schemes assume fiat fading that may not be valid for wideband wireless mobile communication channels. In this paper, a novel spacetime block coding scheme based on block processing is proposed for time slotted CDMA systems with frequencyselective fading. In order to get quasi-orthogonality, we encode the information based on the two data fields (blocks) of a burst, other than the symbols in a data field (block). As a consequence, it is convenient for block processing of joint detection which can be used with just some small modifications of the algorithms with no space-time coding. For decoding the new space time codes, block linear joint detection algorithms are developed. Then, we simplify these algorithms with an iterative procedure. With moderate iterative times, the computation complexity of the simplified algorithms is much less than that of the exact algorithms. Simulation results show that the performance of the simplified joint detection algorithms approximates to that of the exact ones.
Hu, J H; Wang, Y; Cahill, P T
1997-01-01
This paper reports a multispectral code excited linear prediction (MCELP) method for the compression of multispectral images. Different linear prediction models and adaptation schemes have been compared. The method that uses a forward adaptive autoregressive (AR) model has been proven to achieve a good compromise between performance, complexity, and robustness. This approach is referred to as the MFCELP method. Given a set of multispectral images, the linear predictive coefficients are updated over nonoverlapping three-dimensional (3-D) macroblocks. Each macroblock is further divided into several 3-D micro-blocks, and the best excitation signal for each microblock is determined through an analysis-by-synthesis procedure. The MFCELP method has been applied to multispectral magnetic resonance (MR) images. To satisfy the high quality requirement for medical images, the error between the original image set and the synthesized one is further specified using a vector quantizer. This method has been applied to images from 26 clinical MR neuro studies (20 slices/study, three spectral bands/slice, 256x256 pixels/band, 12 b/pixel). The MFCELP method provides a significant visual improvement over the discrete cosine transform (DCT) based Joint Photographers Expert Group (JPEG) method, the wavelet transform based embedded zero-tree wavelet (EZW) coding method, and the vector tree (VT) coding method, as well as the multispectral segmented autoregressive moving average (MSARMA) method we developed previously.
An Efficient Soft Decoder of Block Codes Based on Compact Genetic Algorithm
Ahmed Azouaoui
2012-09-01
Full Text Available Soft-decision decoding is an NP-hard problem with great interest to developers of communication systems. We present an efficient soft-decision decoder of linear block codes based on compact genetic algorithm (cGA and compare its performances with various other decoding algorithms including Shakeel algorithm. The proposed algorithm uses the dual code in contrast to Shakeel algorithm which uses the code itself. Hence, this new approach reduces the decoding complexity of high rates codes. The complexity and an optimized version of this new algorithm are also presented and discussed.
The generalization of some trellis properties of linear codes to group codes
KAN HaiBin; LI XueFei; SHEN Hong
2009-01-01
In this paper, we discuss some trellis properties for codes over a finite Abelian group, which are the generalization of the corresponding trellis properties for linear codes over a field. Also, we also inves-tigate difficulties when we try to generalize a property of a tail-biting trellis for a linear code over a field to a group code.
Convolutional cylinder-type block-circulant cycle codes
Mohammad Gholami
2013-06-01
Full Text Available In this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. Then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. Finally, we show that the free distance of the convolutional codes is equal to the minimum distance of their block counterparts.
A Novel Block-Based Scheme for Arithmetic Coding
Qi-Bin Hou
2014-06-01
Full Text Available It is well-known that for a given sequence, its optimal codeword length is fixed. Many coding schemes have been proposed to make the codeword length as close to the optimal value as possible. In this paper, a new block-based coding scheme operating on the subsequences of a source sequence is proposed. It is proved that the optimal codeword lengths of the subsequences are not larger than that of the given sequence. Experimental results using arithmetic coding will be presented.
Iterative decoding of Generalized Parallel Concatenated Block codes using cyclic permutations
Hamid Allouch
2012-09-01
Full Text Available Iterative decoding techniques have gain popularity due to their performance and their application in most communications systems. In this paper, we present a new application of our iterative decoder on the GPCB (Generalized Parallel Concatenated Block codes which uses cyclic permutations. We introduce a new variant of the component decoder. After extensive simulation; the obtained result is very promising compared with several existing methods. We evaluate the effects of various parameters component codes, interleaver size, block size, and the number of iterations. Three interesting results are obtained; the first one is that the performances in terms of BER (Bit Error Rate of the new constituent decoder are relatively similar to that of original one. Secondly our turbo decoding outperforms another turbo decoder for some linear block codes. Thirdly the proposed iterative decoding of GPCB-BCH (75, 51 is about 2.1dB from its Shannon limit.
Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes
Skachek, Vitaly; Byrne, Eimear; Greferath, Marcus
2007-01-01
In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many classes of codes these polytopes yield a complexity advantage for decoding. These representations lead to polynomial-time decoders for a wide variety of classical non-binary linear codes.
Yu, Xiangbin; Dong, Tao; Xu, Dazhuan; Bi, Guangguo
2010-09-01
By introducing an orthogonal space-time coding scheme, multiuser code division multiple access (CDMA) systems with different space time codes are given, and corresponding system performance is investigated over a Nakagami-m fading channel. A low-complexity multiuser receiver scheme is developed for space-time block coded CDMA (STBC-CDMA) systems. The scheme can make full use of the complex orthogonality of space-time block coding to simplify the high decoding complexity of the existing scheme. Compared to the existing scheme with exponential decoding complexity, it has linear decoding complexity. Based on the performance analysis and mathematical calculation, the average bit error rate (BER) of the system is derived in detail for integer m and non-integer m, respectively. As a result, a tight closed-form BER expression is obtained for STBC-CDMA with an orthogonal spreading code, and an approximate closed-form BER expression is attained for STBC-CDMA with a quasi-orthogonal spreading code. Simulation results show that the proposed scheme can achieve almost the same performance as the existing scheme with low complexity. Moreover, the simulation results for average BER are consistent with the theoretical analysis.
UNIT-RATE COMPLEX ORTHOGONAL SPACE-TIME BLOCK CODE CONCATENATED WITH TURBO CODING
无
2006-01-01
Space-Time Block (STB) code has been an effective transmit diversity technique for combating fading due to its orthogonal design, simple decoding and high diversity gains. In this paper, a unit-rate complex orthogonal STB code for multiple antennas in Time Division Duplex (TDD) mode is proposed. Meanwhile, Turbo Coding (TC) is employed to improve the performance of proposed STB code further by utilizing its good ability to combat the burst error of fading channel. Compared with full-diversity multiple antennas STB codes, the proposed code can implement unit rate and partial diversity; and it has much smaller computational complexity under the same system throughput. Moreover, the application of TC can effectively make up for the performance loss due to partial diversity. Simulation results show that on the condition of same system throughput and concatenation of TC, the proposed code has lower Bit Error Rate (BER) than those full-diversity codes.
Decoding Algorithms for Random Linear Network Codes
Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank
2011-01-01
achieve a high coding throughput, and reduce energy consumption.We use an on-the-fly version of the Gauss-Jordan algorithm as a baseline, and provide several simple improvements to reduce the number of operations needed to perform decoding. Our tests show that the improvements can reduce the number...
Improved Linear Attacks on the Chinese Block Cipher Standard
刘明洁; 陈佳哲
2014-01-01
The block cipher used in the Chinese Wireless LAN Standard (WAPI), SMS4, was recently renamed as SM4, and became the block cipher standard issued by the Chinese government. This paper gives a method for finding the linear approximations of SMS4. With this method, 19-round one-dimensional approximations are given, which are used to improve the previous linear cryptanalysis of SMS4. The 19-round approximations hold with bias 2−62.27; we use one of them to leverage a linear attack on 23-round SMS4. Our attack improves the previous 23-round attacks by reducing the time complexity. Furthermore, the data complexity of our attack is further improved by the multidimensional linear approach.
New linear codes from matrix-product codes with polynomial units
Hernando, Fernando; Ruano Benito, Diego
2010-01-01
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.......A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented....
Non-coherent space-time code based on full diversity space-time block coding
无
2008-01-01
A non-unitary non-coherent space-time code which is capable of achieving full algebraic diversity is proposed based on full diversity space-time block coding. The error performance is optimized by transforming the non-unitary space-time code into unitary space-time code. By exploiting the desired structure of the proposed code, a grouped generalized likelihood ratio test decoding algorithm is presented to overcome the high complexity of the optimal algorithm. Simulation results show that the proposed code possesses high spectrum efficiency in contrast to the unitary space-time code despite slight loss in the SNR, and besides, the proposed grouped decoding algorithm provides good tradeoff between performance and complexity.
Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel
Muhammad, Fahad Syed; Hélard, Jean-François; Crussière, Matthieu
2008-01-01
Discrete multitone modulation (DMT) systems exploit the capabilities of orthogonal subcarriers to cope efficiently with narrowband interference, high frequency attenuations and multipath fadings with the help of simple equalization filters. Adaptive linear precoded discrete multitone (LP-DMT) system is based on classical DMT, combined with a linear precoding component. In this paper, we investigate the bit and energy allocation algorithm of an adaptive LP-DMT system taking into account the channel coding scheme. A coded adaptive LPDMT system is presented in the power line communication (PLC) context with a loading algorithm which accommodates the channel coding gains in bit and energy calculations. The performance of a concatenated channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states trellis code and an outer Reed-Solomon code, in combination with the proposed algorithm is analyzed. Theoretical coding gains are derived and simulation results are presented for a fixed target bit error ra...
Product Perfect Z2Z4-linear codes in Steganography
Rifa, J
2010-01-01
Product perfect codes have been proven to enhance the performance of the F5 steganographic method, whereas perfect Z2Z4-linear codes have been recently introduced as an efficient way to embed data, conforming to the +/-1-steganography. In this paper, we present two steganographic methods. On the one hand, a generalization of product perfect codes is made. On the other hand, this generalization is applied to perfect Z2Z4-linear codes. Finally, the performance of the proposed methods is evaluated and compared with those of the aforementioned schemes.
A Note on the Stopping Redundancy of Linear Codes
Shu-Tao Xia
2006-01-01
In this paper, we study the stopping sets, stopping distance and stopping redundancy for binary linear codes.Stopping redundancy is a new concept proposed by Schwartz and Vardy recently for evaluating the performance of a linear code under iterative decoding over a binary erasure channel (BEC). Since the exact value of stopping redundancy is difficult to obtain in general, good lower and upper bounds are important. We obtain a new general upper bound on the stopping redundancy of binary linear codes which improves the corresponding results of Schwartz and Vardy.
Riemann-Roch Spaces and Linear Network Codes
Hansen, Johan P.
2015-01-01
We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated with the Suzuki and Ree groups all having the maximal...... number of points for curves of their respective genera. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang %\\cite{DBLP:journals/tit/KoetterK08} introduced...... in the above metric making them suitable for linear network coding....
Riemann-Roch Spaces and Linear Network Codes
Hansen, Johan P.
We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated with the Suzuki and Ree groups all having the maximal...... number of points for curves of their respective genera. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang %\\cite{DBLP:journals/tit/KoetterK08} introduced...... in the above metric making them suitable for linear network coding....
Stability and Stabilization of Block-cascading Switched Linear Systems
Ya-Hong Zhu; Dai-Zhan Cheng
2006-01-01
The main purpose of this paper is to investigate the problem of quadratic stability and stabilization in switched linear systems using reducible Lie algebra. First, we investigate the structure of all real invariant subspaces for a given linear system. The result is then used to provide a comparable cascading form for switching models. Using the commoncascading form, a common quadratic Lyapunov function is (QLFs) is explored by finding common QLFs of diagonal blocks.In addition, a cascading Quaker Lemma is proved. Combining it with stability results, the problem of feedback stabilization for a class of switched linear systems is solved.
Lin Dengsheng; Li Qiang; Li Shaoqian
2008-01-01
This paper studies the nonsystematic Low-Density Parity-Check (LDPC) codes based on Symmetric Balanced Incomplete Block Design (SBIBD). First, it is concluded that the performance degradation of nonsystematic linear block codes is bounded by the average row weight of generalized inverses of their generator matrices and code rate. Then a class of nonsystematic LDPC codes con- structed based on SBIBD is presented. Their characteristics include: both generator matrices and parity-check matrices are sparse and cyclic, which are simple to encode and decode; and almost arbi- trary rate codes can be easily constructed, so they are rate-compatible codes. Because there are sparse generalized inverses of generator matrices, the performance of the proposed codes is only 0.15dB away from that of the traditional systematic LDPC codes.
Rateless Space Time Block Code for Massive MIMO Systems
Ali H. Alqahtani
2014-01-01
Full Text Available This paper presents a rateless space time block code (RSTBC for massive MIMO systems. The paper illustrates the basis of rateless space time codes deployments in massive MIMO transmissions over wireless erasure channels. In such channels, data may be lost or is not decodable at the receiver due to a variety of factors such as channel fading, interference, or antenna element failure. We show that RSTBC guarantees the reliability of the system in such cases, even when the data loss rate is 25% or more. In such a highly lossy channel, the conventional fixed-rate codes fail to perform well, particularly when channel state information is not available at the transmitter. Simulation results are provided to demonstrate the BER performance and the spectral efficiency of the proposed scheme.
Experimental proposal of probabilistic superdense coding with linear optical elements
Lin Qing; Li Jian; Guo Guangcan [Key Laboratory of Quantum Information, University of Science and Technology of China, Hefei 230026 (China)
2006-09-14
In this paper, we propose an experimental scheme of probabilistic superdense coding assisted with linear optical manipulations, photon entanglement produced from parametric down-conversion and postselection from coincidence measurements. The proposal is feasible by current experimental technology.
Block Preconditioners for Complex Symmetric Linear System with Two-by-Two Block Form
Shi-Liang Wu
2015-01-01
Full Text Available Based on the previous work by Zhang and Zheng (A parameterized splitting iteration method for complex symmetric linear systems, Japan J. Indust. Appl. Math., 31 (2014 265–278, three block preconditioners for complex symmetric linear system with two-by-two block form are presented. Spectral properties of the preconditioned matrices are discussed in detail. It is shown that all the eigenvalues of the preconditioned matrices are well-clustered. Numerical experiments are reported to illustrate the efficiency of the proposed preconditioners.
On improving linear solver performance: a block variant of GMRES
Baker, A H; Dennis, J M; Jessup, E R
2004-05-10
The increasing gap between processor performance and memory access time warrants the re-examination of data movement in iterative linear solver algorithms. For this reason, we explore and establish the feasibility of modifying a standard iterative linear solver algorithm in a manner that reduces the movement of data through memory. In particular, we present an alternative to the restarted GMRES algorithm for solving a single right-hand side linear system Ax = b based on solving the block linear system AX = B. Algorithm performance, i.e. time to solution, is improved by using the matrix A in operations on groups of vectors. Experimental results demonstrate the importance of implementation choices on data movement as well as the effectiveness of the new method on a variety of problems from different application areas.
On the Pseudocodeword Redundancy of Binary Linear Codes
Zumbrägel, Jens; Flanagan, Mark F
2011-01-01
The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. It is shown that most codes do not have a finite pseudocodeword redundancy. Also, upper bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs, are provided. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Furthermore, comprehensive results are provided on the cases of cyclic codes of length at most 250 for which the eigenvalue bound of Vontobel and Koetter is sharp.
Linear-optics manipulations of photon-loss codes
Banaszek, K; Banaszek, Konrad; Wasilewski, Wojciech
2007-01-01
We discuss codes for protecting logical qubits carried by optical fields from the effects of amplitude damping, i.e. linear photon loss. We demonstrate that the correctability condition for one-photon loss imposes limitations on the range of manipulations than can be implemented with passive linear-optics networks.
Efficient spread space-time block coding scheme in multiple antenna systems
Qiu Ling; Zheng Xiayu
2006-01-01
Space-time coding is an important technique that can improve transmission performance at fading environments in mobile communication systems. In this paper, we propose a novel diversity scheme using spread spacetime block coding (SSTBC) in multiple antenna systems. At the transmitter, the primitive data are serial to parallel converted to multiple data streams, and each stream is rotated in constellation. Then Walsh codes are used to spread each symbol to all antenna space in a space-time block. The signals received from all receiver antennas are combined with the maximum ratio combining (MRC), equalized with linear equalizer to eliminate the inter-code interference and finally demodulated to recover to transmit data by using the one-symbol maximum likelihood detector. The proposed scheme does not sacrifice the spectrum efficiency meanwhile maintains the transceiver with low complexity. Owing to the transmission symbols of different transmit antennas passing through all the spatial subchannels between transceiver antenna pairs, the system obtains the partial additional space diversity gain of all spatial paths. It is also shown that the diversity gain is better than the previous space-time block coding (STBC) schemes with full transmission rate.
Blasco, Francisco Lazaro
2011-01-01
A novel fountain coding scheme has been introduced. The scheme consists of a parallel concatenation of a MDS block code with a LRFC code, both constructed over the same field, $F_q$. The performance of the concatenated fountain coding scheme has been analyzed through derivation of tight bounds on the probability of decoding failure as a function of the overhead. It has been shown how the concatenated scheme performs as well as LRFC codes in channels characterized by high erasure probabilities, whereas they provide failure probabilities lower by several orders of magnitude at moderate/low erasure probabilities.
Linear Shrinkage Behaviour of Compacted Loam Masonry Blocks
NAWAB ALI LAKHO
2017-04-01
Full Text Available Walls of wet loam, used in earthen houses, generally experience more shrinkage which results in cracks and less compressive strength. This paper presents a technique of producing loam masonry blocks that are compacted in drained state during casting process in order to minimize shrinkage. For this purpose, loam masonry blocks were cast and compacted at a pressure of 6 MPa and then dried in shade by covering them in plastic sheet. The results show that linear shrinkage of 2% occurred which is smaller when compared to un-compacted wet loam walls. This implies that the loam masonry blocks compacted in drained state is expected to perform better than un-compacted wet loam walls.
Multidimensional Coded Modulation in Block-Fading Channnels
Fabregas, Albert Guillen i
2007-01-01
We study the problem of constructing coded modulation schemes over multidimensional signal sets in Nakagami-$m$ block-fading channels. In particular, we consider the optimal diversity reliability exponent of the error probability when the multidimensional constellation is obtained as the rotation of classical complex-plane signal constellations. We show that multidimensional rotations of full dimension achieve the optimal diversity reliability exponent, also achieved by Gaussian constellations. Multidimensional rotations of full dimension induce a large decoding complexity, and in some cases it might be beneficial to use multiple rotations of smaller dimension. We also study the diversity reliability exponent in this case, which yields the optimal rate-diversity-complexity tradeoff in block-fading channels with discrete inputs.
无
2002-01-01
Based on the studies of Reed-Solomon codes and orthogonal space-time block codes over Rayleigh fading channel, a theoretical method for estimating performance of Reed-Solomon codes concatenated with orthogonal space-time block codes is presented in this paper. And an upper bound of the bit error rate is also obtained. It is shown through computer simulations that the signal-to-noise ratio reduces about 15 dB or more after orthogonal space-time block codes are concatenate with Reed-Solomon (15,6) codes over Rayleigh fading channel, when the bit error rate is 10-4.
Cryptanalysis of Block Ciphers with Probabilistic Non-Linear Relations of Low Degree
Jakobsen, Thomas
1998-01-01
(x,y)=0$ between plaintext $x$ and ciphertext $y$ that hold with small probability $\\mu$.The second attack needs access to $n=(2m/\\mu)^2$ plaintext/ciphertext pairs where $m=\\deg p$ and its running time is also polynomial in $n$. As a demonstration, we break up to 10 rounds of a cipher constructed...... employed is essentially Sudan's algorithm for decoding Reed-Solomon codes beyond the error-correction diameter. The known-plaintext attack needs $n=2m/\\mu^2$ plaintext/ciphertext pairs and the running time is polynomial in $n$.Furthermore, it is shown how to discover more general non-linear relations $p...... by Nyberg and Knudsen provablysecure against differential and linear cryptanalysis.Key words: Cryptanalysis, block cipher, interpolation attack, non-linear relations, Reed-Solomon codes, Sudan's algorithm....
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
Ayanoglu, Ender; Karipidis, Eleftherios
2009-01-01
The computational complexity of optimum decoding for an orthogonal space-time block code G satisfying the orthogonality property that the Hermitian transpose of G multiplied by G is equal to a constant c times the sum of the squared symbols of the code times an identity matrix, where c is a positive integer is quantified. Four equivalent techniques of optimum decoding which have the same computational complexity are specified. Modifications to the basic formulation in special cases are calculated and illustrated by means of examples. This paper corrects and extends [1],[2], and unifies them with the results from the literature. In addition, a number of results from the literature are extended to the case c > 1.
Solving block linear systems with low-rank off-diagonal blocks is easily parallelizable
Menkov, V. [Indiana Univ., Bloomington, IN (United States)
1996-12-31
An easily and efficiently parallelizable direct method is given for solving a block linear system Bx = y, where B = D + Q is the sum of a non-singular block diagonal matrix D and a matrix Q with low-rank blocks. This implicitly defines a new preconditioning method with an operation count close to the cost of calculating a matrix-vector product Qw for some w, plus at most twice the cost of calculating Qw for some w. When implemented on a parallel machine the processor utilization can be as good as that of those operations. Order estimates are given for the general case, and an implementation is compared to block SSOR preconditioning.
NOLB : Non-linear rigid block normal mode analysis method.
Hoffmann, Alexandre; Grudinin, Sergei
2017-04-05
We present a new conceptually simple and computationally efficient method for non-linear normal mode analysis called NOLB. It relies on the rotations-translations of blocks (RTB) theoretical basis developed by Y.-H. Sanejouand and colleagues. We demonstrate how to physically interpret the eigenvalues computed in the RTB basis in terms of angular and linear velocities applied to the rigid blocks and how to construct a non-linear extrapolation of motion out of these velocities. The key observation of our method is that the angular velocity of a rigid block can be interpreted as the result of an implicit force, such that the motion of the rigid block can be considered as a pure rotation about a certain center. We demonstrate the motions produced with the NOLB method on three different molecular systems and show that some of the lowest frequency normal modes correspond to the biologically relevant motions. For example, NOLB detects the spiral sliding motion of the TALE protein, which is capable of rapid diffusion along its target DNA. Overall, our method produces better structures compared to the standard approach, especially at large deformation amplitudes, as we demonstrate by visual inspection, energy and topology analyses, and also by the MolProbity service validation. Finally, our method is scalable and can be applied to very large molecular systems, such as ribosomes. Standalone executables of the NOLB normal mode analysis method are available at https://team.inria.fr/nano-d/software/nolb-normal-modes. A graphical user interfaces created for the SAMSON software platform will be made available at https: //www.samson-connect.net.
Osculating Spaces of Varieties and Linear Network Codes
Hansen, Johan P.
We present a general theory to obtain good linear network codes utilizing the osculating nature of algebraic varieties. In particular, we obtain from the osculating spaces of Veronese varieties explicit families of equideminsional vector spaces, in which any pair of distinct vector spaces...... intersects in the same dimension. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vector space. Ralf Koetter and Frank R. Kschischang introduced a metric on the set af vector spaces and showed that a minimal...... distance decoder for this metric achieves correct decoding if the dimension of the intersection of the transmitted and received vector space is sufficiently large. The obtained osculating spaces of Veronese varieties are equidistant in the above metric. The parameters of the resulting linear network codes...
Osculating Spaces of Varieties and Linear Network Codes
Hansen, Johan P.
2013-01-01
We present a general theory to obtain good linear network codes utilizing the osculating nature of algebraic varieties. In particular, we obtain from the osculating spaces of Veronese varieties explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces...... intersects in the same dimension. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vector space. Ralf Koetter and Frank R. Kschischang introduced a metric on the set af vector spaces and showed that a minimal...... distance decoder for this metric achieves correct decoding if the dimension of the intersection of the transmitted and received vector space is sufficiently large. The obtained osculating spaces of Veronese varieties are equidistant in the above metric. The parameters of the resulting linear network codes...
Passive stabilization in a linear MHD stability code
Todd, A.M.M.
1980-03-01
Utilizing a Galerkin procedure to calculate the vacuum contribution to the ideal MHD Lagrangian, the implementation of realistic boundary conditions are described in a linear stability code. The procedure permits calculation of the effect of arbitrary conducting structure on ideal MHD instabilities, as opposed to the prior use of an encircling shell. The passive stabilization of conducting coils on the tokamak vertical instability is calculated within the PEST code and gives excellent agreement with 2-D time dependent simulations of PDX.
Implementation Of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs
Zhao, Yue
2012-01-01
With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. LDPC codes can accomplish bit error rates (BERs) as low as $10^{-15}$ even at a small bit-energy-to-noise-power-spectral-density ratio ($E_{b}/N_{0}$). In order to evaluate the error performance of LDPC codes, simulators running on central processing units (CPUs) are commonly used. However, the time taken to evaluate LDPC codes with very good error performance is excessive. For example, assuming 30 iterations are used in the decoder, our simulation results have shown that it takes a modern CPU more than 7 days to arrive at a BER of 10^{-6} for a code with length 18360. In this paper, efficient LDPC block-code decoders/simulators which run on graphics processing units (GPUs) are proposed. Both standard BP decoding algorithm and layered decoding algorithm are used. We also implement the decoder for the LDPC convolutional codes (LDPCCC). The LDPCCC is derived from a pre-de...
Linear MHD stability studies with the STARWALL code
Merkel, P
2015-01-01
The STARWALL/CAS3D/OPTIM code package is a powerful tool to study the linear MHD stability of 3D, ideal equilibria in the presence of multiply-connected ideal and/or resistive conducting structures, and their feedback stabilization by external currents. Robust feedback stabilization of resistive wall modes can be modelled with the OPTIM code. Resistive MHD studies are possible combining STARWALL with the linear, resistive 2D CASTOR code as well as nonlinear MHD simulations combining STARWALL with the JOREK code. In the present paper, a detailed description of the STARWALL code is given and some of its applications are presented to demonstrate the methods used. Conducting structures are treated in the thin wall approximation and depending on their complexity they are discretized by a spectral method or by triangular finite elements. As an example, a configuration is considered consisting of an ideal plasma surrounded by a vacuum domain containing a resistive wall and bounded by an external wall. Ideal linear M...
A fast block mode selection approach for H. Visual coding
LIN Wei-yao; Fang Xiang-zhong; HUANG Xiu-chao; LI Dian; LIU Xiao-feng
2006-01-01
In this paper,a new fast mode-selection approach is proposed.This algorithm combines the proposed approaches of mode pre-decision and precise large-small mode decision,by selecting the best mode efficiently.Experimental results show that the proposed approach can reduce the computational cost of full search and fast multi-block motion estimation by 8% and 45%,respectively,with similar visual quality and bit rate.The proposed algorithm also reduces by 75% the computational cost of the large-small mode isolation algorithm for low-motion sequence coding,and with 0.06 PSNR gain and 3.7% reduction in bit rate.
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
Kashyap, Navin
2008-01-01
A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear ``local constraint'' codes to be associated with the edges and vertices, respectively, of the graph. The $\\k$-complexity of a graphical realization is defined to be the largest dimension of any of its local constraint codes. $\\k$-complexity is a reasonable measure of the computational complexity of a sum-product decoding algorithm specified by a graphical realization. The main focus of this paper is on the following problem: given a linear code C and a graph G, how small can the $\\k$-complexity of a realization of C on G be? As useful tools for attacking this problem, we introduce the Vertex-Cut Bound, and the notion of ``vc-treewidth'' for a graph, which is closely related to the well-known graph-theoretic notion of treewidth. Using these tools, we derive tight lower bounds on the $\\k$-complexity of any realization of C on G. Our...
Linear programming bounds for unitary space time codes
Creignou, Jean
2008-01-01
The linear programming method is applied to the space $\\U_n(\\C)$ of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theoretical and numerical results improving previously known bounds are derived.
Riemann-Roch Spaces and Linear Network Codes
Hansen, Johan P.
2015-01-01
We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated with the Suzuki and Ree groups all having the maximal...
Block-based embedded color image and video coding
Nagaraj, Nithin; Pearlman, William A.; Islam, Asad
2004-01-01
Set Partitioned Embedded bloCK coder (SPECK) has been found to perform comparable to the best-known still grayscale image coders like EZW, SPIHT, JPEG2000 etc. In this paper, we first propose Color-SPECK (CSPECK), a natural extension of SPECK to handle color still images in the YUV 4:2:0 format. Extensions to other YUV formats are also possible. PSNR results indicate that CSPECK is among the best known color coders while the perceptual quality of reconstruction is superior than SPIHT and JPEG2000. We then propose a moving picture based coding system called Motion-SPECK with CSPECK as the core algorithm in an intra-based setting. Specifically, we demonstrate two modes of operation of Motion-SPECK, namely the constant-rate mode where every frame is coded at the same bit-rate and the constant-distortion mode, where we ensure the same quality for each frame. Results on well-known CIF sequences indicate that Motion-SPECK performs comparable to Motion-JPEG2000 while the visual quality of the sequence is in general superior. Both CSPECK and Motion-SPECK automatically inherit all the desirable features of SPECK such as embeddedness, low computational complexity, highly efficient performance, fast decoding and low dynamic memory requirements. The intended applications of Motion-SPECK would be high-end and emerging video applications such as High Quality Digital Video Recording System, Internet Video, Medical Imaging etc.
Multistep Linear Programming Approaches for Decoding Low-Density Parity-Check Codes
LIU Haiyang; MA Lianrong; CHEN Jie
2009-01-01
The problem of improving the performance of linear programming (LP) decoding of low-density padty-check (LDPC) codes is considered in this paper. A multistep linear programming (MLP) algorithm was developed for decoding LDPC codes that includes a slight increase in computational complexity. The MLP decoder adaptively adds new constraints which are compatible with a selected check node to refine the re-sults when an error is reported by the odginal LP decoder. The MLP decoder result is shown to have the maximum-likelihood (ML) certificate property. Simulations with moderate block length LDPC codes suggest that the MLP decoder gives better performance than both the odginal LP decoder and the conventional sum-product (SP) decoder.
无
2001-01-01
A multi-dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re-encoded for more than once. It provides a convenient platform to design high performance codes with flexible interleaver size.Coset based MAP soft-in/soft-out decoding algorithms are presented for the F24 code. Simulation results show that the proposed coding scheme can achieve high coding gain with flexible interleaver length and very low decoding complexity.
Linear and nonlinear verification of gyrokinetic microstability codes
Bravenec, R. V.; Candy, J.; Barnes, M.; Holland, C.
2011-12-01
Verification of nonlinear microstability codes is a necessary step before comparisons or predictions of turbulent transport in toroidal devices can be justified. By verification we mean demonstrating that a code correctly solves the mathematical model upon which it is based. Some degree of verification can be accomplished indirectly from analytical instability threshold conditions, nonlinear saturation estimates, etc., for relatively simple plasmas. However, verification for experimentally relevant plasma conditions and physics is beyond the realm of analytical treatment and must rely on code-to-code comparisons, i.e., benchmarking. The premise is that the codes are verified for a given problem or set of parameters if they all agree within a specified tolerance. True verification requires comparisons for a number of plasma conditions, e.g., different devices, discharges, times, and radii. Running the codes and keeping track of linear and nonlinear inputs and results for all conditions could be prohibitive unless there was some degree of automation. We have written software to do just this and have formulated a metric for assessing agreement of nonlinear simulations. We present comparisons, both linear and nonlinear, between the gyrokinetic codes GYRO [J. Candy and R. E. Waltz, J. Comput. Phys. 186, 545 (2003)] and GS2 [W. Dorland, F. Jenko, M. Kotschenreuther, and B. N. Rogers, Phys. Rev. Lett. 85, 5579 (2000)]. We do so at the mid-radius for the same discharge as in earlier work [C. Holland, A. E. White, G. R. McKee, M. W. Shafer, J. Candy, R. E. Waltz, L. Schmitz, and G. R. Tynan, Phys. Plasmas 16, 052301 (2009)]. The comparisons include electromagnetic fluctuations, passing and trapped electrons, plasma shaping, one kinetic impurity, and finite Debye-length effects. Results neglecting and including electron collisions (Lorentz model) are presented. We find that the linear frequencies with or without collisions agree well between codes, as do the time averages of
The Minimum Distance of Linear Codes and Fat Points
Tohaneanu, Stefan O
2011-01-01
Let $A(Z)$ be the generating matrix of some linear code with parameters $[s,n+1,d]$ over an arbitrary field $\\mathbb K$. In this paper, we associate to $A(Z)$ a set of fat points $Z \\subseteq \\mathbb P^n$, and we show that $d$, the minimum distance of the code, is bounded below by specific shifts in the graded minimal free resolution of $I_Z$, the defining ideal of $Z$. We give better bounds in the case that the support of $Z$ is a complete intersection.
Reduction of Transmitted Information Using Similarities between Range Blocks in Fractal Image Coding
Hu, Xiaotong; Qiu, Shuping; Kuroda, Hideo
2007-01-01
Fractal image coding uses the similarities between the best matching domain blocks and range blocks to reconstruct image. In the transmitted information, the information about the best matching domain blocks occupies a large percentage, so the reduction of information about the best matching domain blocks is the most effective method to reduce the quality of transmitted information. On the other hand, there are similarities between range blocks from each other. So, when range blocks are simil...
Perfect Z2Z4-linear codes in Steganography
Rifà, H; Ronquillo, L
2010-01-01
Steganography is an information hiding application which aims to hide secret data imperceptibly into a commonly used media. Unfortunately, the theoretical hiding asymptotical capacity of steganographic systems is not attained by algorithms developed so far. In this paper, we describe a novel coding method based on Z2Z4-linear codes that conforms to +/-1-steganography, that is secret data is embedded into a cover message by distorting each symbol by one unit at most. This method solves some problems encountered by the most efficient methods known today, based on ternary Hamming codes. Finally, the performance of this new technique is compared with that of the mentioned methods and with the well-known theoretical upper bound.
Weight hierarchies of linear codes satisfying the almost chain condition
无
2003-01-01
The weight hierarchy of a linear [n, k; q] code C over GF(q) is the sequence (d1, d2,…,dk) where dr is the size of the smallest support of an r-dimensional subcode of C. An [n, k; q] codehas dimension r and support of size dr for all r. Further, C satisfies the almost chain condition ifit does not satisfy the chain condition, but there exist subcodes Dr of dimension r and support offor a sequence to be the weight hierarchy of a code satisfying the almost chain condition is given.Further, explicit constructions of such codes are given, showing that in almost all cases, the necessaryconditions are also sufficient.
Avoiding Interruptions - QoE Trade-offs in Block-coded Streaming Media Applications
Parandehgheibi, Ali; Shakkottai, Srinivas; Ozdaglar, Asu
2010-01-01
We take an analytical approach to study Quality of user Experience (QoE) for video streaming applications. First, we show that random linear network coding applied to blocks of video frames can significantly simplify the packet requests at the network layer and save resources by avoiding duplicate packet reception. Network coding allows us to model the receiver's buffer as a queue with Poisson arrivals and deterministic departures. We consider the probability of interruption in video playback as well as the number of initially buffered packets (initial waiting time) as the QoE metrics. We characterize the optimal trade-off between these metrics by providing upper and lower bounds on the minimum initial buffer size, required to achieve certain level of interruption probability for different regimes of the system parameters. Our bounds are asymptotically tight as the file size goes to infinity.
Linear Scaling Real Time TDDFT in the CONQUEST Code
O'Rourke, Conn
2014-01-01
The real time formulation of Time Dependent Density Functional Theory (RT-TDDFT) is implemented in the linear scaling density functional theory code CONQEST. Proceeding through the propagation of the density matrix, as opposed to the Kohn-Sham orbitals, it is possible to reduced the computational workload. Imposing a cut-off on the density matrix the effort can be made to scale linearly with the size of the system under study. Propagation of the reduced density matrix in this manner provides direct access to the optical response of very large systems, which would be otherwise impractical to obtain using the standard formulations of TDDFT. We discuss our implementation and present several benchmark tests illustrating the validity of the method, and the factors affecting its accuracy. Finally we illustrate the effect of density matrix truncation on the optical response, and illustrate that computational load scales linearly with the system size.
Ye, Xianggui; Yu, Xifei; Sun, Zhaoyan; An, Lijia
2006-06-22
By using a combinatorial screening method based on the self-consistent field theory (SCFT) for polymers, we have investigated the morphology of H-shaped ABC block copolymers (A2BC2) and compared them with those of the linear ABC block copolymers. By changing the ratios of the volume fractions of two A arms and two C arms, one can obtain block copolymers with different architectures ranging from linear block copolymer to H-shaped block copolymer. By systematically varying the volume fractions of block A, B, and C, the triangle phase diagrams of the H-shaped ABC block copolymer with equal interactions among the three species are constructed. In this study, we find four different morphologies (lamellar phase (LAM), hexagonal lattice phase (HEX), core-shell hexagonal lattice phase (CSH), and two interpenetrating tetragonal lattice (TET2)). Furthermore, the order-order transitions driven by architectural change are discussed.
Hesham Mahrous
2016-02-01
Full Text Available This paper proposes a compressive sensing (CS method for multi-channel electroencephalogram (EEG signals in Wireless Body Area Network (WBAN applications, where the battery life of sensors is limited. For the single EEG channel case, known as the single measurement vector (SMV problem, the Block Sparse Bayesian Learning-BO (BSBL-BO method has been shown to yield good results. This method exploits the block sparsity and the intra-correlation (i.e., the linear dependency within the measurement vector of a single channel. For the multichannel case, known as the multi-measurement vector (MMV problem, the Spatio-Temporal Sparse Bayesian Learning (STSBL-EM method has been proposed. This method learns the joint correlation structure in the multichannel signals by whitening the model in the temporal and the spatial domains. Our proposed method represents the multi-channels signal data as a vector that is constructed in a specific way, so that it has a better block sparsity structure than the conventional representation obtained by stacking the measurement vectors of the different channels. To reconstruct the multichannel EEG signals, we modify the parameters of the BSBL-BO algorithm, so that it can exploit not only the linear but also the non-linear dependency structures in a vector. The modified BSBL-BO is then applied on the vector with the better sparsity structure. The proposed method is shown to significantly outperform existing SMV and also MMV methods. It also shows significant lower compression errors even at high compression ratios such as 10:1 on three different datasets.
On linear $q$-ary completely regular codes with $\\rho=2$ and dual antipodal
Borges, Joaquim; Zinoviev, Victor
2010-01-01
We characterize all linear $q$-ary completely regular codes with covering radius $\\rho=2$ when the dual codes are antipodal. These completely regular codes are extensions of linear completely regular codes with covering radius 1, which are all classified. For $\\rho=2$, we give a list of all such codes known to us. This also gives the characterization of two weight linear antipodal codes.
Ultrasonic linear array validation via concrete test blocks
Hoegh, Kyle, E-mail: hoeg0021@umn.edu; Khazanovich, Lev, E-mail: hoeg0021@umn.edu [University of Minnesota Department of Civil, Environmental, and Geo- Engineering 500 Pillsbury Drive S.E. Minneapolis, MN 55455-0116 (United States); Ferraro, Chris [Lynch and Ferraro Engineering, Inc., 2570 Greenhill Way, Oviedo, FL 32765 (United States); Clayton, Dwight [Oak Ridge National Laboratory (United States)
2015-03-31
Oak Ridge National Laboratory (ORNL) comparatively evaluated the ability of a number of NDE techniques to generate an image of the volume of 6.5′ X 5.0′ X 10″ concrete specimens fabricated at the Florida Department of Transportation (FDOT) NDE Validation Facility in Gainesville, Florida. These test blocks were fabricated to test the ability of various NDE methods to characterize various placements and sizes of rebar as well as simulated cracking and non-consolidation flaws. The first version of the ultrasonic linear array device, MIRA [version 1], was one of 7 different NDE equipment used to characterize the specimens. This paper deals with the ability of this equipment to determine subsurface characterizations such as reinforcing steel relative size, concrete thickness, irregularities, and inclusions using Kirchhoff-based migration techniques. The ability of individual synthetic aperture focusing technique (SAFT) B-scan cross sections resulting from self-contained scans are compared with various processing, analysis, and interpretation methods using the various features fabricated in the specimens for validation. The performance is detailed, especially with respect to the limitations and implications for evaluation of a thicker, more heavily reinforced concrete structures.
Warped Discrete Cosine Transform-Based Low Bit-Rate Block Coding Using Image Downsampling
Ertürk Sarp
2007-01-01
Full Text Available This paper presents warped discrete cosine transform (WDCT-based low bit-rate block coding using image downsampling. While WDCT aims to improve the performance of conventional DCT by frequency warping, the WDCT has only been applicable to high bit-rate coding applications because of the overhead required to define the parameters of the warping filter. Recently, low bit-rate block coding based on image downsampling prior to block coding followed by upsampling after the decoding process is proposed to improve the compression performance for low bit-rate block coders. This paper demonstrates that a superior performance can be achieved if WDCT is used in conjunction with image downsampling-based block coding for low bit-rate applications.
Polynomial system solving for decoding linear codes and algebraic cryptanalysis
2009-01-01
This thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The paradigm we employ here is as follows. We reformulate the initial problem in terms of systems of polynomial equations over a finite field. The solution(s) of such systems should yield a way to solve the initial problem. Our main tools for handling polynomials and polynomial systems in such a paradigm is the technique of Gröbner bases and normal form reductions. The ...
Experimental verification of the linear and non-linear versions of a panel code
Grigoropoulos, G. J.; Katsikis, C.; Chalkias, D. S.
2011-03-01
In the proposed paper numerical calculations are carried out using two versions of a three-dimensional, timedomain panel method developed by the group of Prof. P. Sclavounos at MIT, i.e. the linear code SWAN2, enabling optionally the use of the instantaneous non-linear Froude-Krylov and hydrostatic forces and the fully non-linear SWAN4. The analytical results are compared with experimental results for three hull forms with increasing geometrical complexity, the Series 60, a reefer vessel with stern bulb and a modern fast ROPAX hull form with hollow bottom in the stern region. The details of the geometrical modeling of the hull forms are discussed. In addition, since SWAN4 does not support transom sterns, only the two versions of SWAN2 were evaluated over experimental results for the parent hull form of the NTUA double-chine, wide-transom, high-speed monohull series. The effect of speed on the numerical predictions was investigated. It is concluded that both versions of SWAN2 the linear and the one with the non-linear Froude-Krylov and hydrostatic forces provide a more robust tool for prediction of the dynamic response of the vessels than the non-linear SWAN4 code. In general, their results are close to what was expected on the basis of experience. Furthermore, the use of the option of non-linear Froude-Krylov and hydrostatic forces is beneficial for the accuracy of the predictions. The content of the paper is based on the Diploma thesis of the second author, supervised by the first one and further refined by the third one.
ARC Code TI: Block-GP: Scalable Gaussian Process Regression
National Aeronautics and Space Administration — Block GP is a Gaussian Process regression framework for multimodal data, that can be an order of magnitude more scalable than existing state-of-the-art nonlinear...
2010 Census Blocks with Geographic Codes Southwestern PA
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — This file can be used as a tool to append geographic codes to geocoded point data. The file was developed by Pitt's Center for Social and Urban Research and...
A progressive transmission image coder using linear phase uniform filterbanks as block transforms.
Tran, T D; Nguyen, T Q
1999-01-01
This paper presents a novel image coding scheme using M-channel linear phase perfect reconstruction filterbanks (LPPRFBs) in the embedded zerotree wavelet (EZW) framework introduced by Shapiro (1993). The innovation here is to replace the EZWs dyadic wavelet transform by M-channel uniform-band maximally decimated LPPRFBs, which offer finer frequency spectrum partitioning and higher energy compaction. The transform stage can now be implemented as a block transform which supports parallel processing and facilitates region-of-interest coding/decoding. For hardware implementation, the transform boasts efficient lattice structures, which employ a minimal number of delay elements and are robust under the quantization of lattice coefficients. The resulting compression algorithm also retains all the attractive properties of the EZW coder and its variations such as progressive image transmission, embedded quantization, exact bit rate control, and idempotency. Despite its simplicity, our new coder outperforms some of the best image coders published previously in the literature, for almost all test images (especially natural, hard-to-code ones) at almost all bit rates.
Lingyang Song
2007-04-01
Full Text Available We report a simple differential modulation scheme for quasi-orthogonal space-time block codes. A new class of quasi-orthogonal coding structures that can provide partial transmit diversity is presented for various numbers of transmit antennas. Differential encoding and decoding can be simplified for differential Alamouti-like codes by grouping the signals in the transmitted matrix and decoupling the detection of data symbols, respectively. The new scheme can achieve constant amplitude of transmitted signals, and avoid signal constellation expansion; in addition it has a linear signal detector with very low complexity. Simulation results show that these partial-diversity codes can provide very useful results at low SNR for current communication systems. Extension to more than four transmit antennas is also considered.
Space-time Block Codes Based on Quasi-Orthogonal Designs
李正权; 胡光锐; 单红梅
2004-01-01
A new space-time block codes based on quasi-orthogonal designs are put forward. First the channel model is formulated. Then the connection between orthogonal/quasiorthogonal designs and space-time block codes is explored.Finally we make simulations for the transmission of 4 bits/s/Hz and 6 bits/s/Hz using eight transmit antennas using the rate 3/4 quasi-orthogonal space-time block code and the rate 1/2 full-diversity orthogonal space-time block code.Simulation results show that full transmission rate is more important for very low signal noise ratio (SNR) and high bit error probability (BEP), while full diversity is more important for very high SNR and low BEP.
COMPLEMENT BLOCK CODING SCHEME FOR REDUCING PEAK-TO-AVERAGE POWER RATIO OF OFDM SYSTEMS
Jiang Tao; Zhu Guangxi
2004-01-01
A new scheme termed as Complement Block Coding (CBC) technique is proposed to reduce the Peak-to-Average Power Ratio (PAPR) of OFDM signals. Utilizing the complement bits which are added to the original information bits,this method can effectively reduce the PAPR of OFDM systems with random frame size N and the coding rate R ≤ (N - k)/N, where kis a positive integer and k ≤ N/2. The performance results obtained with CBC are given and compared with that of some well known schemes, such as Simple Block Coding (SBC), Modified Simple Block Coding (MSBC) and Simple Odd Parity Code (SOPC) for the same purpose. The results show that, at the same coding rate 3/4, the CBC can achieve almost the same performance as SBC, MSBC, but with lower complexity, and that the same performance can be obtained with higher coding rate by using CBC. At the same coding rate (N - 1)/N, the PAPR reduction of CBC is almost the twice as that of SOPC when N ≥ 16. Further more, the PAPR reductions with coding rate (N - 1)/N are almost the same as that with coding rate less than (N - 1)/N,so the proposed scheme CBC is more suitable for the large frame size with high coding rate and can provide error detection.
On the algebraic representation of certain optimal non-linear binary codes
Greferath, Marcus
2011-01-01
This paper investigates some optimal non-linear codes, in particular cyclic codes, by considering them as (non-linear) codes over Z_4. We use the Fourier transform as well as subgroups of the unit group of a group ring to analyse these codes. In particular we find a presentation of Best's (10, 40, 4) code as a coset of a subgroup in the unit group of a ring, and derive a simple decoding algorithm from this presentation. We also apply this technique to analyse Julin's (12, 144, 4) code and the (12, 24, 12) Hadamard code, as well as to construct a (14, 56, 6) binary code.
Cascaded Orthogonal Space-Time Block Codes for Wireless Multi-Hop Relay Networks
Vaze, Rahul
2008-01-01
Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This paper proposes a new distributed space-time block code called the cascaded orthogonal space-time block code (COSTBC) for the case where the source and destination are equipped with multiple antennas and each relay stage has one or more single antenna relays. Each relay stage is assumed to have receive channel state information (CSI) for all the channels from the source to itself, while the destination is assumed to have receive CSI for all the channels. To construct the COSTBC, multiple orthogonal space-time block codes are used in cascade by the source and each relay stage. In the COSTBC, each relay stage separates the constellation symbols of the orthogonal space-time block code sent by the preceding relay stage using its CSI, and then transmits another orthogonal space-time block code to the ...
ADAPTIVE BLOCK QMRIOM（q）METHOD FOR SOLVING UNSYMMETRIC LINEAR SYSTEMS WITH MULTI
WangZhengsheng
2002-01-01
Many applications require the solution of large un-symmetric linear systems with multiple right-hand sides.Instead of applying an iterative method to each of these systems individually,it is often more efficient to use a block version of the method that generates iterates for all the systems simultaneously.This paper proposes a new adaptive block QMR version based on the incomplete or-thogomalization method(IOM(q))for solving large multi-ple nusymmetric linear systems.How to incorporate de-flation to drop comverged linear systems,and how to delete linearly and almost liearly dependent vectors in the underlying block Krylov sequences are discussed.Nu-merical experiments show that the new adaptive block method has better practical performance and less compu-tational cost and CPU time than block GMRES and other proposed methods for the solution of systems with multi- ple right-hand sides.
Optimal Linear Joint Source-Channel Coding with Delay Constraint
Johannesson, Erik; Bernhardsson, Bo; Ghulchak, Andrey
2012-01-01
The problem of joint source-channel coding is considered for a stationary remote (noisy) Gaussian source and a Gaussian channel. The encoder and decoder are assumed to be causal and their combined operations are subject to a delay constraint. It is shown that, under the mean-square error distortion metric, an optimal encoder-decoder pair from the linear and time-invariant (LTI) class can be found by minimization of a convex functional and a spectral factorization. The functional to be minimized is the sum of the well-known cost in a corresponding Wiener filter problem and a new term, which is induced by the channel noise and whose coefficient is the inverse of the channel's signal-to-noise ratio. This result is shown to also hold in the case of vector-valued signals, assuming parallel additive white Gaussian noise channels. It is also shown that optimal LTI encoders and decoders generally require infinite memory, which implies that approximations are necessary. A numerical example is provided, which compares ...
Block quasi-minimal residual iterations for non-Hermitian linear systems
Freund, R.W. [AT& T Bell Labs., Murray Hill, NJ (United States)
1994-12-31
Many applications require the solution of multiple linear systems that have the same coefficient matrix, but differ only in their right-hand sides. Instead of applying an iterative method to each of these systems individually, it is usually more efficient to employ a block version of the method that generates blocks of iterates for all the systems simultaneously. An example of such an iteration is the block conjugate gradient algorithm, which was first studied by Underwood and O`Leary. On parallel architectures, block versions of conjugate gradient-type methods are attractive even for the solution of single linear systems, since they have fewer synchronization points than the standard versions of these algorithms. In this talk, the author presents a block version of Freund and Nachtigal`s quasi-minimal residual (QMR) method for the iterative solution of non-Hermitian linear systems. He describes two different implementations of the block-QMR method, one based on a block version of the three-term Lanczos algorithm and one based on coupled two-term block recurrences. In both cases, the underlying block-Lanczos process still allows arbitrary normalizations of the vectors within each block, and the author discusses different normalization strategies. To maintain linear independence within each block, it is usually necessary to reduce the block size in the course of the iteration, and the author describes a deflation technique for performing this reduction. He also present some convergence results, and reports results of numerical experiments with the block-QMR method. Finally, the author discusses possible block versions of transpose-free Lanczos-based iterations such as the TFQMR method.
A Kind of Quasi-Orthogonal Space-Time Block Codes and its Decoding Methods
无
2006-01-01
It is well known that it is impossible for complex orthogonal space-time block codes with full diversity and full rate to have more than two transmit antennas while non-orthogonal designs will lose the simplicity of maximum likelihxd decoding at receivers. In this paper, we propose a new quasi-orthogonal space-time block code. The code is quasi-orthogonal and can reduce the decoding complexity significantly by employing zero-forced and minimum mean squared error criteria.This paper also presents simulation results of two examples with three and four transmit antennas respectively.
An Improved Group Space-Time Block Code Through Constellation Rotation
ZHANG Hong-wei; ZHANG Hai-bin; SONG Wen-tao; LUO Han-wen; LIU Xing-zhao
2005-01-01
A new improved group space-time block code (G-STBC) based on constellation rotation for four transmit antennas was proposed. In comparison with the traditional G-STBC coding scheme, the proposed space-time code has longer code length and adopts proper rotation-based symbols, which can increase the minimum distance of space-time codes and thereby improve code gain and achieve full diversity performance. The simulation results verify that the proposed group space-time code can achieve better bit error performance than both the traditional group space-time code and other quasi-orthogonal space-time codes. Compared with Ma's full diversity full rate (FDFR) codes, the proposed space-time code also can achieve the same excellent error performance. Furthermore, the design of the new space-time code gives another new and simple method to construct space-time codes with full diversity and high rate in case that it is not easy to design the traditional FDFR space-time codes.
Improved intra-block copy and motion search methods for screen content coding
Rapaka, Krishna; Pang, Chao; Sole, Joel; Karczewicz, Marta; Li, Bin; Xu, Jizheng
2015-09-01
Screen content video coding extension of HEVC (SCC) is being developed by Joint Collaborative Team on Video Coding (JCT-VC) of ISO/IEC MPEG and ITU-T VCEG. Screen content usually features a mix of camera captured content and a significant proportion of rendered graphics, text, or animation. These two types of content exhibit distinct characteristics requiring different compression scheme to achieve better coding efficiency. This paper presents an efficient block matching schemes for coding screen content to better capture the spatial and temporal characteristics. The proposed schemes are mainly categorized as a) hash based global region block matching for intra block copy b) selective search based local region block matching for inter frame prediction c) hash based global region block matching for inter frame prediction. In the first part, a hash-based full frame block matching algorithm is designed for intra block copy to handle the repeating patterns and large motions when the reference picture constituted already decoded samples of the current picture. In the second part, a selective local area block matching algorithm is designed for inter motion estimation to handle sharp edges, high spatial frequencies and non-monotonic error surface. In the third part, a hash based full frame block matching algorithm is designed for inter motion estimation to handle repeating patterns and large motions across the temporal reference picture. The proposed schemes are compared against HM-13.0+RExt-6.0, which is the state-of-art screen content coding. The first part provides a luma BD-rate gains of -26.6%, -15.6%, -11.4% for AI, RA and LD TGM configurations. The second part provides a luma BD-rate gains of -10.1%, -12.3% for RA and LD TGM configurations. The third part provides a luma BD-rate gains of -12.2%, -11.5% for RA and LD TGM configurations.
Estimation linear model using block generalized inverse of a matrix
Jasińska, Elżbieta; Preweda, Edward
2013-01-01
The work shows the principle of generalized linear model, point estimation, which can be used as a basis for determining the status of movements and deformations of engineering objects. The structural model can be put on any boundary conditions, for example, to ensure the continuity of the deformations. Estimation by the method of least squares was carried out taking into account the terms and conditions of the Gauss- Markov for quadratic forms stored using Lagrange function. The original sol...
A Parallel Algorithm for Solving Block-diagonal Structured Large Linear System
SHEN Jie; ZHANG Zhong-lin; CHENG Ji-lin
2001-01-01
A parallel algorithm for solving block-diagonal structured large linear system is presented.This algorithm is based on the "gradient-simplex" method. It partitions a large linear system into several small linear subsystems so that they can be solved in parallel. The algorithm has the merit of high speed and is suitable for the large linear systems with less coupling constrains. The efficiency and applicability of the method is also analyzed.
Multi-stage decoding for multi-level block modulation codes
Lin, Shu
1991-01-01
In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. Based on our study and computation results, we find that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. In particular, we find that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum decoding of the overall code is very small: only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.
Differential Space-Time Block Code Modulation for DS-CDMA Systems
Liu Jianhua
2002-01-01
Full Text Available A differential space-time block code (DSTBC modulation scheme is used to improve the performance of DS-CDMA systems in fast time-dispersive fading channels. The resulting scheme is referred to as the differential space-time block code modulation for DS-CDMA (DSTBC-CDMA systems. The new modulation and demodulation schemes are especially studied for the down-link transmission of DS-CDMA systems. We present three demodulation schemes, referred to as the differential space-time block code Rake (D-Rake receiver, differential space-time block code deterministic (D-Det receiver, and differential space-time block code deterministic de-prefix (D-Det-DP receiver, respectively. The D-Det receiver exploits the known information of the spreading sequences and their delayed paths deterministically besides the Rake type combination; consequently, it can outperform the D-Rake receiver, which employs the Rake type combination only. The D-Det-DP receiver avoids the effect of intersymbol interference and hence can offer better performance than the D-Det receiver.
Yamakami, T
2006-01-01
Our task of quantum list decoding for a classical block code is to recover from a given quantumly corrupted codeword a short list containing all messages whose codewords have high "presence" in this quantumly corrupted codeword. All known families of efficiently quantum list decodable codes, nonetheless, have exponentially-small message rate. We show that certain generalized Reed-Solomon codes concatenated with Hadamard codes of polynomially-small rate and constant codeword alphabet size have efficient quantum list decoding algorithms, provided that target codewords should have relatively high presence in a given quantumly corrupted codeword.
Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks
Torabkhani, Nima; Beirami, Ahmad; Fekri, Faramarz
2011-01-01
In this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks, packets are delayed due to either random link erasures or blocking by full buffers. We assert that because of RLNC, the content of buffers have dependencies which cannot be captured directly using the classical queueing theoretical models. We model the performance of the network using Markov chains by a careful derivation of the buffer occupancy states and their transition rules. We verify by simulations that the proposed framework results in an accurate measure of the network throughput offered by RLNC. Further, we introduce a class of acyclic networks for which the number of state variables is significantly reduced.
Evaluate the Word Error Rate of Binary Block Codes with Square Radius Probability Density Function
Chen, Xiaogang; Gu, Jian; Yang, Hongkui
2007-01-01
The word error rate (WER) of soft-decision-decoded binary block codes rarely has closed-form. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for low signal-to-noise ratios and become looser when a suboptimum decoding algorithm is used. This paper proposes a new concept named square radius probability density function (SR-PDF) of decision region to evaluate the WER. Based on the SR-PDF, The WER of binary block codes can be calculated precisely for ML and suboptimum decoders. Furthermore, for a long binary block code, SR-PDF can be approximated by Gamma distribution with only two parameters that can be measured easily. Using this property, two closed-form approximative expressions are proposed which are very close to the simulation results of the WER of interesting.
EXACT ERROR PROBABILITY OF ORTHOGONAL SPACE-TIME BLOCK CODES OVER FLAT FADING CHANNELS
Xu Feng; Yue Dianwu
2007-01-01
Space time block coding is a modulation scheme recently discovered for the transmit antenna diversity to combat the effects of wireless fading channels. Using the equivalent Single-Input Single-Output (SISO) model, this paper presents closed-form expressions for the exact Symbol Error Rate (SER) and Bit Error Rate (BER) of Orthogonal Space-Time Block Codes (OSTBCs) with M-ary Phase-Shift Keying (MPSK) and M-ary Quadrature Amplitude Modulation (MQAM) over flat uncorrelated Nakagami-m and Ricean fading channels.
System Performance of Concatenated STBC and Block Turbo Codes in Dispersive Fading Channels
Kam Tai Chan
2005-05-01
Full Text Available A new scheme of concatenating the block turbo code (BTC with the space-time block code (STBC for an OFDM system in dispersive fading channels is investigated in this paper. The good error correcting capability of BTC and the large diversity gain characteristics of STBC can be achieved simultaneously. The resulting receiver outperforms the iterative convolutional Turbo receiver with maximum- a-posteriori-probability expectation maximization (MAP-EM algorithm. Because of its ability to perform the encoding and decoding processes in parallel, the proposed system is easy to implement in real time.
PB-BLAS: A set of parallel block basic linear algebra subprograms
Choi, Jaeyoung [Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science; Dongarra, J. [Oak Ridge National Lab., TN (United States)]|[Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science; Walker, D.W. [Oak Ridge National Lab., TN (United States)
1994-12-31
We propose a new library of routines for performing dense linear algebra computations on block-partitioned matrices. The routines are referred to as the Block Basic Linear Algebra Subprograms, and their use is restricted to computations in which one or more of the matrices involved consists of a single row or column of blocks, and in which no more than one of the matrices consists of an unrestricted two-dimensional array of blocks. The functionality of the block BLAS routines can also be provided by Level 2 and 3 BLAS routines. However, for Non-Uniform Memory Access machines the use of the block BLAS permit certain optimizations in memory access to be taken advantage of. This is particularly true for distributed memory machines, for which the block BLAS are referred to as the Parallel Block Basic Linear Algebra Subprograms (PB-BLAS). The PB-BLAS are the main focus of this paper, and for a block-cyclic data distribution, a single row or column of blocks lies in a single row or column of the processor template. The PB-BLAS consist of calls to the sequential BLAS for local computations, and calls to the BLACS for communication. The PB-BLAS are the building blocks for implementing ScaLAPACK, the distributed-memory version of LAPACK, and provide the same ease-of-use and portability for ScaLAPACK that the BLAS provide for LAPACK. The PB-BLAS consists of all nine Level 3 BLAS routines, four of the Level-2 BLAS routines, and 2 auxiliary transpose routines. The PB-BLAS are currently available for all numeric data types, i.e., single and double precision real and complex.
Selecting Optimal Parameters of Random Linear Network Coding for Wireless Sensor Networks
Heide, Janus; Zhang, Qi; Fitzek, Frank
2013-01-01
This work studies how to select optimal code parameters of Random Linear Network Coding (RLNC) in Wireless Sensor Networks (WSNs). With Rateless Deluge [1] the authors proposed to apply Network Coding (NC) for Over-the-Air Programming (OAP) in WSNs, and demonstrated that with NC a significant...
Spatial Block Codes Based on Unitary Transformations Derived from Orthonormal Polynomial Sets
Mandyam Giridhar D
2002-01-01
Full Text Available Recent work in the development of diversity transformations for wireless systems has produced a theoretical framework for space-time block codes. Such codes are beneficial in that they may be easily concatenated with interleaved trellis codes and yet still may be decoded separately. In this paper, a theoretical framework is provided for the generation of spatial block codes of arbitrary dimensionality through the use of orthonormal polynomial sets. While these codes cannot maximize theoretical diversity performance for given dimensionality, they still provide performance improvements over the single-antenna case. In particular, their application to closed-loop transmit diversity systems is proposed, as the bandwidth necessary for feedback using these types of codes is fixed regardless of the number of antennas used. Simulation data is provided demonstrating these types of codes′ performance under this implementation as compared not only to the single-antenna case but also to the two-antenna code derived from the Radon-Hurwitz construction.
Adaptive Zero-Coefficient Distribution Scan for Inter Block Mode Coding of H.264/AVC
Wang, Jing-Xin; Su, Alvin W. Y.
Scanning quantized transform coefficients is an important tool for video coding. For example, the MPEG-4 video coder adopts three different scans to get better coding efficiency. This paper proposes an adaptive zero-coefficient distribution scan in inter block coding. The proposed method attempts to improve H.264/AVC zero coefficient coding by modifying the scan operation. Since the zero-coefficient distribution is changed by the proposed scan method, new VLC tables for syntax elements used in context-adaptive variable length coding (CAVLC) are also provided. The savings in bit-rate range from 2.2% to 5.1% in the high bit-rate cases, depending on different test sequences.
Um, Jeong-Gi; Han, Jisu; Lee, Dahye; Cho, Taechin
2017-04-01
A computer program code was developed to estimate the hydraulic head distribution through the 2-D DFN(discrete fracture network) blocks considering hydraulic aperture of the individual fractures, and to determine flow quantity, directional block hydraulic conductivity and principal hydraulic conductivity tensor according to fracture geometry such as orientation, frequency and size of the fracture network systems. The generated stochastic DFN system is assumed to have a network structure in which the equivalent flow pipe composed linear fractures is complexly connected. DFN systems often include individual or group of sub-network that are isolated from a network that can act as fluid flow passages from one flow boundary to another, and the fluid flow is completely blocked due to lack of connectivity. Fractures that are completely or partially isolated in the DFN system do not contribute to the overall fluid flow through the DFN system and add to the burden of numerical computation. This sometimes leads to numerical instability and failure to provide a solution. In this study, geometric and mathematical routines were designed and implemented to classify and eliminate such sub-networks. The developed program code can calculate the total head at each node connected to the flow path with various aperture as well as hydraulic conductivity of the individual flow pipe using the SOR method. Numerical experiments have been carried out to explore the applicability of the developed program code. A total of 108 stochastic 2-D DFN blocks of 20 m×20 m with various hydraulic aperture were prepared using two joint sets with fixed input parameters of fracture orientation, frequency and size distribution. The hydraulic anisotropy and the chance for equivalent continuum behavior of the DFN system were found to depend on the variability of fracture aperture.
Block-Orthogonal Space-Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction
Ren, Tian Peng; Yuen, Chau; Zhang, Er Yang
2011-01-01
Full-rate space time codes (STC) with rate = \\emph{number of transmit antennas} have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called \\emph{block-orthogonal} property, which can be exploited by QR-decomposition-based decoders to achieve significant decoding complexity reduction without performance loss. We show that such complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate BOSTC (block-orthogonal STC) that further maximize the QRDM complexity reduction potential. Simulation results of bit error rate (BER) performance against decoding complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-complexity mode, and the co...
High Hardware Utilization and Low Memory Block Requirement Decoding of QC-LDPC Codes
ZHAO Ling; LIU Rongke; HOU Yi; ZHANG Xiaolin
2012-01-01
This paper presents a simple yet effective decoding for general quasi-cyclic low-density parity-check (QC-LDPC) codes,which not only achieves high hardware utility efficiency (HUE),but also brings about great memory block reduction without any performance degradation.The main idea is to split the check matrix into several row blocks,then to perform the improved message passing computations sequentially block by block.As the decoding algorithm improves,the sequential tie between the two-phase computations is broken,so that the two-phase computations can be overlapped which bring in high HUE.Two overlapping schemes are also presented,each of which suits a different situation.In addition,an efficient memory arrangement scheme is proposed to reduce the great memory block requirement of the LDPC decoder.As an example,for the 0.4 rate LDPC code selected from Chinese Digital TV Terrestrial Broadcasting (DTTB),our decoding saves over 80％ memory blocks compared with the conventional decoding,and the decoder achieves 0.97 HUE.Finally,the 0.4 rate LDPC decoder is implemented on an FPGA device EP2S30 (speed grade-5).Using 8 row processing units,the decoder can achieve a maximum net throughput of 28.5 Mbps at 20 iterations.
Valentina, Stephanie; Ogawa, Takahiro; Nakazono, Kazuko; Aoki, Daisuke; Takata, Toshikazu
2016-06-20
High-yielding synthesis of cyclic block copolymer (CBC) using the rotaxane protocol by linear-cyclic polymer topology transformation was first demonstrated. Initial complexation of OH-terminated sec-ammonium salt and a crown ether was followed by the successive living ring-opening polymerizations of two lactones to a linear block copolymer having a rotaxane structure by the final capping of the propagation end. CBC was obtained in a high yield by an exploitation of the mechanical linkage through the translational movement of the rotaxane component to transform polymer structure from linear to cyclic. Furthermore, the change of the polymer topology was translated into a macroscopic change in crystallinity of the block copolymer.
Equidistant Linear Network Codes with maximal Error-protection from Veronese Varieties
Hansen, Johan P.
2012-01-01
Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vectorspace. Ralf Koetter and Frank R. Kschischang in Coding for errors and erasures in random network coding (IEEE Transactions on Information Theory...... construct explicit families of vector-spaces of constant dimension where any pair of distinct vector-spaces are equidistant in the above metric. The parameters of the resulting linear network codes which have maximal error-protection are determined....
PYESSENCE: Generalized Coupled Quintessence Linear Perturbation Python Code
Leithes, Alexander
2016-09-01
PYESSENCE evolves linearly perturbed coupled quintessence models with multiple (cold dark matter) CDM fluid species and multiple DE (dark energy) scalar fields, and can be used to generate quantities such as the growth factor of large scale structure for any coupled quintessence model with an arbitrary number of fields and fluids and arbitrary couplings.
Performance of Turbo Interference Cancellation Receivers in Space-Time Block Coded DS-CDMA Systems
Emmanuel Oluremi Bejide
2008-07-01
Full Text Available We investigate the performance of turbo interference cancellation receivers in the space time block coded (STBC direct-sequence code division multiple access (DS-CDMA system. Depending on the concatenation scheme used, we divide these receivers into the partitioned approach (PA and the iterative approach (IA receivers. The performance of both the PA and IA receivers is evaluated in Rayleigh fading channels for the uplink scenario. Numerical results show that the MMSE front-end turbo space-time iterative approach receiver (IA effectively combats the mixture of MAI and intersymbol interference (ISI. To further investigate the possible achievable data rates in the turbo interference cancellation receivers, we introduce the puncturing of the turbo code through the use of rate compatible punctured turbo codes (RCPTCs. Simulation results suggest that combining interference cancellation, turbo decoding, STBC, and RCPTC can significantly improve the achievable data rates for a synchronous DS-CDMA system for the uplink in Rayleigh flat fading channels.
Adaptive Multi-Layered Space-Time Block Coded Systems in Wireless Environments
Al-Ghadhban, Samir
2014-12-23
© 2014, Springer Science+Business Media New York. Multi-layered space-time block coded systems (MLSTBC) strike a balance between spatial multiplexing and transmit diversity. In this paper, we analyze the block error rate performance of MLSTBC. In addition, we propose an adaptive MLSTBC schemes that are capable of accommodating the channel signal-to-noise ratio variation of wireless systems by near instantaneously adapting the uplink transmission configuration. The main results demonstrate that significant effective throughput improvements can be achieved while maintaining a certain target bit error rate.
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model
Cramer, Ronald; Damgård, Ivan Bjerre; Döttling, Nico
Non-malleable codes were introduced by Dziembowski et al. (ICS 2010) as coding schemes that protect a message against tampering attacks. Roughly speaking, a code is non-malleable if decoding an adversarially tampered encoding of a message m produces the original message m or a value m' (eventuall...... non-malleable codes of Agrawal et al. (TCC 2015) and of Cher- aghchi and Guruswami (TCC 2014) and improves the previous result in the bit-wise tampering model: it builds the first non-malleable codes with linear-time complexity and optimal-rate (i.e. rate 1 - o(1))....
Block-Based Adaptive Vector Lifting Schemes for Multichannel Image Coding
Amel Benazza-Benyahia
2007-04-01
Full Text Available We are interested in lossless and progressive coding of multispectral images. To this respect, nonseparable vector lifting schemes are used in order to exploit simultaneously the spatial and the interchannel similarities. The involved operators are adapted to the image contents thanks to block-based procedures grounded on an entropy optimization criterion. A vector encoding technique derived from EZW allows us to further improve the efficiency of the proposed approach. Simulation tests performed on remote sensing images show that a significant gain in terms of bit rate is achieved by the resulting adaptive coding method with respect to the non-adaptive one.
Block-Based Adaptive Vector Lifting Schemes for Multichannel Image Coding
Pesquet Jean-Christophe
2007-01-01
Full Text Available We are interested in lossless and progressive coding of multispectral images. To this respect, nonseparable vector lifting schemes are used in order to exploit simultaneously the spatial and the interchannel similarities. The involved operators are adapted to the image contents thanks to block-based procedures grounded on an entropy optimization criterion. A vector encoding technique derived from EZW allows us to further improve the efficiency of the proposed approach. Simulation tests performed on remote sensing images show that a significant gain in terms of bit rate is achieved by the resulting adaptive coding method with respect to the non-adaptive one.
Synthesis of Dendritic-Linear Block Copolymers by Atom Transfer Radical Polymerization
无
2001-01-01
The dendritic polyarylether 2-bromoisobutyrate as the macromolecular initiator for the controlled free radical polymerization of styrene was investigated. The polymerization was carried out with CuBr/2,2′-bipyridine catalyst at 110℃. It is found that the hybrid dendritic-linear block copolymers possess well-defined molecular weights and low polydispersities.
A Coded Bit-Loading Linear Precoded Discrete Multitone Solution for Power Line Communication
Muhammad, Fahad Syed; Hélard, Jean-François; Crussière, Matthieu
2008-01-01
Linear precoded discrete multitone modulation (LP-DMT) system has been already proved advantageous with adaptive resource allocation algorithm in a power line communication (PLC) context. In this paper, we investigate the bit and energy allocation algorithm of an adaptive LP-DMT system taking into account the channel coding scheme. A coded adaptive LP-DMT system is presented in the PLC context with a loading algorithm which ccommodates the channel coding gains in bit and energy calculations. The performance of a concatenated channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states trellis code and an outer Reed-Solomon code, in combination with the roposed algorithm is analyzed. Simulation results are presented for a fixed target bit error rate in a multicarrier scenario under power spectral density constraint. Using a multipath model of PLC channel, it is shown that the proposed coded adaptive LP-DMT system performs better than classical coded discrete multitone.
PYESSENCE - Generalised Coupled Quintessence Linear Perturbation Python Code - User Guide
Leithes, Alexander
2016-01-01
This paper is a guide to the installation and use of the Python package PYESSENCE. PYESSENCE is designed to evolve linear perturbations to Coupled Quintessence models with a arbitrary number of cold dark matter (CDM) fluids and dark energy (DE) scalar fields as dictated by a given model. The equations are sufficiently general to allow for more exotic dark matter with a non-zero equation of state. Several example uses are included in order to demonstrate typical functionality to the potential user. PYESSENCE is released under an open source modified BSD license and is available on Bitbucket.
Modification of Elementary Operational Linear Chains in Compositional Control Unit with Code Sharing
Aleksander, A.; Larysa, A.; Aleksander, N.
2009-01-01
The new design method for compositional microprogram control units with code sharing and elementarization of operational linear chains is proposed. The method targets on reduction in the number of LUT-elements in the combinational part of control unit. Some additional control microinstructions containing codes of the classes of pseudoequivalent chains are used for operational linear chains modification. Proposed method is illustrated by an example. Most desirable GSA characteristics for using...
Joint channel estimation and symbol detection for space-time block code
单淑伟; 罗汉文; 宋文涛
2004-01-01
The simplified joint channel estimation and symbol detection based on the EM (expectation-maximization) algorithm for space-time block code (STBC) are proposed. By assuming channel to be invariant within only one STBC word and utilizing the orthogonal structure of STBC, the computational complexity and cost of this algorithm are both very low, so it is very suitable to implementation in real systems.
On codes, matroids and secure computation from linear secret sharing schemes
Cramer, R.J.F.; Daza, V.; Gracia, J.L.; Jimenez Urroz, J.; Leander, G.; Marti-Farre, J.; Padro, C.
2008-01-01
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes ar
A wavelet packet based block-partitioning image coding algorithm with rate-distortion optimization
YANG YongMing; XU Chao
2008-01-01
As an elegant generalization of wavelet transform, wavelet packet (WP) provides an effective representation tool for adaptive waveform analysis. Recent work shows that image-coding methods based on WP decomposition can achieve significant gain over those based on a usual wavelet transform. However, most of the work adopts a tree-structured quantization scheme, which is a successful technique for wavelet image coding, but not appropriate for WP subbands. This paper presents an image-coding algorithm based on a rate-distortion optimized wavelet packet decomposition and on an intraband block-partitioning scheme. By encoding each WP subband separately with the block-partitioning algorithm and the JPEG2000 context modeling, the proposed algorithm naturally avoids the difficulty in defining parent-offspring relationships for the WP coefficients, which has to be faced when adopting the tree-structured quantization scheme. The experimental results show that the proposed algorithm significantly outperforms SPIHT and JPEG2000 schemes and also surpasses state-of-the-art WP image coding algorithms, in terms of both PSNR and visual quality.
Low-Complexity Multiple Description Coding of Video Based on 3D Block Transforms
Norkin Andrey
2007-01-01
Full Text Available The paper presents a multiple description (MD video coder based on three-dimensional (3D transforms. Two balanced descriptions are created from a video sequence. In the encoder, video sequence is represented in a form of coarse sequence approximation (shaper included in both descriptions and residual sequence (details which is split between two descriptions. The shaper is obtained by block-wise pruned 3D-DCT. The residual sequence is coded by 3D-DCT or hybrid, LOT+DCT, 3D-transform. The coding scheme is targeted to mobile devices. It has low computational complexity and improved robustness of transmission over unreliable networks. The coder is able to work at very low redundancies. The coding scheme is simple, yet it outperforms some MD coders based on motion-compensated prediction, especially in the low-redundancy region. The margin is up to 3 dB for reconstruction from one description.
Low-Complexity Multiple Description Coding of Video Based on 3D Block Transforms
Andrey Norkin
2007-02-01
Full Text Available The paper presents a multiple description (MD video coder based on three-dimensional (3D transforms. Two balanced descriptions are created from a video sequence. In the encoder, video sequence is represented in a form of coarse sequence approximation (shaper included in both descriptions and residual sequence (details which is split between two descriptions. The shaper is obtained by block-wise pruned 3D-DCT. The residual sequence is coded by 3D-DCT or hybrid, LOT+DCT, 3D-transform. The coding scheme is targeted to mobile devices. It has low computational complexity and improved robustness of transmission over unreliable networks. The coder is able to work at very low redundancies. The coding scheme is simple, yet it outperforms some MD coders based on motion-compensated prediction, especially in the low-redundancy region. The margin is up to 3 dB for reconstruction from one description.
Mihai-Victor PRICOP
2010-09-01
Full Text Available The present paper introduces a numerical approach of static linear elasticity equations for anisotropic materials. The domain and boundary conditions are simple, to enhance an easy implementation of the finite difference scheme. SOR and gradient are used to solve the resulting linear system. The simplicity of the geometry is also useful for MPI parallelization of the code.
Bagci, Hakan
2014-11-11
We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.
Passive Copy-Move Forgery Detection Using Halftoning-based Block Truncation Coding Feature
Harjito, Bambang; Prasetyo, Heri
2017-06-01
This paper presents a new method on passive copy-move forgery detection by exploiting the effectiveness and usability of Halftoning-based Block Truncation Coding (HBTC) image feature. Copy-move forgery detection precisely locates the large size or flat tampered regions of an image. On our method, the tampered input image is firstly divided into several overlapping image blocks to construct the image feature descriptors. Each image block is further divided into several non-overlapping image blocks for processing HBTC. Two image feature descriptors, namely Color Feature (CF) and Bit Pattern Feature (BF) are computed from the HBTC compressed data-stream of each image block. Lexicography sorting rearranges the image feature descriptors in ascending manner for whole image. The similarity between some tampered image regions is measured based on their CF and BF under specific shift frequency threshold. As documented in the experimental results, the proposed method yields a promising result for detecting the tampered or copy-move forgery regions. It has proved that the HBTC is not only suitable for image compression, but it can also be used in the copy-move forgery detection.
Proceedings of the conference on computer codes and the linear accelerator community
Cooper, R.K. (comp.)
1990-07-01
The conference whose proceedings you are reading was envisioned as the second in a series, the first having been held in San Diego in January 1988. The intended participants were those people who are actively involved in writing and applying computer codes for the solution of problems related to the design and construction of linear accelerators. The first conference reviewed many of the codes both extant and under development. This second conference provided an opportunity to update the status of those codes, and to provide a forum in which emerging new 3D codes could be described and discussed. The afternoon poster session on the second day of the conference provided an opportunity for extended discussion. All in all, this conference was felt to be quite a useful interchange of ideas and developments in the field of 3D calculations, parallel computation, higher-order optics calculations, and code documentation and maintenance for the linear accelerator community. A third conference is planned.
An Approach to a Method of Construction of (F, K, 1) Optical Orthogonal Codes from Block Design
无
2000-01-01
(F, K, 1) Optical orthogonal codes (OOC) are the best address codes applied to optical code division multiple access (OCDMA) communication systems, but the construction of the codes is very complex. In this paper, a method of construction of the OOC from block design is discussed and a method of computer aid design is presented, by which we can construct desired (F, K, 1) OOC easily.
A MATLAB Code for Three Dimensional Linear Elastostatics using Constant Boundary Elements
P, Kirana Kumara
2013-01-01
Present work presents a code written in the very simple programming language MATLAB, for three dimensional linear elastostatics, using constant boundary elements. The code, in full or in part, is not a translation or a copy of any of the existing codes. Present paper explains how the code is written, and lists all the formulae used. Code is verified by using the code to solve a simple problem which has the well known approximate analytical solution. Of course, present work does not make any contribution to research on boundary elements, in terms of theory. But the work is justified by the fact that, to the best of author's knowledge, as of now, one cannot find an open access MATLAB code for three dimensional linear elastostatics using constant boundary elements. Author hopes this paper to be of help to beginners who wish to understand how a simple but complete boundary element code works, so that they can build upon and modify the present open access code to solve complex engineering problems quickly and easi...
Johann A. Briffa
2014-06-01
Full Text Available In this study, the authors consider time-varying block (TVB codes, which generalise a number of previous synchronisation error-correcting codes. They also consider various practical issues related to maximum a posteriori (MAP decoding of these codes. Specifically, they give an expression for the expected distribution of drift between transmitter and receiver because of synchronisation errors. They determine an appropriate choice for state space limits based on the drift probability distribution. In turn, they obtain an expression for the decoder complexity under given channel conditions in terms of the state space limits used. For a given state space, they also give a number of optimisations that reduce the algorithm complexity with no further loss of decoder performance. They also show how the MAP decoder can be used in the absence of known frame boundaries, and demonstrate that an appropriate choice of decoder parameters allows the decoder to approach the performance when frame boundaries are known, at the expense of some increase in complexity. Finally, they express some existing constructions as TVB codes, comparing performance with published results and showing that improved performance is possible by taking advantage of the flexibility of TVB codes.
Typological analysis of social linear blocks: Spain 1950-1983. The case study of western Andalusia
A. Guajardo
2017-04-01
Full Text Available A main challenge that cities will need to face in the next few years is the regeneration of the social housing estates built during the decades of 1950s, 1960s and 1970s. One of the causes of their obsolescence is the mismatch between their hous-ing typologies and the contemporary needs. The main target of this study is to contribute to take a step forward in the un-derstanding of these typologies to be able to intervene on them efficiently. With this purpose, a study on 42 linear blocks built in Spain between 1950 and 1983 in western Andalusia has been carried out. The analysis includes three stages: 1 classification of the houses in recognizable groups; 2 an identification of the most used spatial configurations and 3 definition of their programmatic and size characteristics. As a result, a characterization of linear blocks is proposed as a reference model for future regenerative interventions.
BlockSolve v1.1: Scalable library software for the parallel solution of sparse linear systems
Jones, M.T.; Plassmann, P.E.
1993-03-01
BlockSolve is a software library for solving large, sparse systems of linear equations on massively parallel computers. The matrices must be symmetric, but may have an arbitrary sparsity structure. BlockSolve is a portable package that is compatible with several different message-passing pardigms. This report gives detailed instructions on the use of BlockSolve in applications programs.
BlockSolve v1. 1: Scalable library software for the parallel solution of sparse linear systems
Jones, M.T.; Plassmann, P.E.
1993-03-01
BlockSolve is a software library for solving large, sparse systems of linear equations on massively parallel computers. The matrices must be symmetric, but may have an arbitrary sparsity structure. BlockSolve is a portable package that is compatible with several different message-passing pardigms. This report gives detailed instructions on the use of BlockSolve in applications programs.
Nonlinear to Linear Elastic Code Coupling in 2-D Axisymmetric Media.
Preston, Leiph [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2017-08-01
Explosions within the earth nonlinearly deform the local media, but at typical seismological observation distances, the seismic waves can be considered linear. Although nonlinear algorithms can simulate explosions in the very near field well, these codes are computationally expensive and inaccurate at propagating these signals to great distances. A linearized wave propagation code, coupled to a nonlinear code, provides an efficient mechanism to both accurately simulate the explosion itself and to propagate these signals to distant receivers. To this end we have coupled Sandia's nonlinear simulation algorithm CTH to a linearized elastic wave propagation code for 2-D axisymmetric media (axiElasti) by passing information from the nonlinear to the linear code via time-varying boundary conditions. In this report, we first develop the 2-D axisymmetric elastic wave equations in cylindrical coordinates. Next we show how we design the time-varying boundary conditions passing information from CTH to axiElasti, and finally we demonstrate the coupling code via a simple study of the elastic radius.
Kinematical analysis of 5-axis corner smoothing for transitions between linear (G1) blocks
Beudaert, Xavier; Lavernhe, Sylvain; Tournier, Christophe
2012-01-01
5-axis high speed machine tools are widely used in industry. The axis movements are generated by the Computer Numerical Controller (CNC) which has to transform the part program into a sequence of axis setpoints. Most of the time, the tool path is described with linear segments (G1) which lead to tangency discontinuities between blocks. With acceleration and jerk limitations, these discontinuities will induce a zero feedrate and thus surface marks and an increase in machining time. The aim of ...
Eric Z. Chen
2015-01-01
Full Text Available Error control codes have been widely used in data communications and storage systems. One central problem in coding theory is to optimize the parameters of a linear code and construct codes with best possible parameters. There are tables of best-known linear codes over finite fields of sizes up to 9. Recently, there has been a growing interest in codes over $\\mathbb{F}_{13}$ and other fields of size greater than 9. The main purpose of this work is to present a database of best-known linear codes over the field $\\mathbb{F}_{13}$ together with upper bounds on the minimum distances. To find good linear codes to establish lower bounds on minimum distances, an iterative heuristic computer search algorithm is employed to construct quasi-twisted (QT codes over the field $\\mathbb{F}_{13}$ with high minimum distances. A large number of new linear codes have been found, improving previously best-known results. Tables of $[pm, m]$ QT codes over $\\mathbb{F}_{13}$ with best-known minimum distances as well as a table of lower and upper bounds on the minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.
Wittmann, Markus; Treibig, Jan; Wellein, Gerhard
2010-01-01
Bandwidth-starved multicore chips have become ubiquitous. It is well known that the performance of stencil codes can be improved by temporal blocking, lessening the pressure on the memory interface. We introduce a new pipelined approach that makes explicit use of shared caches in multicore environments and minimizes synchronization and boundary overhead. Benchmark results are presented for three current x86-based microprocessors, showing clearly that our optimization works best on designs with high-speed shared caches and low memory bandwidth per core. We furthermore demonstrate that simple bandwidth-based performance models are inaccurate for this kind of algorithm and employ a more elaborate, synthetic modeling procedure. Finally we show that temporal blocking can be employed successfully in a hybrid shared/distributed-memory environment, albeit with limited benefit at strong scaling.
National Aeronautics and Space Administration — It is proposed to study and develop an innovative Turbo-block coded modulation scheme suitable for Orthogonal Frequency Division Modulation (OFDM) system. The new...
Cognitive radio networks with orthogonal space-time block coding and multiuser diversity
Yang, Liang
2013-04-01
This paper considers a multiuser spectrum sharing (SS) system operating in a Rayleigh fading environment and in which every node is equipped with multiple antennas. The system employs orthogonal space-time block coding at the secondary users. Under such a framework, the average capacity and error performance under a peak interference constraint are first analyzed. For a comparison purpose, an analysis of the transmit antenna selection scheme is also presented. Finally, some selected numerical results are presented to corroborate the proposed analysis. © 1997-2012 IEEE.
A Novel Approach to Detect Duplicate Code Blocks to Reduce Maintenance Effort
Sonam Gupta
2016-04-01
Full Text Available It was found in many cases that a code might be a clone for one programmer but not the same for another one. This problem occurs because of inaccurate documentation. According to research, the maintainers are not aware of the original design and thus, face the difficulty of agreeing on the system’s components and their relations or understanding the work of the application. The problem also occurs because of the different team of development and maintenance resulting in more effort and time during maintenance. This paper proposes a novel approach to detect the clones at the programmer side such that if a particular code is a clone then it can be well documented. This approach will provide both the individual duplicate statements as well as the block in which they appear. The approach has been examined on seven open source systems.
A HIGH-PERFORMANCE VLSI ARCHITECTURE OF EBCOT BLOCK CODING IN JPEG2000
Liu Kai; Wu Chengke; Li Yunsong
2006-01-01
The paper presents a new architecture composed of bit plane-parallel coder for Embedded Block Coding with Optimized Truncation (EBCOT) entropy encoder used in JPEG2000. In the architecture, the coding information of each bit plane can be obtained simultaneously and processed parallel. Compared with other architectures, it has advantages of high parallelism, and no waste clock cycles for a single point. The experimental results show that it reduces the processing time about 86% than that of bit plane sequential scheme. A Field Programmable Gate Array (FPGA) prototype chip is designed and simulation results show that it can process 512×512 gray-scaled images with more than 30 frames per second at 52MHz.
BLOCK CODING SCHEME FOR REDUCING PAPR IN OFDM SYSTEMS WITH LARGE NUMBER OF SUBCARRIERS
Jiang Tao; Zhu Guangxi; Zheng Jianbin
2004-01-01
The major drawback in Orthogonal Frequency Division Multiplexing (OFDM) system is due to the high Peak-to-Average Power Ratio (PAPR), so the performance of the system is significantly degraded by the nonlinearity of a High Power Amplifier (HPA) in the transmitter.In order to mitigate distortion, a block coding scheme for reducing PAPR in OFDM systems with large number of subcarriers based on complementary sequences and predistortion is proposed,which is capable of both error correction and PAPR reduction. Computer simulation results show that the proposed scheme significantly improves Bit Error Rate(BER) performance as compared to an uncoded system when an HPA is employed or a coded system without predistortion.
Pairwise Check Decoding for LDPC Coded Two-Way Relay Block Fading Channels
Liu, Jianquan; Xu, Youyun
2011-01-01
Partial decoding is known to have the potential to achieve a larger rate region than that of full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer network coding (PLNC) mapping. In this paper, we propose a new channel coding solution at the relay, called \\emph{pairwise check decoding} (PCD), for low-density parity-check (LDPC) coded TWR system over block fading channels. The main idea is to form a check relationship table (check-relation-tab) for the superimposed LDPC coded packet pair in the multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the broadcast (BC) phase. Using PCD, we then present a partial decoding method, two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of minimizing the worst pairwise error performance. Moreover, a kind of correlative rows optimization, named as the minimum correlation optimization (MCO), is proposed for selecting the bet...
Progressive encoding with non-linear source codes for compression of low-entropy sources
Ramírez Javega, Francisco; Lamarca Orozco, M. Meritxell; García Frías, Javier
2010-01-01
We propose a novel scheme for source coding of non-uniform memoryless binary sources based on progressively encoding the input sequence with non-linear encoders. At each stage, a number of source bits is perfectly recovered, and these bits are thus not encoded in the next stage. The last stage consists of an LDPC code acting as a source encoder over the bits that have not been recovered in the previous stages. Peer Reviewed
Bounds on Subspace Codes Based on Subspaces of Type (m,1 in Singular Linear Space
You Gao
2014-01-01
Full Text Available The Sphere-packing bound, Singleton bound, Wang-Xing-Safavi-Naini bound, Johnson bound, and Gilbert-Varshamov bound on the subspace codes n+l,M,d,(m,1q based on subspaces of type (m,1 in singular linear space Fq(n+l over finite fields Fq are presented. Then, we prove that codes based on subspaces of type (m,1 in singular linear space attain the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures in Fq(n+l.
Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes
Savin, Valentin
2009-01-01
In this paper, we first introduce the extended binary representation of non-binary codes, which corresponds to a covering graph of the bipartite graph associated with the non-binary code. Then we show that non-binary codewords correspond to binary codewords of the extended representation that further satisfy some simplex-constraint: that is, bits lying over the same symbol-node of the non-binary graph must form a codeword of a simplex code. Applied to the binary erasure channel, this description leads to a binary erasure decoding algorithm of non-binary LDPC codes, whose complexity depends linearly on the cardinality of the alphabet. We also give insights into the structure of stopping sets for non-binary LDPC codes, and discuss several aspects related to upper-layer FEC applications.
Sonia Aïssa
2008-05-01
Full Text Available This paper investigates the effects of channel estimation error at the receiver on the achievable rate of distributed space-time block coded transmission. We consider that multiple transmitters cooperate to send the signal to the receiver and derive lower and upper bounds on the mutual information of distributed space-time block codes (D-STBCs when the channel gains and channel estimation error variances pertaining to different transmitter-receiver links are unequal. Then, assessing the gap between these two bounds, we provide a limiting value that upper bounds the latter at any input transmit powers, and also show that the gap is minimum if the receiver can estimate the channels of different transmitters with the same accuracy. We further investigate positioning the receiving node such that the mutual information bounds of D-STBCs and their robustness to the variations of the subchannel gains are maximum, as long as the summation of these gains is constant. Furthermore, we derive the optimum power transmission strategy to achieve the outage capacity lower bound of D-STBCs under arbitrary numbers of transmit and receive antennas, and provide closed-form expressions for this capacity metric. Numerical simulations are conducted to corroborate our analysis and quantify the effects of imperfect channel estimation.
A Chip-Level BSOR-Based Linear GSIC Multiuser Detector for Long-Code CDMA Systems
Benyoucef M
2007-01-01
Full Text Available We introduce a chip-level linear group-wise successive interference cancellation (GSIC multiuser structure that is asymptotically equivalent to block successive over-relaxation (BSOR iteration, which is known to outperform the conventional block Gauss-Seidel iteration by an order of magnitude in terms of convergence speed. The main advantage of the proposed scheme is that it uses directly the spreading codes instead of the cross-correlation matrix and thus does not require the calculation of the cross-correlation matrix (requires floating point operations (flops, where is the processing gain and is the number of users which reduces significantly the overall computational complexity. Thus it is suitable for long-code CDMA systems such as IS-95 and UMTS where the cross-correlation matrix is changing every symbol. We study the convergence behavior of the proposed scheme using two approaches and prove that it converges to the decorrelator detector if the over-relaxation factor is in the interval ]0, 2[. Simulation results are in excellent agreement with theory.
MIMO free space optical communication based on orthogonal space time block code
WANG HuiQin; KE XiZheng; ZHAO Li
2009-01-01
School of Automation & Information Engineering, Xi'an University of Technology, Xi'an 710048, China An appropriate coding method that can reduce the error rate of communication system is especially Important to the free space optical communication. STBC (space-time block code) is an orthogonal encoding method Integrating space domain and time domain. The technology can combat fading effectlvely and improve error rate performance. In this paper, first, an STBC fit for optical communication with Intensity modulation and direct detection (IM/DD) is proposed by combining the orthogonality of the Alamouti space-time code and the QPPM modulation. Then, the error rate performance of the system Is analyzed under four cases: with or without channel fading, with or without background radiation. At last, this scheme is confirmed by Monte Carlo approach. It is shown that this method not only realizes the full speed rate transmission, and can improve the error rate performance of the system effectively, but also overcomes the scintillation effect exerted by atmosphere turbulence. When the symbol error probability (SEP) is 2×103, according to the 1×1 system, the sending power of the 2×1 system is nearly reduced by 3.5 dBJ, and the 2×2 system Is nearly reduced by 9 dBJ.
Suzuki, Taizo; Ikehara, Masaaki; Nguyen, Truong Q
2012-07-01
Generalized block-lifting factorization of M-channel (M > 2) biorthogonal filter banks (BOFBs) for lossy-to-lossless image coding is presented in this paper. Since the proposed block-lifting structure is more general than the conventional lifting factorizations and does NOT require many restrictions such as paraunitary, number of channels, and McMillan degree in each building block unlike the conventional lifting factorizations, its coding gain is higher than that of the previous methods. Several proposed BOFBs are designed and applied to image coding. Comparing the results with conventional lossy-to-lossless image coding structures, including the 5/3- and 9/7-tap discrete wavelet transforms in JPEG 2000 and a 4 × 8 hierarchical lapped biorthogonal transform in JPEG XR, the proposed BOFBs achieve better result in both objective measure and perceptual visual quality for the images with a lot of high-frequency components.
Wang, Lei; Zhang, Chongyin; Cong, Houluo; Li, Lei; Zheng, Sixun; Li, Xiuhong; Wang, Jie
2013-07-11
In this work, we investigated the effect of topological structures of block copolymers on the formation of the nanophase in epoxy thermosets containing amphiphilic block copolymers. Two block copolymers composed of poly(ε-caprolactone) (PCL) and poly(2,2,2-trifluoroethyl acrylate) (PTFEA) blocks were synthesized to possess linear and star-shaped topologies. The star-shaped block copolymer composed a polyhedral oligomeric silsesquioxane (POSS) core and eight poly(ε-caprolactone)-block-poly(2,2,2-trifluoroethyl acrylate) (PCL-b-PTFEA) diblock copolymer arms. Both block copolymers were synthesized via the combination of ring-opening polymerization and reversible addition-fragmentation chain transfer/macromolecular design via the interchange of xanthate (RAFT/MADIX) process; they were controlled to have identical compositions of copolymerization and lengths of blocks. Upon incorporating both block copolymers into epoxy thermosets, the spherical PTFEA nanophases were formed in all the cases. However, the sizes of PTFEA nanophases from the star-like block copolymer were significantly lower than those from the linear diblock copolymer. The difference in the nanostructures gave rise to the different glass transition behavior of the nanostructured thermosets. The dependence of PTFEA nanophases on the topologies of block copolymers is interpreted in terms of the conformation of the miscible subchain (viz. PCL) at the surface of PTFEA microdomains and the restriction of POSS cages on the demixing of the thermoset-philic block (viz. PCL).
Solving sparse linear least squares problems on some supercomputers by using large dense blocks
Hansen, Per Christian; Ostromsky, T; Sameh, A;
1997-01-01
technique is preferable to sparse matrix technique when the matrices are not large, because the high computational speed compensates fully the disadvantages of using more arithmetic operations and more storage. For very large matrices the computations must be organized as a sequence of tasks in each...... the matrix so that dense blocks can be constructed and treated with some standard software, say LAPACK or NAG. These ideas are implemented for linear least-squares problems. The rectangular matrices (that appear in such problems) are decomposed by an orthogonal method. Results obtained on a CRAY C92A...
Linear-algebraic list decoding of folded Reed-Solomon codes
Guruswami, Venkatesan
2011-01-01
Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\\eps)}$ time algorithm to list decode appropriate folded RS codes of rate $R$ from a fraction $1-R-\\eps$ of errors. The algorithm is based on multivariate polynomial interpolation and root-finding over extension fields. It was noted by Vadhan that interpolating a linear polynomial suffices if one settles for a smaller decoding radius (but still enough for a statement of the above form). Here we give a simple linear-algebra based analysis of this variant that eliminates the need for the computationally expensive root-finding step over extension fields (and indeed any mention of extension fields). The entire list decoding algorithm is linear-algebraic, solving one linear system for the interpolation step, and another linear system to find a small subspace of candidate solutions. Except for ...
Fitzek, Frank; Toth, Tamas; Szabados, Áron
2014-01-01
This paper advocates the use of random linear network coding for storage in distributed clouds in order to reduce storage and traffic costs in dynamic settings, i.e. when adding and removing numerous storage devices/clouds on-the-fly and when the number of reachable clouds is limited. We introduce...... various network coding approaches that trade-off reliability, storage and traffic costs, and system complexity relying on probabilistic recoding for cloud regeneration. We compare these approaches with other approaches based on data replication and Reed-Solomon codes. A simulator has been developed...... to carry out a thorough performance evaluation of the various approaches when relying on different system settings, e.g., finite fields, and network/storage conditions, e.g., storage space used per cloud, limited network use, and limited recoding capabilities. In contrast to standard coding approaches, our...
Morphology and phase diagram of complex block copolymers: ABC linear triblock copolymers.
Tang, Ping; Qiu, Feng; Zhang, Hongdong; Yang, Yuliang
2004-03-01
Using a real space implementation of the self-consistent field theory for the polymeric system, we explore microphases of ABC linear triblock copolymers. For the sake of numerical tractability, the calculation is carried out in a two-dimensional (2D) space. Seven microphases are found to be stable for the ABC triblock copolymer in 2D, which include lamellae, hexagonal lattice, core-shell hexagonal lattice, tetragonal lattice, lamellae with beads inside, lamellae with beads at the interface, and hexagonal phase with beads at the interface. By systematically varying the composition, triangle phase diagrams are constructed for four classes of typical triblock polymers in terms of the relative strengths of the interaction energies between different species. In general, when both volume fractions and interaction energies of the three species are comparable, lamellar phases are found to be the most stable. While one of the volume fractions is large, core-shell hexagonal or tetragonal phases can be formed, depending on which of the blocks dominates. Furthermore, more complex morphologies, such as lamellae with beads inside, lamellae with beads at the interface, and hexagonal phases with beads at the interface compete for stability with lamellae structures, as the interaction energies between distinct blocks become asymmetric. Our study provides guidance for the design of microstructures in complex block copolymers.
Iterative multi-user detection and decoding for space-time block coding systems
JIN Yi-dan; ZHANG Feng; WU Wei-ling
2006-01-01
To restrain the interference of co-channel users using space-time block coding (STBC), the proposed Gaussian-forcing soft decision multi-user detection (GFSDMUD) algorithm is applied in flat-fading channels by using the relation among the users' signals, which can enhance the capacity by introducing co-channel users. During iterations, extrinsic information is calculated and exchanged between a soft multi-user detector and a bank of turbo decoders to achieve refined estimates of the users' signals. The simulations show that the proposed iterative receiver techniques provide significant performance improvement around 2 dB over conventional noniterative methods. Furthermore, iterative multi-user space-time processing techniques offer substantial performance gains around 8 dB by adding the number of receiver antennas from 4to 6, and the system performance can be enhanced by using this strategy in multi-user STBC systems, which is very important for enlarging the system capacity.
An Iterative Power Allocation Algorithm for Group-wise Space-Time Block Coding Systems
ZHANG Hong-wei; ZHANG Hai-bin; SONG Wen-tao; LUO Han-wen; LIU Xing-zhao
2007-01-01
An iterative transmit power allocation (PA) algorithm was proposed for group-wise space-time block coding (G-STBC) systems with group-wise successive interference cancellation (GSIC) receivers.Group-wise interference suppression (GIS) filters are employed to separate each group's transmit signals from other interfer ences and noise.While the total power on all transmit symbols is constrained, all transmit PA coefficients are updated jointly according to the channel information at each iteration.Through PA, each detection symbol has the same post-detection signal to interference-and-noise ratio (SINR).The simulation results verify that the proposed PA algorithm converges at the equilibrium quickly after few iterations, and it achieves much lower bit error rates than the previous single symbol SIC PA and the fixed ratio PA algorithms for G-STBC systems with GSIC receivers.
Xu Hongji; Liu Ju; Gu Bo
2007-01-01
An approach combining optimal antenna subset selection with blind detection scheme for Orthogonal Space-Time Block Coding (OSTBC) is proposed in this paper. The optimal antenna subset selection is taken into account at transmitter and/or receiver sides, which chooses the optimal antennas to increase the diversity order of OSTBC and improve further its performance. In order to enhance the robustness of the detection used in the conventional OSTBC scheme, a blind detection scheme based on Independent Component Analysis (ICA) is exploited which can directly extract transmitted signals without channel estimation. Performance analysis shows that the proposed approach can achieve the full diversity and the flexibility of system design by using the antenna selection and the ICA based blind detection schemes.
LOW COMPLEXITY LMMSE TURBO EQUALIZATION FOR COMBINED ERROR CONTROL CODED AND LINEARLY PRECODED OFDM
Qu Daiming; Zhu Guangxi
2006-01-01
The turbo equalization approach is studied for Orthogonal Frequency Division Multiplexing (OFDM) system with combined error control coding and linear precoding. While previous literatures employed linear precoder of small size for complexity reasons, this paper proposes to use a linear precoder of size larger than or equal to the maximum length of the equivalent discrete-time channel in order to achieve full frequency diversity and reduce complexities of the error control coder/decoder. Also a low complexity Linear Minimum Mean Square Error (LMMSE) turbo equalizer is derived for the receiver. Through simulation and performance analysis, it is shown that the performance of the proposed scheme over frequency selective fading channel reaches the matched filter bound; compared with the same coded OFDM without linear precoding, the proposed scheme shows an Signal-to-Noise Ratio (SNR) improvement of at least 6dB at a bit error rate of 10-6 over a multipath channel with exponential power delay profile. Convergence behavior of the proposed scheme with turbo equalization using various type of linear precoder/transformer, various interleaver size and error control coder of various constraint length is also investigated.
Xia, Dong; Dumitrescu, Sorina
2011-01-01
In this paper, a novel concept called a \\textit{uniquely factorable constellation pair} (UFCP) is proposed for the systematic design of a noncoherent full diversity collaborative unitary space-time block code by normalizing two Alamouti codes for a wireless communication system having two transmitter antennas and a single receiver antenna. It is proved that such a unitary UFCP code assures the unique identification of both channel coefficients and transmitted signals in a noise-free case as well as full diversity for the noncoherent maximum likelihood (ML) receiver in a noise case. To further improve error performance, an optimal unitary UFCP code is designed by appropriately and uniquely factorizing a pair of energy-efficient cross quadrature amplitude modulation (QAM) constellations to maximize the coding gain subject to a transmission bit rate constraint. After a deep investigation of the fractional coding gain function, a technical approach developed in this paper to maximizing the coding gain is to caref...
Exact-Repair Minimum Bandwidth Regenerating Codes Based on Evaluation of Linearized Polynomials
Xie, Hongmei
2012-01-01
In this paper, we propose two new constructions of exact-repair minimum storage regenerating (exact-MBR) codes. Both constructions obtain the encoded symbols by first treating the message vector over GF(q) as a linearized polynomial and then evaluating it over an extension field GF(q^m). The evaluation points are chosen so that the encoded symbols at any node are conjugates of each other, while corresponding symbols of different nodes are linearly dependent with respect to GF(q). These properties ensure that data repair can be carried out over the base field GF(q), instead of matrix inversion over the extension field required by some existing exact-MBR codes. To the best of our knowledge, this approach is novel in the construction of exact-MBR codes. One of our constructions leads to exact-MBR codes with arbitrary parameters. These exact-MBR codes have higher data reconstruction complexities but lower data repair complexities than their counterparts based on the product-matrix approach; hence they may be suit...
A linear approach for sparse coding by a two-layer neural network
Montalto, Alessandro; Prevete, Roberto
2015-01-01
Many approaches to transform classification problems from non-linear to linear by feature transformation have been recently presented in the literature. These notably include sparse coding methods and deep neural networks. However, many of these approaches require the repeated application of a learning process upon the presentation of unseen data input vectors, or else involve the use of large numbers of parameters and hyper-parameters, which must be chosen through cross-validation, thus increasing running time dramatically. In this paper, we propose and experimentally investigate a new approach for the purpose of overcoming limitations of both kinds. The proposed approach makes use of a linear auto-associative network (called SCNN) with just one hidden layer. The combination of this architecture with a specific error function to be minimized enables one to learn a linear encoder computing a sparse code which turns out to be as similar as possible to the sparse coding that one obtains by re-training the neura...
On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes
Lifshitz, Asi
2011-01-01
In this paper we explore the decision regions of Linear Programming (LP) decoding. We compare the decision regions of an LP decoder, a Belief Propagation (BP) decoder and the optimal Maximum Likelihood (ML) decoder. We study the effect of minimal-weight pseudocodewords on LP decoding. We present global optimization as a method for finding the minimal pseudoweight of a given code as well as the number of minimal-weight generators. We present a complete pseudoweight distribution for the [24; 12; 8] extended Golay code, and provide justifications of why the pseudoweight distribution alone cannot be used for obtaining a tight upper bound on the error probability.
Linear Network Coding on Multi-Mesh of Trees using All to All Broadcast
Nitin Rakesh
2011-05-01
Full Text Available We introduce linear network coding on parallel architecture for multi-source finite acyclic network. In this problem, different messages in diverse time periods are broadcast and every non-source node in the network decodes and encodes the message based on further communication.We wish to minimize the communication steps and time complexity involved in transfer of data from node-to-node during parallel communication.We have used Multi-Mesh of Trees (MMT topology for implementing network coding. To envisage our result, we use all-to-all broadcast as communication algorithm.
Research for Joint Encoding of Space-Time Block Code and Turbo Codes%空时分组码和Turbo码联合编码研究
张宇; 王云飞; 郑晨熹
2012-01-01
空时分组码（sTBc）能提供满分集增益和较低的实现复杂度，但是却无法获得编码增益，为了进一步提升性能，考虑将空时分组码与Turbo进行联合编码。文章介绍了空时分组码和Turbo码的特点，并给出了联合编码的结构。Matlab仿真显示，联合编码结构具备更优异的性能。%Space-Time Block Codes（STBC） achieves full diversity gain and low complexity, but it cafft obtain coding gain. In order to improve performance, Joint encoding of Space-Time Block Code and Turbo Codes is considered. In this paper, the specialty of Space-Time Block Codes and Turbo Codes is depicted, and Joint encoding structure is presented. Matlab simulation shows that joint encoding structure have better performance.
Joint Dirty Paper Coding and Linear Receiver Design for Multiuser MIMO Broadcast Channels
CHE Xiao-lin; HE Chen
2008-01-01
A multiuser multiple input multiple output (MIMO) broadcast scheme was proposed through ap-plying dirty paper coding (DPC) at the transmitter and linear equalization at the receiver. Assuming single data stream communication for each user, joint transmitter and linear receiver design were done to enhance the system performance. Furthermore, a multiuser scheduling algorithm was presented to exploit multiuser diversity when the number of the users is larger than that of transmit antennas. The proposed system achieves the sum rate close to the Sato bound and is superior to some of the existing schemes.
On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes
Gidon, Ohad
2012-01-01
In this paper, we present an improved union bound on the Linear Programming (LP) decoding performance of the binary linear codes transmitted over an additive white Gaussian noise channels. The bounding technique is based on the second-order of Bonferroni-type inequality in probability theory, and it is minimized by Prim's minimum spanning tree algorithm. The bound calculation needs the fundamental cone generators of a given parity-check matrix rather than only their weight spectrum, but involves relatively low computational complexity. It is targeted to high-density parity-check codes, where the number of their generators is extremely large and these generators are spread densely in the Euclidean space. We explore the generator density and make a comparison between different parity-check matrix representations. That density effects on the improvement of the proposed bound over the conventional LP union bound. The paper also presents a complete pseudo-weight distribution of the fundamental cone generators for ...
ON THE SECOND GREEDY WEIGHT FOR LINEAR CODES SATISFYING THE FULLRANK CONDITION
CHEN Wende; KLφVE Torleiv
2005-01-01
The maximum of g2 - d2 for linear [n, k, d; q] codes C is studied. Here d2 is the smallest size of the support of 2-dimensional subcodes of C and g2 is the smallest size of the support of 2-dimensional subcodes of C which contains a codeword of weight d. The extra cost to the greedy adversary to get two symbols of inform ation using some algorithmis g2 - d2. For codes satisfying the fullrank condition of general dimensions, upper bounds on the maximum of g2 - d2 are given. Under some condition we have got code C where g2 - d2 reaches the upper bound.
Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding
Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank
2014-01-01
This work proposes a new protocol applying on–the–fly random linear network coding in wireless mesh net-works. The protocol provides increased reliability, low delay,and high throughput to the upper layers, while being obliviousto their specific requirements. This seemingly conflicting goalsare achieved by design, using an on–the–fly network codingstrategy. Our protocol also exploits relay nodes to increasethe overall performance of individual links. Since our protocolnaturally masks random p...
New Geometrical Spectra of Linear Codes with Applications to Performance Analysis
Ma, Xiao; Zhuang, Qiutao
2012-01-01
In this paper, new enumerating functions for linear codes are defined, including the triangle enumerating function and the tetrahedron enumerating function, both of which can be computed using a trellis-based algorithm over polynomial rings. The computational complexity is dominated by the complexity of the trellis. In addition, we show that these new enumerating functions can be used to improve existing performance bounds on the maximum likelihood decoding.
Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services
Tassi, Andrea; Chatzigeorgiou, Ioannis; Roetter, Daniel Enrique Lucani
2016-01-01
Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RL...... guarantees to predetermined fractions of users. The performance of the proposed optimization framework is then investigated in a LTE-A eMBMS network multicasting H.264/SVC video services....
Power Allocation Optimization: Linear Precoding Adapted to NB-LDPC Coded MIMO Transmission
Tarek Chehade
2015-01-01
Full Text Available In multiple-input multiple-output (MIMO transmission systems, the channel state information (CSI at the transmitter can be used to add linear precoding to the transmitted signals in order to improve the performance and the reliability of the transmission system. This paper investigates how to properly join precoded closed-loop MIMO systems and nonbinary low density parity check (NB-LDPC. The q elements in the Galois field, GF(q, are directly mapped to q transmit symbol vectors. This allows NB-LDPC codes to perfectly fit with a MIMO precoding scheme, unlike binary LDPC codes. The new transmission model is detailed and studied for several linear precoders and various designed LDPC codes. We show that NB-LDPC codes are particularly well suited to be jointly used with precoding schemes based on the maximization of the minimum Euclidean distance (max-dmin criterion. These results are theoretically supported by extrinsic information transfer (EXIT analysis and are confirmed by numerical simulations.
Yamanaka, Kota; Hirata, Shinnosuke; Hachiya, Hiroyuki
2016-07-01
Ultrasonic distance measurement for obstacles has been recently applied in automobiles. The pulse-echo method based on the transmission of an ultrasonic pulse and time-of-flight (TOF) determination of the reflected echo is one of the typical methods of ultrasonic distance measurement. Improvement of the signal-to-noise ratio (SNR) of the echo and the avoidance of crosstalk between ultrasonic sensors in the pulse-echo method are required in automotive measurement. The SNR of the reflected echo and the resolution of the TOF are improved by the employment of pulse compression using a maximum-length sequence (M-sequence), which is one of the binary pseudorandom sequences generated from a linear feedback shift register (LFSR). Crosstalk is avoided by using transmitted signals coded by different M-sequences generated from different LFSRs. In the case of lower-order M-sequences, however, the number of measurement channels corresponding to the pattern of the LFSR is not enough. In this paper, pulse compression using linear-frequency-modulated (LFM) signals coded by M-sequences has been proposed. The coding of LFM signals by the same M-sequence can produce different transmitted signals and increase the number of measurement channels. In the proposed method, however, the truncation noise in autocorrelation functions and the interference noise in cross-correlation functions degrade the SNRs of received echoes. Therefore, autocorrelation properties and cross-correlation properties in all patterns of combinations of coded LFM signals are evaluated.
A proof of the linearity conjecture for k-blocking sets in PG(n, p3), p prime
Lavrauw, Michel; Van de Voorde, Geertrui
2012-01-01
In this paper, we show that a small minimal k-blocking set in PG(n, q3), q = p^h, h >= 1, p prime, p >=7, intersecting every (n-k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking sets in PG(n, p^3), p prime, p >=7, are Fp-linear, proving the linearity conjecture (see [7]) in the case PG(n, p3), p prime, p >= 7.
无
2002-01-01
It was proved numerically that the Domain Decomposition Method (DDM) with one layer overlapping grids is identical to the block iterative method of linear algebra equations. The results obtained using DDM could be in reasonable aggeement with the results of full-domain simulation. With the three dimensional solver developed by the authors, the flow field in a pipe was simulated using the full-domain DDM with one layer overlapping grids and with patched grids respectively. Both of the two cases led to the convergent solution. Further research shows the superiority of the DDM with one layer overlapping grids to the DDM with patched grids. A comparison between the numerical results obtained by the authors and the experimental results given by Enayet[3] shows that the numerical results are reasonable.
Xia, Wenfeng; West, Simeon J.; Nikitichev, Daniil I.; Ourselin, Sebastien; Beard, Paul C.; Desjardins, Adrien E.
2016-03-01
Accurate identification of tissue structures such as nerves and blood vessels is critically important for interventional procedures such as nerve blocks. Ultrasound imaging is widely used as a guidance modality to visualize anatomical structures in real-time. However, identification of nerves and small blood vessels can be very challenging, and accidental intra-neural or intra-vascular injections can result in significant complications. Multi-spectral photoacoustic imaging can provide high sensitivity and specificity for discriminating hemoglobin- and lipid-rich tissues. However, conventional surface-illumination-based photoacoustic systems suffer from limited sensitivity at large depths. In this study, for the first time, an interventional multispectral photoacoustic imaging (IMPA) system was used to image nerves in a swine model in vivo. Pulsed excitation light with wavelengths in the ranges of 750 - 900 nm and 1150 - 1300 nm was delivered inside the body through an optical fiber positioned within the cannula of an injection needle. Ultrasound waves were received at the tissue surface using a clinical linear array imaging probe. Co-registered B-mode ultrasound images were acquired using the same imaging probe. Nerve identification was performed using a combination of B-mode ultrasound imaging and electrical stimulation. Using a linear model, spectral-unmixing of the photoacoustic data was performed to provide image contrast for oxygenated and de-oxygenated hemoglobin, water and lipids. Good correspondence between a known nerve location and a lipid-rich region in the photoacoustic images was observed. The results indicate that IMPA is a promising modality for guiding nerve blocks and other interventional procedures. Challenges involved with clinical translation are discussed.
Joint L-/C-Band Code and Carrier Phase Linear Combinations for Galileo
Patrick Henkel
2008-01-01
Full Text Available Linear code combinations have been considered for suppressing the ionospheric error. In the L-band, this leads to an increased noise floor. In a combined L- and C-band (5010–5030 MHz approach, the ionosphere can be eliminated and the noise floor reduced at the same time. Furthermore, combinations that involve both code- and carrier-phase measurements are considered. A new L-band code-carrier combination with a wavelength of 3.215 meters and a noise level of 3.92 centimeters is found. The double difference integer ambiguities of this combination can be resolved by extending the system of equations with an ionosphere-free L-/C-band code combination. The probability of wrong fixing is reduced by several orders of magnitude when C-band measurements are included. Carrier smoothing can be used to further reduce the residual variance of the solution. The standard deviation is reduced by a factor 7.7 if C-band measurements are taken into account. These initial findings suggest that the combined use of L- and C-band measurements, as well as the combined code and phase processing are an attractive option for precise positioning.
Utilization of some non coded amino acids as isosters of peptide building blocks.
Hlaváček, J; Marcová, R; Ježek, R; Slaninová, J
1996-09-01
In our study on non coded amino acids and their utilization in peptide chemistry we synthesized methylene-thio (CH2-S) and methyleneoxy (CH2-O) group containing amino acids and pseudodipeptides which could be used as building blocks for the construction of peptide hormone analogues. The (CH2-S) isoster of peptide bond exhibits increased flexibility, lipophility and resistance to proteolytic enzymes. This group exhibits similar properties as the isosteric disulfide bond in the side chain of cystine residue. The (CH2-O) isoster is moreover similar in its geometry to extended conformation of peptide bond. As a consequence, the changed profile of biological activities could be expected for peptide hormone analogues containing such isosteric moiety. The (CH2-S) isosters of the peptide bond were prepared by alkylation of thiolates of 2-mercaptocarboxylic acids, the disulfide bond by alkylation of cysteine or homocysteine. The (CH2-O) isosters were prepared by (AcO)4Rh2 catalyzed addition of carbenes of alkyl diazocarboxylates to N-protected aminoalcohols. Pseudodipeptides H-Leu-ψ(CH2-S)-Gly-NH2 and H-Leu-ψ(CH2-O)-Gly-NH2 were introduced into the C-terminal part of the oxytocin molecule using solution methods of peptide chemistry. Both inserted isosteric bonds were resistant against proteolytic degradation, the first one was found to decrease an enzymic cleavage of the distant Tyr(2)-Ile(3) bond in the corresponding analogue, too. The (CH2-S) isosters of the disulfide bond containing an orthogonal protection of theirα-amino (Fmoc) andα-(OAll, OH) orω-(OBu(+), OH) carboxylic groups were applied in the solid phase synthesis of the aminoterminal 1-deamino-15-pentadecapeptide of endothelin-I which represents a strong vasoactive agent. The solid phase synthesis was carried out by the step-wise protocol on the Rink or Merrifield type resin using orthogonally protected carba cystine building blocks.
Spreading Code and Widely-Linear Receiver Design: Non-Cooperative Games for Wireless CDMA Networks
Buzzi, Stefano; Zappone, Alessio
2009-01-01
The issue of non-cooperative transceiver optimization in the uplink of a multiuser wireless code division multiple access data network with widely-linear detection at the receiver is considered. While previous work in this area has focused on a simple real signal model, in this paper a baseband complex representation of the data is used, so as to properly take into account the I and Q components of the received signal. For the case in which the received signal is improper, a widely-linear reception structure, processing separately the data and their complex conjugates, is considered. Several non-cooperative resource allocation games are considered for this new scenario, and the performance gains granted by the use of widely-linear detection are assessed through theoretical analysis. Numerical results confirm the validity of the theoretical findings, and show that exploiting the improper nature of the data in non-cooperative resource allocation brings remarkable performance improvements in multiuser wireless s...
Finite Macro-Element Mesh Deformation in a Structured Multi-Block Navier-Stokes Code
Bartels, Robert E.
2005-01-01
A mesh deformation scheme is developed for a structured multi-block Navier-Stokes code consisting of two steps. The first step is a finite element solution of either user defined or automatically generated macro-elements. Macro-elements are hexagonal finite elements created from a subset of points from the full mesh. When assembled, the finite element system spans the complete flow domain. Macro-element moduli vary according to the distance to the nearest surface, resulting in extremely stiff elements near a moving surface and very pliable elements away from boundaries. Solution of the finite element system for the imposed boundary deflections generally produces smoothly varying nodal deflections. The manner in which distance to the nearest surface has been found to critically influence the quality of the element deformation. The second step is a transfinite interpolation which distributes the macro-element nodal deflections to the remaining fluid mesh points. The scheme is demonstrated for several two-dimensional applications.
Space-Frequency Block Code with Matched Rotation for MIMO-OFDM System with Limited Feedback
Thushara D. Abhayapala
2009-01-01
Full Text Available This paper presents a novel matched rotation precoding (MRP scheme to design a rate one space-frequency block code (SFBC and a multirate SFBC for MIMO-OFDM systems with limited feedback. The proposed rate one MRP and multirate MRP can always achieve full transmit diversity and optimal system performance for arbitrary number of antennas, subcarrier intervals, and subcarrier groupings, with limited channel knowledge required by the transmit antennas. The optimization process of the rate one MRP is simple and easily visualized so that the optimal rotation angle can be derived explicitly, or even intuitively for some cases. The multirate MRP has a complex optimization process, but it has a better spectral efficiency and provides a relatively smooth balance between system performance and transmission rate. Simulations show that the proposed SFBC with MRP can overcome the diversity loss for specific propagation scenarios, always improve the system performance, and demonstrate flexible performance with large performance gain. Therefore the proposed SFBCs with MRP demonstrate flexibility and feasibility so that it is more suitable for a practical MIMO-OFDM system with dynamic parameters.
Fast Maximum-Likelihood Decoder for Quasi-Orthogonal Space-Time Block Code
Adel Ahmadi
2015-01-01
Full Text Available Motivated by the decompositions of sphere and QR-based methods, in this paper we present an extremely fast maximum-likelihood (ML detection approach for quasi-orthogonal space-time block code (QOSTBC. The proposed algorithm with a relatively simple design exploits structure of quadrature amplitude modulation (QAM constellations to achieve its goal and can be extended to any arbitrary constellation. Our decoder utilizes a new decomposition technique for ML metric which divides the metric into independent positive parts and a positive interference part. Search spaces of symbols are substantially reduced by employing the independent parts and statistics of noise. Symbols within the search spaces are successively evaluated until the metric is minimized. Simulation results confirm that the proposed decoder’s performance is superior to many of the recently published state-of-the-art solutions in terms of complexity level. More specifically, it was possible to verify that application of the new algorithms with 1024-QAM would decrease the computational complexity compared to state-of-the-art solution with 16-QAM.
PB3D: A new code for edge 3-D ideal linear peeling-ballooning stability
Weyens, T.; Sánchez, R.; Huijsmans, G.; Loarte, A.; García, L.
2017-02-01
A new numerical code PB3D (Peeling-Ballooning in 3-D) is presented. It implements and solves the intermediate-to-high-n ideal linear magnetohydrodynamic stability theory extended to full edge 3-D magnetic toroidal configurations in previous work [1]. The features that make PB3D unique are the assumptions on the perturbation structure through intermediate-to-high mode numbers n in general 3-D configurations, while allowing for displacement of the plasma edge. This makes PB3D capable of very efficient calculations of the full 3-D stability for the output of multiple equilibrium codes. As first verification, it is checked that results from the stability code MISHKA [2], which considers axisymmetric equilibrium configurations, are accurately reproduced, and these are then successfully extended to 3-D configurations, through comparison with COBRA [3], as well as using checks on physical consistency. The non-intuitive 3-D results presented serve as a tentative first proof of the capabilities of the code.
A Linear Algebra Framework for Static High Performance Fortran Code Distribution
Corinne Ancourt
1997-01-01
Full Text Available High Performance Fortran (HPF was developed to support data parallel programming for single-instruction multiple-data (SIMD and multiple-instruction multiple-data (MIMD machines with distributed memory. The programmer is provided a familiar uniform logical address space and specifies the data distribution by directives. The compiler then exploits these directives to allocate arrays in the local memories, to assign computations to elementary processors, and to migrate data between processors when required. We show here that linear algebra is a powerful framework to encode HPF directives and to synthesize distributed code with space-efficient array allocation, tight loop bounds, and vectorized communications for INDEPENDENT loops. The generated code includes traditional optimizations such as guard elimination, message vectorization and aggregation, and overlap analysis. The systematic use of an affine framework makes it possible to prove the compilation scheme correct.
Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding
Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani
2014-01-01
This work proposes a new protocol applying on– the–fly random linear network coding in wireless mesh net- works. The protocol provides increased reliability, low delay, and high throughput to the upper layers, while being oblivious to their specific requirements. This seemingly conflicting goals ...... and evaluated in a real test bed with Raspberry Pi devices. We show that order of magnitude gains in throughput over plain TCP are possible with moderate losses and up to two fold improvement in per packet delay in our results....
Optimal Prefix Free Code: word-RAM Linear and Algebraic Instance Optimal
Barbay, Jérémy
2012-01-01
We describe a new technique to compute an optimal prefix-free code over $\\alphabetSize$ symbols from their frequencies $\\{\\frequency_1,..,\\frequency_\\alphabetSize\\}$. This technique yields an algorithm running in linear time in the $\\Omega(\\lg \\alphabetSize)$-word RAM model when each frequency holds into $\\Oh(1)$ words, hence improving on the $\\Oh(\\alphabetSize\\lg\\lg\\alphabetSize)$ solution based on sorting in the word RAM model. In a more restricted model, this yields also an algorithm performing $\\Oh(\\alphabetSize(1{+}\\entropy(\\alphabetSize_1,...,\\alphabetSize_\
Vector Sum Excited Linear Prediction (VSELP) speech coding at 4.8 kbps
Gerson, Ira A.; Jasiuk, Mark A.
1990-01-01
Code Excited Linear Prediction (CELP) speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their larger computational requirements. The Vector Sum Excited Linear Prediction (VSELP) speech coder utilizes a codebook with a structure which allows for a very efficient search procedure. Other advantages of the VSELP codebook structure is discussed and a detailed description of a 4.8 kbps VSELP coder is given. This coder is an improved version of the VSELP algorithm, which finished first in the NSA's evaluation of the 4.8 kbps speech coders. The coder uses a subsample resolution single tap long term predictor, a single VSELP excitation codebook, a novel gain quantizer which is robust to channel errors, and a new adaptive pre/postfilter arrangement.
Simulation of Conjugate Structure Algebraic Code Excited Linear Prediction Speech Coder
Ritisha Virulkar
2014-03-01
Full Text Available The CS-ACELP is a speech coder that is based on the linear prediction coding technique. It gives us the bit rate reduced to up to 8kbps and at the same time reduces the computational comp le xity of speech search described in ITU rec-ommendation G.729. This codec is used for compression of speech signal.The idea behind this algorithm is to predict the next co ming signals by the means of linear prediction. For his it uses fixed codebook and adaptive codebook.The quality of speech delivered by this coder is equivalent to 32 kbps ADPCM. The processes responsible for achieving reduction in bit rateare: sending less number of bits for no voice detection and carrying out conditional search in fixed codebook.
M. M. Rahman
2009-01-01
Full Text Available This research presents the durability assessment of cylinder block for a two-stroke free piston engine using narrow band approach. The life prediction results are worthy for improving the component design at the very early developing stage. This approach is adequate for periodic loading, however, requires very large time records to accurately describe random loading processes. Fatigue damage in conventionally determined from time signals of the loading, frequently in the form of stress and strain. However, there are scenarios when a spectral form of loading is more appropriate. In this case the loading is defined in terms of its magnitude at different frequencies in the form of a Power Spectral Density (PSD plot. The vibration fatigue calculation can be utilized where the random loading and response are categorized using power spectral density functions and the dynamic structure is modeled as a linear transfer function. This research also investigates the effect of the mean stress on the fatigue life prediction using the random loading. The acquired results indicate that the Goodman mean stress correction method gives the most conservative results with the Gerber and no (zero mean stress method. It is observed that the compressive mean stresses are beneficial while the tensile mean stresses are detrimental to the fatigue life. The proposed technique is capable of determining premature products failure phenomena. Therefore, this technique is able to reduce cost, time to market, improve the product reliability and finally the user confidence.
Zhang, Yushu; Xiao, Di; Wen, Wenying; Nan, Hai; Su, Moting
2015-10-01
In this paper, we propose a novel secure arithmetic coding based on digitalized modified logistic map (DMLM) and linear feedback shift register (LFSR). An input binary sequence is first mapped into a table, which is then scrambled by two cyclic shift steps driven by the keys resulting from DMLM-LFSR. Next, each column is encoded using traditional arithmetic coding (TAC) and randomized arithmetic coding (RAC). During the RAC process, the exchange of two intervals is controlled by the keystream generated from the DMLM. At the same time, a few bits of the present column sequence are extracted to interfere the generation of new keystream used for the next column. The final ciphertext sequence is obtained by XORing the compressed sequence and the keystream generated by the LFSR. Results show the compression ratio of our scheme is slightly higher than that of TAC, but the security is improved due to the architecture of shift-perturbance. DMLM and LFSR theories also ensure high sensitivity and strong randomness. The appended complexity is only O (N) , where N is the number of the input symbols.
SUDEEP THEPADE; RIK DAS; SAURAV GHOSH
2016-09-01
The paper has explored principle of block truncation coding (BTC) as a means to perform feature extraction for content based image classification. A variation of block truncation coding, named BTC with color clumps has been implemented in this work to generate feature vectors. Classification performance with the proposed technique of feature extraction has been compared to existing techniques. Two widely used publicdataset named Wang dataset and Caltech dataset have been used for analyses and comparisons of classification performances based on four different metrics. The study has established BTC with color clumps as an effective alternative for feature extraction compared to existing methods. The experiments were carried out in RGB colorspace. Two different categories of classifiers viz. K Nearest Neighbor (KNN) Classifier and RIDOR Classifier were used to measure the classification performances. A paired t test was conducted to establish the statistical significance of the findings. Evaluation of classifier algorithms were done in receiver operating characteristic (ROC) space.
Comparison of l₁-Norm SVR and Sparse Coding Algorithms for Linear Regression.
Zhang, Qingtian; Hu, Xiaolin; Zhang, Bo
2015-08-01
Support vector regression (SVR) is a popular function estimation technique based on Vapnik's concept of support vector machine. Among many variants, the l1-norm SVR is known to be good at selecting useful features when the features are redundant. Sparse coding (SC) is a technique widely used in many areas and a number of efficient algorithms are available. Both l1-norm SVR and SC can be used for linear regression. In this brief, the close connection between the l1-norm SVR and SC is revealed and some typical algorithms are compared for linear regression. The results show that the SC algorithms outperform the Newton linear programming algorithm, an efficient l1-norm SVR algorithm, in efficiency. The algorithms are then used to design the radial basis function (RBF) neural networks. Experiments on some benchmark data sets demonstrate the high efficiency of the SC algorithms. In particular, one of the SC algorithms, the orthogonal matching pursuit is two orders of magnitude faster than a well-known RBF network designing algorithm, the orthogonal least squares algorithm.
Surbhi Sharma
2011-06-01
Full Text Available Irregular low-density parity-check (LDPC codes have been found to show exceptionally good performance for single antenna systems over a wide class of channels. In this paper, the performance of LDPC codes with multiple antenna systems is investigated in flat Rayleigh and Rician fading channels for different modulation schemes. The focus of attention is mainly on the concatenation of irregular LDPC codes with complex orthogonal space-time codes. Iterative decoding is carried out with a density evolution method that sets a threshold above which the code performs well. For the proposed concatenated system, the simulation results show that the QAM technique achieves a higher coding gain of 8.8 dB and 3.2 dB over the QPSK technique in Rician (LOS and Rayleigh (NLOS faded environments respectively.
Non-linear simulations of combustion instabilities with a quasi-1D Navier-Stokes code
Haugen, Nils Erland L; Sannan, Sigurd
2010-01-01
As lean premixed combustion systems are more susceptible to combustion instabilities than non-premixed systems, there is an increasing demand for improved numerical design tools that can predict the occurrence of combustion instabilities with high accuracy. The inherent non-linearities in combustion instabilities can be of crucial importance, and we here propose an approach in which the one-dimensional Navier-Stokes and scalar transport equations are solved for geometries of variable cross-section. The focus is on attached flames, and for this purpose a new phenomenological model for the unsteady heat release from a flame front is introduced. In the attached flame method (AFM) the heat release occurs over the full length of the flame. The non-linear code with the use of the AFM approach is validated against results from an experimental study of thermoacoustic instabilities in oxy-fuel flames by Ditaranto and Hals [Combustion and Flame, 146, 493-512 (2006)]. The numerical simulations are in accordance with the...
Jones, M.T.; Plassmann, P.E.
1995-12-01
BlockSolve95 is a software library for solving large, sparse systems of linear equations on massively parallel computers or networks of workstations. The matrices must be symmetric in structure; however, the matrix nonzero values may be either symmetric or nonsymmetric. The nonzeros must be real valued. BlockSolve95 uses a message-passing paradigm and achieves portability through the use of the MPI message-passing standard. Emphasis has been placed on achieving both good professor performance through the use of higher-level BLAS and scalability through the use of advanced algorithms. This report gives detailed instructions on the use of BlockSolve95 and descriptions of a number of program examples that can be used as templates for application programs.
Malas, Tareq M.
2016-07-21
Understanding and optimizing the properties of solar cells is becoming a key issue in the search for alternatives to nuclear and fossil energy sources. A theoretical analysis via numerical simulations involves solving Maxwell\\'s Equations in discretized form and typically requires substantial computing effort. We start from a hybrid-parallel (MPI+OpenMP) production code that implements the Time Harmonic Inverse Iteration Method (THIIM) with Finite-Difference Frequency Domain (FDFD) discretization. Although this algorithm has the characteristics of a strongly bandwidth-bound stencil update scheme, it is significantly different from the popular stencil types that have been exhaustively studied in the high performance computing literature to date. We apply a recently developed stencil optimization technique, multicore wavefront diamond tiling with multi-dimensional cache block sharing, and describe in detail the peculiarities that need to be considered due to the special stencil structure. Concurrency in updating the components of the electric and magnetic fields provides an additional level of parallelism. The dependence of the cache size requirement of the optimized code on the blocking parameters is modeled accurately, and an auto-tuner searches for optimal configurations in the remaining parameter space. We were able to completely decouple the execution from the memory bandwidth bottleneck, accelerating the implementation by a factor of three to four compared to an optimal implementation with pure spatial blocking on an 18-core Intel Haswell CPU.
ZOU Yu-long; ZHENG Bao-yu
2008-01-01
MIMO technology proposed in recent years can effectively combat the multipath fading of wireless channel and can considerably enlarge the channel capacity, which has been investigated widely by researchers. However, its performance analysis over correlated block-fading Rayleigh channel is still an open and challenging objective. In this article, an analytic expression of bit error rate (BER) is presented for multiple phase shift keying (MPSK) space-time code, with differential detection over correlated block-fading Rayleigh channel. Through theoretical analysis of BER, it can be found that the differential space-time scheme without the need for channel state information (CSI) at receiver achieves distinct performance gain compared with the traditional nonspace-time system. And then, the system simulation is complimented to verify the above result, showing that the diversity system based on the differential space-time block coding (DSTBC) outperforms the traditional nonspace- time system with diversity gain in terms of BER. Furthermore, the numerical results also demonstrate that the error floor of the differential space-time system is much lower than that of the differential nonspace-time system.
Turbo码块同步参数优化设计%Optimized Parameter Design for Turbo Code Block Synchronizer
吴岭; 张金荣; 刘胜利
2011-01-01
Based on research on channel code block synchronization, this paper designs the synchronizer's parameters forthe Turbo code specified in CCSDS recommendation. A set of parameters are acquired for each code block length and coderate to optimize the average time to get locked and data availability, which is calculated with a formula derived in analyticalform. Optimum synchronizer's parameters are selected based on computation and the characteristics of the parameters aresummarized. The synchronizer's parameters are provided for practical engineering reference.%在信道码码块同步技术研究的基础上,针对CCSDS(空间数据系统咨询委员会)建议规定的Turbo码,为不同码块长度、不同编码效率的Turbo码设计一组最佳同步参数,以最优化平均入锁时间和数据有效率.利用理论推导出的解析公式,计算不同参数下的平均入锁时间和数据有效率,从而优选出最佳同步参数,并归纳总结最佳同步参数的特点.本文得到的同步参数可为实际工程提供参考.
Suphattharachai Chomphan
2011-01-01
Full Text Available Problem statement: In spontaneous speech communication, speech coding is an important process that should be taken into account, since the quality of coded speech depends on the efficiency of the speech coding algorithm. As for tonal language which tone plays important role not only on the naturalness and also the intelligibility of the speech, tone must be treated appropriately. Approach: This study proposes a modification of flexible Multi-Pulse based Code Excited Linear Predictive (MP-CELP coder with multiple bitrates and bitrate scalabilities for tonal language speech in the multimedia applications. The coder consists of a core coder and bitrate scalable tools. The High Pitch Delay Resolutions (HPDR are applied to the adaptive codebook of core coder for tonal language speech quality improvement. The bitrate scalable tool employs multi-stage excitation coding based on an embedded-coding approach. The multi-pulse excitation codebook at each stage is adaptively produced depending on the selected excitation signal at the previous stage. Results: The experimental results show that the speech quality of the proposed coder is improved above the speech quality of the conventional coder without pitch-resolution adaptation. Conclusion: From the study, it is a strong evidence to further apply the proposed technique in the speech coding systems or other speech processing technologies.
A Study on Architecture of Malicious Code Blocking Scheme with White List in Smartphone Environment
Lee, Kijeong; Tolentino, Randy S.; Park, Gil-Cheol; Kim, Yong-Tae
Recently, the interest and demands for mobile communications are growing so fast because of the increasing prevalence of smartphones around the world. In addition, the existing feature phones were replaced by smartphones and it has widely improved while using the explosive growth of Internet users using smartphones, e-commerce enabled Internet banking transactions and the importance of protecting personal information. Therefore, the development of smartphones antivirus products was developed and launched in order to prevent malicious code or virus infection. In this paper, we proposed a new scheme to protect the smartphone from malicious codes and malicious applications that are element of security threats in mobile environment and to prevent information leakage from malicious code infection. The proposed scheme is based on the white list smartphone application which only allows installing authorized applications and to prevent the installation of malicious and untrusted mobile applications which can possibly infect the applications and programs of smartphones.
YUE DianWu; WANG Qian
2009-01-01
Orthogonal space-time block codes (OSTBCs) are an efficient mean In order to exploit the diversity offered by the wireless multiple-input multiple-output (MIMO) channel.This paper considers capacity problems of OSTBCs over spatially correlated multiple-input single-out (MISO) Rayleigh fading channels in the presence of spatially correlated Rayleigh co-channel interference and additive Gaussian noise,and derives exact expressions of the ergodic capacity and outage probability (capacity distribution) for such OSTBCs.Some numerical examples are given to illustrate the effect of co-channel interference on the ergodic and outage capacity of OSTBCs.
Rijhun Tripathi
2012-01-01
Full Text Available —Multiple transmit and receive antennas can be used to form multiple-input multiple-output (MIMO channels to increase the capacity (by a factor of the minimum number of transmit and receive antennas and data rate. In this paper, the combination of MIMO technology and orthogonal frequency division multiplexing (OFDM systems is considered for wideband transmission to mitigate inter symbol interference and to enhance system capacity. It owns the advantages of both MIMO and OFDM. MIMO-OFDM system exploits the space and frequency diversity simultaneously to improve the performance of system. The coding is done across OFDM subcarriers rather than OFDM symbols. In this paper, the performance of Space-Frequency (SF block coding for MIMO-OFDM along with different equalizers is investigated. Bit Error Rate (BER analysis is presented using different equalizers and then optimum equalization method is suggested.
Zhu, Yutian
2012-01-01
In the current study, we applied the Monte Carlo method to study the self-assembly of linear ABC amphiphiles composed of two solvophobic A and B blocks and a solvophilic C block. A great number of multicompartment micelles are discovered from the simulations and the detailed phase diagrams for the ABC amphiphiles with different block lengths are obtained. The simulation results reveal that the micellar structure is largely controlled by block length, solvent quality, and incompatibility between the different block types. When the B block is longer than or as same as the terminal A block, a rich variety of micellar structures can be formed from ABC amphiphiles. By adjusting the solvent quality or incompatibility between the different block types, multiple morphological transitions are observed. These morphological sequences are well explained and consistent with all the previous experimental and theoretical studies. Despite the complexity of the micellar structures and morphological transitions observed for the self-assembly of ABC amphiphiles, two important common features of the phase behavior are obtained. In general, the micellar structures obtained in the current study can be divided into zero-dimensional (sphere-like structures, including bumpy-surfaced spheres and sphere-on-sphere structures), one-dimensional (cylinder-like structures, including rod and ring structures), two-dimensional (layer-like structures, including disk, lamella and worm-like and hamburger structures) and three-dimensional (vesicle) structures. It is found that the micellar structures transform from low- to high- dimensional structures when the solvent quality for the solvophobic blocks is decreased. In contrast, the micellar structures transform from high- to low-dimensional structures as the incompatibility between different block types increases. Furthermore, several novel micellar structures, such as the CBABC five-layer vesicle, hamburger, CBA three-layer ring, wormlike shape with
A 4.8 kbps code-excited linear predictive coder
Tremain, Thomas E.; Campbell, Joseph P., Jr.; Welch, Vanoy C.
1988-01-01
A secure voice system STU-3 capable of providing end-to-end secure voice communications (1984) was developed. The terminal for the new system will be built around the standard LPC-10 voice processor algorithm. The performance of the present STU-3 processor is considered to be good, its response to nonspeech sounds such as whistles, coughs and impulse-like noises may not be completely acceptable. Speech in noisy environments also causes problems with the LPC-10 voice algorithm. In addition, there is always a demand for something better. It is hoped that LPC-10's 2.4 kbps voice performance will be complemented with a very high quality speech coder operating at a higher data rate. This new coder is one of a number of candidate algorithms being considered for an upgraded version of the STU-3 in late 1989. The problems of designing a code-excited linear predictive (CELP) coder to provide very high quality speech at a 4.8 kbps data rate that can be implemented on today's hardware are considered.
LINFLUX-AE: A Turbomachinery Aeroelastic Code Based on a 3-D Linearized Euler Solver
Reddy, T. S. R.; Bakhle, M. A.; Trudell, J. J.; Mehmed, O.; Stefko, G. L.
2004-01-01
This report describes the development and validation of LINFLUX-AE, a turbomachinery aeroelastic code based on the linearized unsteady 3-D Euler solver, LINFLUX. A helical fan with flat plate geometry is selected as the test case for numerical validation. The steady solution required by LINFLUX is obtained from the nonlinear Euler/Navier Stokes solver TURBO-AE. The report briefly describes the salient features of LINFLUX and the details of the aeroelastic extension. The aeroelastic formulation is based on a modal approach. An eigenvalue formulation is used for flutter analysis. The unsteady aerodynamic forces required for flutter are obtained by running LINFLUX for each mode, interblade phase angle and frequency of interest. The unsteady aerodynamic forces for forced response analysis are obtained from LINFLUX for the prescribed excitation, interblade phase angle, and frequency. The forced response amplitude is calculated from the modal summation of the generalized displacements. The unsteady pressures, work done per cycle, eigenvalues and forced response amplitudes obtained from LINFLUX are compared with those obtained from LINSUB, TURBO-AE, ASTROP2, and ANSYS.
New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes
Ma, Xiao; Bai, Baoming
2011-01-01
In this paper, new techniques are presented to either simplify or improve most existing upper bounds on the maximum-likelihood (ML) decoding performance of the binary linear codes over additive white Gaussian noise (AWGN) channels. Firstly, the recently proposed union bound using truncated weight spectrums by Ma {\\em et al} is re-derived in a detailed way based on Gallager's first bounding technique (GFBT), where the "good region" is specified by a sub-optimal list decoding algorithm. The error probability caused by the bad region can be upper-bounded by the tail-probability of a binomial distribution, while the error probability caused by the good region can be upper-bounded by most existing techniques. Secondly, we propose two techniques to tighten the union bound on the error probability caused by the good region. The first technique is based on pair-wise error probabilities, which can be further tightened by employing the independence between the error events and certain components of the received random ...
Farrell, Patricio
2015-04-30
© 2015John Wiley & Sons, Ltd. Symmetric collocation methods with RBFs allow approximation of the solution of a partial differential equation, even if the right-hand side is only known at scattered data points, without needing to generate a grid. However, the benefit of a guaranteed symmetric positive definite block system comes at a high computational cost. This cost can be alleviated somewhat by considering compactly supported RBFs and a multiscale technique. But the condition number and sparsity will still deteriorate with the number of data points. Therefore, we study certain block diagonal and triangular preconditioners. We investigate ideal preconditioners and determine the spectra of the preconditioned matrices before proposing more practical preconditioners based on a restricted additive Schwarz method with coarse grid correction. Numerical results verify the effectiveness of the preconditioners.
Ishitani, Terry T.
2010-01-01
This study applied hierarchical linear modeling to investigate the effect of congruence on intrinsic and extrinsic aspects of job satisfaction. Particular focus was given to differences in job satisfaction by gender and by Holland's first-letter codes. The study sample included nationally represented 1462 female and 1280 male college graduates who…
Ishitani, Terry T.
2010-01-01
This study applied hierarchical linear modeling to investigate the effect of congruence on intrinsic and extrinsic aspects of job satisfaction. Particular focus was given to differences in job satisfaction by gender and by Holland's first-letter codes. The study sample included nationally represented 1462 female and 1280 male college graduates who…
Dattoli, Giuseppe
2005-01-01
The coherent synchrotron radiation (CSR) is one of the main problems limiting the performance of high intensity electron accelerators. A code devoted to the analysis of this type of problems should be fast and reliable: conditions that are usually hardly achieved at the same time. In the past, codes based on Lie algebraic techniques have been very efficient to treat transport problem in accelerators. The extension of these method to the non-linear case is ideally suited to treat CSR instability problems. We report on the development of a numerical code, based on the solution of the Vlasov equation, with the inclusion of non-linear contribution due to wake field effects. The proposed solution method exploits an algebraic technique, using exponential operators implemented numerically in C++. We show that the integration procedure is capable of reproducing the onset of an instability and effects associated with bunching mechanisms leading to the growth of the instability itself. In addition, parametric studies a...
Samokhin, Aleksei [Scientific and Engineering Centre for Nuclear and Radiation Safety (SEC NRS), Moscow (Russian Federation); Zilly, Matias [Gesellschaft fuer Anlagen- und Reaktorsicherheit (GRS) gGmbH, Garching (Germany)
2016-11-15
This work describes the application and the results of transient calculations for the RBMK-1000 with the coupled code system ATHLET 2.2A-QUABOX/CUBBOX which was developed in GRS. Within these studies the planned modernization of the graphite blocks of the RBMK-1000 reactor is taken into account. During the long-term operation of the uranium-graphite reactors RBMK-1000, a change of physical and mechanical properties of the reactor graphite blocks is observed due to the impact of radiation and temperature effects. These have led to a deformation of the reactor graphite columns and, as a result, a deformation of the control and protection system (CPS) and of fuel channels. Potentially, this deformation can lead to problems affecting the smooth movement of the control rods in the CPS channels and problems during the loading and unloading of fuel assemblies. The present paper analyzes two reactivity insertion transients, each taking into account three graphite removal scenarios. The presented work is directly connected with the modernization program of the RBMK- 1000 reactors and has an important contribution to the assessment of the safety-relevant parameters after the modification of the core graphite blocks.
A Comparison Between GATE and MCNPX Monte Carlo Codes in Simulation of Medical Linear Accelerator
Sadoughi, Hamid-Reza; Nasseri, Shahrokh; Momennezhad, Mahdi; Sadeghi, Hamid-Reza; Bahreyni-Toosi, Mohammad-Hossein
2014-01-01
Radiotherapy dose calculations can be evaluated by Monte Carlo (MC) simulations with acceptable accuracy for dose prediction in complicated treatment plans. In this work, Standard, Livermore and Penelope electromagnetic (EM) physics packages of GEANT4 application for tomographic emission (GATE) 6.1 were compared versus Monte Carlo N-Particle eXtended (MCNPX) 2.6 in simulation of 6 MV photon Linac. To do this, similar geometry was used for the two codes. The reference values of percentage depth dose (PDD) and beam profiles were obtained using a 6 MV Elekta Compact linear accelerator, Scanditronix water phantom and diode detectors. No significant deviations were found in PDD, dose profile, energy spectrum, radial mean energy and photon radial distribution, which were calculated by Standard and Livermore EM models and MCNPX, respectively. Nevertheless, the Penelope model showed an extreme difference. Statistical uncertainty in all the simulations was MCNPX, Standard, Livermore and Penelope models, respectively. Differences between spectra in various regions, in radial mean energy and in photon radial distribution were due to different cross section and stopping power data and not the same simulation of physics processes of MCNPX and three EM models. For example, in the Standard model, the photoelectron direction was sampled from the Gavrila-Sauter distribution, but the photoelectron moved in the same direction of the incident photons in the photoelectric process of Livermore and Penelope models. Using the same primary electron beam, the Standard and Livermore EM models of GATE and MCNPX showed similar output, but re-tuning of primary electron beam is needed for the Penelope model. PMID:24696804
A block Krylov subspace time-exact solution method for linear ordinary differential equation systems
Botchev, M.A.
2013-01-01
We propose a time-exact Krylov-subspace-based method for solving linear ordinary differential equation systems of the form $y'=-Ay+g(t)$ and $y"=-Ay+g(t)$, where $y(t)$ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of th
A block Krylov subspace time-exact solution method for linear ODE systems
Botchev, M.A.
2012-01-01
We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form $y'=-Ay + g(t)$ and $y''=-Ay + g(t)$, where $y(t)$ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approxim
A block Krylov subspace time-exact solution method for linear ordinary differential equation systems
Bochev, Mikhail A.
2013-01-01
We propose a time-exact Krylov-subspace-based method for solving linear ordinary differential equation systems of the form $y'=-Ay+g(t)$ and $y"=-Ay+g(t)$, where $y(t)$ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of
A block Krylov subspace time-exact solution method for linear ODE systems
Bochev, Mikhail A.
We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form $y'=-Ay + g(t)$ and $y''=-Ay + g(t)$, where $y(t)$ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial
Incomplete decode-and-forward protocol using distributed space-time block codes
Hucher, Charlotte; Saadani, Ahmed
2008-01-01
In this work, we explore the introduction of distributed space-time codes in decode-and-forward (DF) protocols. A first protocol named the Asymmetric DF is presented. It is based on two phases of different lengths, defined so that signals can be fully decoded at relays. This strategy brings full diversity but the symbol rate is not optimal. To solve this problem a second protocol named the Incomplete DF is defined. It is based on an incomplete decoding at the relays reducing the length of the first phase. This last strategy brings both full diversity and full symbol rate. The outage probability and the simulation results show that the Incomplete DF has better performance than any existing DF protocol and than the non-orthogonal amplify-and-forward (NAF) strategy using the same space-time codes. Moreover the diversity-multiplexing gain tradeoff (DMT) of this new DF protocol is proven to be the same as the one of the NAF.
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model
Giacomelli, Irene; Döttling, Nico; Damgård, Ivan Bjerre;
abort) completely unrelated with m. It is known that non-malleability is possible only for restricted classes of tampering functions. Since their introduction, a long line of works has established feasibility results of non-malleable codes against different families of tampering functions. However......Non-malleable codes were introduced by Dziembowski et al. (ICS 2010) as coding schemes that protect a message against tampering attacks. Roughly speaking, a code is non-malleable if decoding an adversarially tampered encoding of a message m produces the original message m or a value m' (eventually......, for many interesting families the challenge of finding "good" non-malleable codes remains open. In particular, we would like to have explicit constructions of non-malleable codes with high-rate and efficient encoding/decoding algorithms (i.e. low computational complexity). In this work we present two...
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
Golin, Mordecai; Mathieu, Claire; Young, Neal E.
2002-01-01
We give a polynomial-time approximation scheme for the generalization of Huffman Coding in which codeword letters have non-uniform costs (as in Morse code, where the dash is twice as long as the dot). The algorithm computes a (1+epsilon)-approximate solution in time O(n + f(epsilon) log^3 n), where n is the input size.
Bounds on the Weight Hierarchies of a Kind of Linear Codes Satisfying Non-Chain Condition
LIUZihui; CHENWende
2005-01-01
The upper bound of weight hierarchies of codes with a divided-chain of arbitrary continuous break points are studied and the codes satisfying the upperbound are constructed by finite projective geometry, in particular, the geometrical construction is tight for the upper-bound weight hierarchies.
Development of a relativistic Particle In Cell code PARTDYN for linear accelerator beam transport
Phadte, D.; Patidar, C. B.; Pal, M. K.
2017-04-01
A relativistic Particle In Cell (PIC) code PARTDYN is developed for the beam dynamics simulation of z-continuous and bunched beams. The code is implemented in MATLAB using its MEX functionality which allows both ease of development as well higher performance similar to a compiled language like C. The beam dynamics calculations carried out by the code are compared with analytical results and with other well developed codes like PARMELA and BEAMPATH. The effect of finite number of simulation particles on the emittance growth of intense beams has been studied. Corrections to the RF cavity field expressions were incorporated in the code so that the fields could be calculated correctly. The deviations of the beam dynamics results between PARTDYN and BEAMPATH for a cavity driven in zero-mode have been discussed. The beam dynamics studies of the Low Energy Beam Transport (LEBT) using PARTDYN have been presented.
Joda, Roghayeh
2012-01-01
In this paper, delay-limited transmission of quasi-stationary sources over block fading channels are considered. Considering distortion outage probability as the performance measure, two source and channel coding schemes with power adaptive transmission are presented. The first one is optimized for fixed rate transmission, and hence enjoys simplicity of implementation. The second one is a high performance scheme, which also benefits from optimized rate adaptation with respect to source and channel states. In high SNR regime, the performance scaling laws in terms of outage distortion exponent and asymptotic outage distortion gain are derived, where two schemes with fixed transmission power and adaptive or optimized fixed rates are considered as benchmarks for comparisons. Various analytical and numerical results are provided which demonstrate a superior performance for source and channel optimized rate and power adaptive scheme. It is also observed that from a distortion outage perspective, the fixed rate adap...
Xiaorong Xu
2009-08-01
Full Text Available Cooperative MIMO network, which consists of multiple relay nodes equipped with a single antenna, is introduced in this paper. Virtual MIMO is examined with multi-relay cooperative communication. Performances of Distributed Space-Time Block Code (DSTBC in cooperative MIMO are analyzed and compared with general cooperative diversity protocols. Diversity multiplexing tradeoff (DMT, outage probability of DSTBC and pair-wise error probability (PEP of virtual MIMO with DSTBC are derived in detail with equation denotation presented. Numerical Results of DMT and outage performance indicate that, DSTBC could provide full spatial diversity in two cooperative nodes, and it outperforms other cooperative protocols such as Amplify-and-Forward (AF and Selection Decode and Forward (SDF with the increase of cooperative nodes. Meanwhile, Monte Carlo simulation of average error performance in cooperative MIMO network reveal that, with the increase of cooperative nodes, DSTBC could obtain both spatial diversity gain and coded gain. In addition, higher order modulation with the increased number of relays could also enhance BER performance in multi-relay cooperative MIMO network. Theoretical results are confirmed by means of simulations.
Blind and semi-blind ML detection for space-time block-coded OFDM wireless systems
Zaib, Alam
2014-01-01
This paper investigates the joint maximum likelihood (ML) data detection and channel estimation problem for Alamouti space-time block-coded (STBC) orthogonal frequency-division multiplexing (OFDM) wireless systems. The joint ML estimation and data detection is generally considered a hard combinatorial optimization problem. We propose an efficient low-complexity algorithm based on branch-estimate-bound strategy that renders exact joint ML solution. However, the computational complexity of blind algorithm becomes critical at low signal-to-noise ratio (SNR) as the number of OFDM carriers and constellation size are increased especially in multiple-antenna systems. To overcome this problem, a semi-blind algorithm based on a new framework for reducing the complexity is proposed by relying on subcarrier reordering and decoding the carriers with different levels of confidence using a suitable reliability criterion. In addition, it is shown that by utilizing the inherent structure of Alamouti coding, the estimation performance improvement or the complexity reduction can be achieved. The proposed algorithms can reliably track the wireless Rayleigh fading channel without requiring any channel statistics. Simulation results presented against the perfect coherent detection demonstrate the effectiveness of blind and semi-blind algorithms over frequency-selective channels with different fading characteristics.
El Habti El Idrissi Anas
2014-08-01
Full Text Available The Reed-Solomon codes RS are widely used in communication systems, in particular forming part of the specification for the ETSI digital terrestrial television standard. In this paper a simple algorithm for error detection in the Chien Search block is proposed. This algorithm is based on a simple factorization of the error locator polynomial, which allows reducing the number of components required to implement the proposed algorithm on FPGA board. Consequently, it reduces the power consumption with a percentage which can reach 50 % compared to the basic RS decoder. First, we developed the design of Chien Search Block Second, we generated and simulated the hardware description language source code using Quartus software tools,finally we implemented the proposed algorithm of Chien search block for Reed-Solomon codesRS (255, 239 on FPGA board to show both the reduced hardware resources and low complexity compared to the basic algorithm.
Anas Altaleb
2017-03-01
Full Text Available The aim of this work is to synthesize 8*8 substitution boxes (S-boxes for block ciphers. The confusion creating potential of an S-box depends on its construction technique. In the first step, we have applied the algebraic action of the projective general linear group PGL(2,GF(28 on Galois field GF(28. In step 2 we have used the permutations of the symmetric group S256 to construct new kind of S-boxes. To explain the proposed extension scheme, we have given an example and constructed one new S-box. The strength of the extended S-box is computed, and an insight is given to calculate the confusion-creating potency. To analyze the security of the S-box some popular algebraic and statistical attacks are performed as well. The proposed S-box has been analyzed by bit independent criterion, linear approximation probability test, non-linearity test, strict avalanche criterion, differential approximation probability test, and majority logic criterion. A comparison of the proposed S-box with existing S-boxes shows that the analyses of the extended S-box are comparatively better.
Altaleb, Anas; Saeed, Muhammad Sarwar; Hussain, Iqtadar; Aslam, Muhammad
2017-03-01
The aim of this work is to synthesize 8*8 substitution boxes (S-boxes) for block ciphers. The confusion creating potential of an S-box depends on its construction technique. In the first step, we have applied the algebraic action of the projective general linear group PGL(2,GF(28)) on Galois field GF(28). In step 2 we have used the permutations of the symmetric group S256 to construct new kind of S-boxes. To explain the proposed extension scheme, we have given an example and constructed one new S-box. The strength of the extended S-box is computed, and an insight is given to calculate the confusion-creating potency. To analyze the security of the S-box some popular algebraic and statistical attacks are performed as well. The proposed S-box has been analyzed by bit independent criterion, linear approximation probability test, non-linearity test, strict avalanche criterion, differential approximation probability test, and majority logic criterion. A comparison of the proposed S-box with existing S-boxes shows that the analyses of the extended S-box are comparatively better.
Turner, W.
2007-01-01
Consider representation theory associated to symmetric groups, or to Hecke algebras in type A, or to q-Schur algebras, or to finite general linear groups in non-describing characteristic. Rock blocks are certain combinatorially defined blocks appearing in such a representation theory, first observed by R. Rouquier. Rock blocks are much more symmetric than general blocks, and every block is derived equivalent to a Rock block. Motivated by a theorem of J. Chuang and R. Kessar in the case of sym...
AN EFFICIENT CODE TO COMPUTE NONPARALLEL STEADY FLOWS AND THEIR LINEAR-STABILITY
DIJKSTRA, HA; MOLEMAKER, MJ; VANDERPLOEG, A; BOTTA, EFF
1995-01-01
A simple, fast and efficient algorithm to compute steady non-parallel flows and their linear stability in parameter space is described. The pseudo-arclength continuation method is used to trace branches of steady states as one of the parameters is varied. To determine the linear stability of each st
Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks
Goela, Naveen
2012-01-01
A model, called the linear transform network (LTN), is proposed to analyze the compression and estimation of correlated signals transmitted over directed acyclic graphs (DAGs). An LTN is a DAG network with multiple source and receiver nodes. Source nodes transmit subspace projections of random correlated signals by applying reduced-dimension linear transforms. The subspace projections are linearly processed by multiple relays and routed to intended receivers. Each receiver applies a linear estimator to approximate a subset of the sources with minimum mean squared error (MSE) distortion. The model is extended to include noisy networks with power constraints on transmitters. A key task is to compute all local compression matrices and linear estimators in the network to minimize end-to-end distortion. The non-convex problem is solved iteratively within an optimization framework using constrained quadratic programs (QPs). The proposed algorithm recovers as special cases the regular and distributed Karhunen-Loeve ...
王兴涛
2002-01-01
Control equation and adjoint equation are established by using block-pulse functions, which trans-forms the linear time-varying systems with time delays into a system of algebraic equations and the optimal con-trol problems are transformed into an optimization problem of multivariate functions thereby achieving the opti-mal control of linear systems with time delays.
Kondo, Yoshihisa; Yomo, Hiroyuki; Yamaguchi, Shinji; Davis, Peter; Miura, Ryu; Obana, Sadao; Sampei, Seiichi
This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.
Hundebøll, Martin; Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani
2014-01-01
This work studies the potential and impact of the FRANC network coding protocol for delivering high quality Dynamic Adaptive Streaming over HTTP (DASH) in wireless networks. Although DASH aims to tailor the video quality rate based on the available throughput to the destination, it relies...
Yarahmadi R.
2015-01-01
Full Text Available Various geological processes such as tectonic activities develop fractures and discontinuities in the rock mass body; these, in turn, form blocks with different shapes and sizes in the rock mass body. Accurate understanding of these blocks' geometry is essential in different domains of rock and mine engineering such as determination of yield in quarries, optimization of fragmentation energy, the design of blasting pattern, block stability in slopes and underground spaces and the prediction of dilution potential in caving methods exploitation. Because of costly operation and uncertainties in the measurement of fractures and discontinuities properties in 3D, 2D simple models are recommended. So far, all investigations have been focused on the problem of finding primary blocks analytically and mathematically, but these problem applications have been neglected slightly. This paper introduces a MATLAB code for geometry determination of rock mass blocks in two dimensional spaces and investigates the applications of it.
Mahdaviani, Kaveh; Tellambura, Chintha
2011-01-01
In this paper, an extension of raptor codes is introduced which keeps all the desirable properties of raptor codes, including the linear complexity of encoding and decoding per information bit, unchanged. The new design, however, improves the performance in terms of the reception rate. Our simulations show a 10% reduction in the needed overhead at the benchmark block length of 64,520 bits and with the same complexity per information bit.
The piecewise-linear predictor-corrector code - A Lagrangian-remap method for astrophysical flows
Lufkin, Eric A.; Hawley, John F.
1993-01-01
We describe a time-explicit finite-difference algorithm for solving the nonlinear fluid equations. The method is similar to existing Eulerian schemes in its use of operator-splitting and artificial viscosity, except that we solve the Lagrangian equations of motion with a predictor-corrector and then remap onto a fixed Eulerian grid. The remap is formulated to eliminate errors associated with coordinate singularities, with a general prescription for remaps of arbitrary order. We perform a comprehensive series of tests on standard problems. Self-convergence tests show that the code has a second-order rate of convergence in smooth, two-dimensional flow, with pressure forces, gravity, and curvilinear geometry included. While not as accurate on idealized problems as high-order Riemann-solving schemes, the predictor-corrector Lagrangian-remap code has great flexibility for application to a variety of astrophysical problems.
Tsang, P. W. M.; Poon, T.-C.; Jiao, A. S. M.
2013-09-01
Past research has demonstrated that a three-dimensional (3D) intensity image can be preserved to a reasonable extent with a binary Fresnel hologram called the grid-cross down-sampling (GCD) binary hologram, if the intensity image is first down-sampled with a grid-cross lattice prior to the generation of the hologram. It has also been shown that the binary hologram generated with such means can be embedded with a binary image without causing observable artifact on the reconstructed image. Hence, the method can be further extended to embed an intensity image by binarizing it with error diffusion. Despite the favorable findings, the visual quality of the retrieved embedded intensity image from the hologram is rather poor. In this paper, we propose a method to overcome this problem. First, we employ the block truncation coding (BTC) to convert the intensity image into a binary bit stream. Next, the binary bit stream is embedded into the GCD binary hologram. The embedded image can be recovered with a BTC decoder, as well as a noise suppression scheme if the hologram is partially damaged. Experimental results demonstrate that with our proposed method, the visual quality of the embedded intensity image is superior to that of the existing approach, and the extracted image preserves favorably even if the binary hologram is damaged and contaminated with noise.
Marocchino, A.; Massimo, F.; Rossi, A. R.; Chiadroni, E.; Ferrario, M.
2016-09-01
In this paper we present a hybrid approach aiming to assess feasible plasma wakefield acceleration working points with reduced computation resources. The growing interest for plasma wakefield acceleration and especially the need to control with increasing precision the quality of the accelerated bunch demands for more accurate and faster simulations. Particle in cell codes are the state of the art technique to simulate the underlying physics, however the run-time represents the major drawback. Architect is a hybrid code that treats the bunch kinetically and the background electron plasma as a fluid, initialising bunches in vacuum so to take into account for the transition from vacuum to plasma. Architect solves directly the Maxwell's equations on a Yee lattice. Such an approach allows us to drastically reduce run time without loss of generality or accuracy up to the weakly non linear regime.
Marocchino, A., E-mail: albz.uk@gmail.com [Dipartimento SBAI, “Sapienza” University of Rome and INFN-Roma 1, Rome (Italy); Massimo, F. [Dipartimento SBAI, “Sapienza” University of Rome and INFN-Roma 1, Rome (Italy); Rossi, A.R. [Dipartimento di Fisica, University of Milan and INFN-Milano, Milano (Italy); Chiadroni, E.; Ferrario, M. [INFN-LNF, Frascati (Italy)
2016-09-01
In this paper we present a hybrid approach aiming to assess feasible plasma wakefield acceleration working points with reduced computation resources. The growing interest for plasma wakefield acceleration and especially the need to control with increasing precision the quality of the accelerated bunch demands for more accurate and faster simulations. Particle in cell codes are the state of the art technique to simulate the underlying physics, however the run-time represents the major drawback. Architect is a hybrid code that treats the bunch kinetically and the background electron plasma as a fluid, initialising bunches in vacuum so to take into account for the transition from vacuum to plasma. Architect solves directly the Maxwell's equations on a Yee lattice. Such an approach allows us to drastically reduce run time without loss of generality or accuracy up to the weakly non linear regime.
Fogaccia, G.; Vlad, G.; Briguglio, S.
2016-11-01
Resonant interaction between energetic particles (EPs), produced by fusion reactions and/or additional heating systems, and shear Alfvén modes can destabilize global Alfvénic modes enhancing the EP transport. In order to investigate the EP transport in present and next generation fusion devices, numerical simulations are recognized as a very important tool. Among the various numerical models, the hybrid MHD gyrokinetic one has shown to be a valid compromise between a sufficiently accurate wave-particle interaction description and affordable computational resource requirements. This paper presents a linear benchmark between the hybrid codes HYMAGYC and HMGC. The HYMAGYC code solves the full, linear MHD equations in general curvilinear geometry for the bulk plasma and describes the EP population by the nonlinear gyrokinetic Vlasov equation. On the other side, HMGC solves the nonlinear, reduced O≤ft(ε 03\\right) , pressureless MHD equations ({ε0} being the inverse aspect ratio) for the bulk plasma and the drift kinetic Vlasov equation for the EPs. The results of the HYMAGYC and HMGC codes have been compared both in the MHD limit and in a wide range of the EP parameter space for two test cases (one of which being the so-called TAE n = 6 ITPA Energetic Particle Group test case), both characterized by {ε0}\\ll 1 . In the first test case (test case A), good qualitative agreement is found w.r.t. real frequencies, growth rates and spatial structures of the most unstable modes, with some quantitative differences for the growth rates. For the so-called ITPA test case (test case B), at the nominal energetic particle density value, the disagreement between the two codes is, on the contrary, also qualitative, as a different mode is found as the most unstable one.
Ririn Kusumawati
2016-05-01
In the classification, using Hidden Markov Model, voice signal is analyzed and searched the maximum possible value that can be recognized. The modeling results obtained parameters are used to compare with the sound of Arabic speakers. From the test results' Classification, Hidden Markov Models with Linear Predictive Coding extraction average accuracy of 78.6% for test data sampling frequency of 8,000 Hz, 80.2% for test data sampling frequency of 22050 Hz, 79% for frequencies sampling test data at 44100 Hz.
ZHANG Aili; LIU Xiufeng
2006-01-01
Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory.The new type of linear codes take the congruence class in the congruence class ring R/I1 ∩ I2 ∩…∩ In for the information bit,embed R/Ji into R/I1 ∩ I2 ∩…∩ In,and assign the cosets of R/Ji as the subring of R/I1 ∩ I2 ∩…∩ In and the cosets of R/Ji in R/I1 ∩ I2 ∩…∩ In as check lines.Many code classes exist in the Chinese remainder codes that have high code rates.Chinese remainder codes are the essential generalization of Sun Zi codes.
张爱丽; 刘秀峰; 靳蕃
2004-01-01
Chinese Remainder Codes are constructed by applying weak block designs and Chinese Remainder Theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I1∩I2∩…∩In for the information bit, embed R/Ji into R/I1∩I2∩…∩In, and asssign the cosets of R/Ji as the subring of R/I1∩I2∩…∩In and the cosets of R/Ji in R/I1∩I2∩…∩In as check lines. There exist many code classes in Chinese Remainder Codes, which have high code rates. Chinese Remainder Codes are the essential generalization of Sun Zi Codes.
Chen, Zilu; Liu, Xianlin; Zhang, Chuanbing; Zhang, Zhong; Liang, Fupei
2011-03-07
The reactions of new chiral organic ligands trimesoyltri(L-alanine) (L-TMTAH(3)) or trimesoyltri(D-alanine) (D-TMTAH(3)) with transition metal salts in the presence of an ancillary ligand of 4,4'-bipyridine gave two pairs of three dimensional frameworks [Co(3)(L-TMTA)(2)(4,4'-bpy)(4)]·28H(2)O (1), [Co(3)(D-TMTA)(2)(4,4'-bpy)(4)]·28H(2)O (2) [Ni(3)(L-TMTA)(2)(4,4'-bpy)(4)]·2C(2)H(5)OH·14H(2)O (3) and [Ni(3)(D-TMTA)(2)(4,4'-bpy)(4)]·2C(2)H(5)OH·14H(2)O (4). These compounds were characterized by elemental analysis, IR, and X-ray powder diffraction analysis and the structures of 1-3 were determined from X-ray single crystal diffraction analysis. Complexes 1-4 feature linear trinuclear secondary building blocks [M(3)(COO)(4)](2+) formed via the connection of three metal ions by four carboxylato groups from four TMTA(3-) ligands. Every adjacent two linear trinuclear secondary building blocks are linked by one and three 4,4'-bipyridine molecules along the a and c axis, respectively, to form two-dimensional sheets, which are further connected by TMTA(3-) ligands to construct a porous three dimensional framework with one-dimensional channels. Compound 3 was taken as an example to investigate the adsorption properties of compounds 1-4. It revealed a saturated hydrogen uptake of 216.6 cm(3) g(-1) (2.0 wt%) at 11.1 atm measured at 77 K, a maximum CO(2) uptake of 119.4 cm(3) g(-1) (23.5 wt%) at 19.5 atm measured at 298 K and a saturated CH(4) uptake of 77.8 cm(3) g(-1) (5.6 wt%) at 27.1 atm measured at 298 K. The magnetic studies of complexes 1 and 3 indicate the presence of antiferromagnetic interactions between the metal ions in the two compounds.
Hardware Efficient Approximative Matrix Inversion for Linear Pre-Coding in Massive MIMO
Prabhu, Hemanth; Edfors, Ove; Rodrigues, Joachim; Liu, Liang; Rusek, Fredrik
2014-01-01
This paper describes a hardware efficient linear pre-coder for Massive MIMO Base Stations (BSs) comprising a very large number of antennas, say, in the order of 100s, serving multiple users simultaneously. To avoid hardware demanding direct matrix inversions required for the Zero-Forcing (ZF) pre-coder, we use low complexity Neumann series based approximations. Furthermore, we propose a method to speed-up the convergence of the Neumann series by using tri-diagonal pre-condition matrices, whic...
Suphattharachai Chomphan
2011-01-01
Full Text Available Problem statement: Speech compression is an important issue in the modern digital speech communication. The functionality of bitrates scalability also plays significant role, since the capacity of communication system varies all the time. When considering tonal speech, such as Thai, tone plays important role on the naturalness and the intelligibility of the speech, it must be treated appropriately. Therefore these issues are taken into account in this study. Approach: This study proposes a modification of flexible Multi-Pulse based Code Excited Linear Predictive (MP-CELP coder with bitrates scalabilities for tonal language speech in the multimedia applications. The coder consists of a core coder and bitrates scalable tools. The high pitch delay resolutions are applied to the adaptive codebook of core coder for tonal language speech quality improvement. The bitrates scalable tool employs multi-stage excitation coding based on an embedded-coding approach. The multi-pulse excitation codebook at each stage is adaptively produced depending on the selected excitation signal at the previous stage. Results: The experimental results show that the speech quality of the proposed coder is improved above the speech quality of the conventional coder without pitch-resolution adaptation. Conclusion: From the study, the proposed approach is able to improve the speech compression quality for tonal language and the functionality of bitrates scalability is also developed.
Dongyul Lee
2014-01-01
Full Text Available The advancement in wideband wireless network supports real time services such as IPTV and live video streaming. However, because of the sharing nature of the wireless medium, efficient resource allocation has been studied to achieve a high level of acceptability and proliferation of wireless multimedia. Scalable video coding (SVC with adaptive modulation and coding (AMC provides an excellent solution for wireless video streaming. By assigning different modulation and coding schemes (MCSs to video layers, SVC can provide good video quality to users in good channel conditions and also basic video quality to users in bad channel conditions. For optimal resource allocation, a key issue in applying SVC in the wireless multicast service is how to assign MCSs and the time resources to each SVC layer in the heterogeneous channel condition. We formulate this problem with integer linear programming (ILP and provide numerical results to show the performance under 802.16 m environment. The result shows that our methodology enhances the overall system throughput compared to an existing algorithm.
Lee, Dongyul; Lee, Chaewoo
2014-01-01
The advancement in wideband wireless network supports real time services such as IPTV and live video streaming. However, because of the sharing nature of the wireless medium, efficient resource allocation has been studied to achieve a high level of acceptability and proliferation of wireless multimedia. Scalable video coding (SVC) with adaptive modulation and coding (AMC) provides an excellent solution for wireless video streaming. By assigning different modulation and coding schemes (MCSs) to video layers, SVC can provide good video quality to users in good channel conditions and also basic video quality to users in bad channel conditions. For optimal resource allocation, a key issue in applying SVC in the wireless multicast service is how to assign MCSs and the time resources to each SVC layer in the heterogeneous channel condition. We formulate this problem with integer linear programming (ILP) and provide numerical results to show the performance under 802.16 m environment. The result shows that our methodology enhances the overall system throughput compared to an existing algorithm.
Lee, Chaewoo
2014-01-01
The advancement in wideband wireless network supports real time services such as IPTV and live video streaming. However, because of the sharing nature of the wireless medium, efficient resource allocation has been studied to achieve a high level of acceptability and proliferation of wireless multimedia. Scalable video coding (SVC) with adaptive modulation and coding (AMC) provides an excellent solution for wireless video streaming. By assigning different modulation and coding schemes (MCSs) to video layers, SVC can provide good video quality to users in good channel conditions and also basic video quality to users in bad channel conditions. For optimal resource allocation, a key issue in applying SVC in the wireless multicast service is how to assign MCSs and the time resources to each SVC layer in the heterogeneous channel condition. We formulate this problem with integer linear programming (ILP) and provide numerical results to show the performance under 802.16 m environment. The result shows that our methodology enhances the overall system throughput compared to an existing algorithm. PMID:25276862
Monte Carlo Simulation of Siemens ONCOR Linear Accelerator with BEAMnrc and DOSXYZnrc Code.
Jabbari, Keyvan; Anvar, Hossein Saberi; Tavakoli, Mohammad Bagher; Amouheidari, Alireza
2013-07-01
The Monte Carlo method is the most accurate method for simulation of radiation therapy equipment. The linear accelerators (linac) are currently the most widely used machines in radiation therapy centers. In this work, a Monte Carlo modeling of the Siemens ONCOR linear accelerator in 6 MV and 18 MV beams was performed. The results of simulation were validated by measurements in water by ionization chamber and extended dose range (EDR2) film in solid water. The linac's X-ray particular are so sensitive to the properties of primary electron beam. Square field size of 10 cm × 10 cm produced by the jaws was compared with ionization chamber and film measurements. Head simulation was performed with BEAMnrc and dose calculation with DOSXYZnrc for film measurements and 3ddose file produced by DOSXYZnrc analyzed used homemade MATLAB program. At 6 MV, the agreement between dose calculated by Monte Carlo modeling and direct measurement was obtained to the least restrictive of 1%, even in the build-up region. At 18 MV, the agreement was obtained 1%, except for in the build-up region. In the build-up region, the difference was 1% at 6 MV and 2% at 18 MV. The mean difference between measurements and Monte Carlo simulation is very small in both of ONCOR X-ray energy. The results are highly accurate and can be used for many applications such as patient dose calculation in treatment planning and in studies that model this linac with small field size like intensity-modulated radiation therapy technique.
If a binary code is invariant under a doubly-transitive permutation group, then the set of all code words of weight j forms a balanced incomplete...doubly- transitive permutation group. Thus, BIB designs can be derived from these classes of codes. It is shown that if the symbols of the Reed-Muller
Block TERM factorization of block matrices
SHE Yiyuan; HAO Pengwei
2004-01-01
Reversible integer mapping (or integer transform) is a useful way to realize Iossless coding, and this technique has been used for multi-component image compression in the new international image compression standard JPEG 2000. For any nonsingular linear transform of finite dimension, its integer transform can be implemented by factorizing the transform matrix into 3 triangular elementary reversible matrices (TERMs) or a series of single-row elementary reversible matrices (SERMs). To speed up and parallelize integer transforms, we study block TERM and SERM factorizations in this paper. First, to guarantee flexible scaling manners, the classical determinant (det) is generalized to a matrix function, DET, which is shown to have many important properties analogous to those of det. Then based on DET, a generic block TERM factorization,BLUS, is presented for any nonsingular block matrix. Our conclusions can cover the early optimal point factorizations and provide an efficient way to implement integer transforms for large matrices.
Johansson, Magnus; Zhang, Jingji; Ehrenberg, Måns
2012-01-01
Rapid and accurate translation of the genetic code into protein is fundamental to life. Yet due to lack of a suitable assay, little is known about the accuracy-determining parameters and their correlation with translational speed. Here, we develop such an assay, based on Mg2+ concentration changes, to determine maximal accuracy limits for a complete set of single-mismatch codon–anticodon interactions. We found a simple, linear trade-off between efficiency of cognate codon reading and accuracy of tRNA selection. The maximal accuracy was highest for the second codon position and lowest for the third. The results rationalize the existence of proofreading in code reading and have implications for the understanding of tRNA modifications, as well as of translation error-modulating ribosomal mutations and antibiotics. Finally, the results bridge the gap between in vivo and in vitro translation and allow us to calibrate our test tube conditions to represent the environment inside the living cell. PMID:22190491
Srinath Vadlamani; Scott Kruger; Travis Austin
2008-06-19
Extended magnetohydrodynamic (MHD) codes are used to model the large, slow-growing instabilities that are projected to limit the performance of International Thermonuclear Experimental Reactor (ITER). The multiscale nature of the extended MHD equations requires an implicit approach. The current linear solvers needed for the implicit algorithm scale poorly because the resultant matrices are so ill-conditioned. A new solver is needed, especially one that scales to the petascale. The most successful scalable parallel processor solvers to date are multigrid solvers. Applying multigrid techniques to a set of equations whose fundamental modes are dispersive waves is a promising solution to CEMM problems. For the Phase 1, we implemented multigrid preconditioners from the HYPRE project of the Center for Applied Scientific Computing at LLNL via PETSc of the DOE SciDAC TOPS for the real matrix systems of the extended MHD code NIMROD which is a one of the primary modeling codes of the OFES-funded Center for Extended Magnetohydrodynamic Modeling (CEMM) SciDAC. We implemented the multigrid solvers on the fusion test problem that allows for real matrix systems with success, and in the process learned about the details of NIMROD data structures and the difficulties of inverting NIMROD operators. The further success of this project will allow for efficient usage of future petascale computers at the National Leadership Facilities: Oak Ridge National Laboratory, Argonne National Laboratory, and National Energy Research Scientific Computing Center. The project will be a collaborative effort between computational plasma physicists and applied mathematicians at Tech-X Corporation, applied mathematicians Front Range Scientific Computations, Inc. (who are collaborators on the HYPRE project), and other computational plasma physicists involved with the CEMM project.
Transport simulations of linear plasma generators with the B2.5-Eirene and EMC3-Eirene codes
Rapp, J., E-mail: rappj@ornl.gov [Oak Ridge National Laboratory, Oak Ridge, TN 37830 (United States); Owen, L.W. [Oak Ridge National Laboratory, Oak Ridge, TN 37830 (United States); Bonnin, X. [LSPM-CNRS, Université Paris 13, Sorbonne Paris Cité, F-93430 Villetaneuse (France); Caneses, J.F. [PRL, Research School of Physics and Engineering, ANU, Canberra (Australia); Canik, J.M. [Oak Ridge National Laboratory, Oak Ridge, TN 37830 (United States); Corr, C. [PRL, Research School of Physics and Engineering, ANU, Canberra (Australia); Lore, J.D. [Oak Ridge National Laboratory, Oak Ridge, TN 37830 (United States)
2015-08-15
Linear plasma generators are cost effective facilities to simulate divertor plasma conditions of present and future fusion reactors. The codes B2.5-Eirene and EMC3-Eirene were extensively used for design studies of the planned Material Plasma Exposure eXperiment (MPEX). Effects on the target plasma of the gas fueling and pumping locations, heating power, device length, magnetic configuration and transport model were studied with B2.5-Eirene. Effects of tilted or vertical targets were calculated with EMC3-Eirene and showed that spreading the incident flux over a larger area leads to lower density, higher temperature and off-axis profile peaking in front of the target. The simulations indicate that with sufficient heating power MPEX can reach target plasma conditions that are similar to those expected in the ITER divertor. B2.5-Eirene simulations of the MAGPIE experiment have been carried out in order to establish an additional benchmark with experimental data from a linear device with helicon wave heating.
Afonso Akio Shiozaki
2002-03-01
assisted operations the dissection difficulties can inhibit the resection through this procedure thus forcing the surgeon to convert it to open toracotomy. The improvements of the surgical staples technical quality in the 1990s were so important that they have been considered also possibly efficient in simultaneous sutures of lung hilum structures thus replacing individualized dissection of its components in lung resections. The aim of this study was to verify the effect al lung hilum mechanical block suture. Twelve adult half-breed male dogs were submitted pneumonectomy through simultaneous suture of the lung hilum. They were separated into two groups of six animals each and were observed one for seven and the other for fourteen postoperatory days according to previously prepared protocols to verify macro and microscopic aspects. The access was opened through a lateral toracotomy on the anesthetized animal maintained in mechanical ventilation. The simultaneous suture of the lung hilum was carried out with only one shot of the sharp linear 60mm stapler. No death occurrence, suture dehiscence arterial or vein fistulas were verified. One of the animals presented an abscess in the suture line without developing fistulas or dehiscence. The postoperatory evolution was considered good in tem of the animals (83.3% and regular in two (16.7% that presented small incision abscesses. The data led to the conclusion that this suture technique is feasible, fast and presents good results but needs further studies to corroborate these results.
Gitsov, Ivan; Hamzik, James; Ryan, Joseph; Simonyan, Arsen; Nakas, James P; Omori, Shigetoshi; Krastanov, Albert; Cohen, Tomer; Tanenbaum, Stuart W
2008-03-01
We describe the construction of enzymatic nanoreactors through noncovalent envelopment of a glycoprotein by amphiphilic linear-dendritic AB or ABA copolymers. The synthetic procedure is based on the regioselective adsorption of dendritic poly(benzyl ether)-block-linear poly(ethylene glycol)-block-dendritic poly(benzyl ether) or linear poly(ethylene oxide)-block-dendritic poly(benzyl ether) copolymers onto the oxidative enzyme laccase from Trametes versicolor in aqueous medium. The complexes formed have improved catalytic activity compared with the native enzyme (77-85 nkat/mL vs 60 nkat/mL, respectively) and are more stable at elevated temperatures up to 70 degrees C. Experiments with deglycosylated laccase confirm that the glycoside fragments in the native enzyme serve as the anchor sites for the linear-dendritic copolymers. The enzymatic nanoreactors are able to effectively oxidize series of substrates: phenolic compounds (syringaldazine) and hydrophobic polyaromatic hydrocarbons (anthracene and benzo[a]pyrene) under "green" chemistry conditions.
黄胜; 穆攀; 贾雪婷; 袁建国
2016-01-01
为了满足通信系统中对纠错码高纠错能力及低误码率的要求,基于平衡不完全区组设计(BIBD)构造了一种既适用于加性高斯白噪声(AWGNC)和二元删除信道(BEC)的基区组元素组合的准循环低密度奇偶校验(QC-LDPC)码,记为BIBDcom-QC-LDPC.该方法大幅减少了传统构造方法校验矩阵中6,8环的个数.仿真结果表明：在 AWGNC下,当误码率(BER)为1×10-6时,所构造的 BIBDcom-QC-LDPC(6572,6150)码的净编码增益(NCG)比传统方法和循环置换矩阵(CPM)行(列)分解法构造的 QC-LDPC码分别改善了约0.25和0.10 dB.并且在BEC下所构造的 BIBDcom-QC-LDPC(4044,3370)码的性能要优于传统方法和 CPM行(列)分解法构造的 QC-LDPC码.%In order to meet the requirements of the high error correcting capability and low bit error rate of the error-correction code in communication systems,a novel method was presented based on the basic block elements combination of the balanced incomplete block design (BIBD)for constructing quasi-cyclic low-density parity-check (QC-LDPC)code which is suitable for not only additive white Gaussian noise channel (AWGNC)but also binary erasure channel (BEC).It can greatly reduce the number of girth 6 and girth 8 in the parity check matrix from traditional method.The simulation re-sults show that at the bit error rate of 1×10-6 ,the net coding gain (NCG)of constructed BIBDcom-QC-LDPC(6572,6150)code is 0.25 and 0.10 dB more than that of the traditional QC-LDPC codes and the circulant permutation matrices (CPM)row (colunm)decomposition QC-LDPC codes in AWGNC.The constructed BIBDcom-QC-LDPC(4044,3370)codes perform better compared with the traditional QC-LDPC codes and the CPM row(colunm)decomposition QC-LDPC codes over BEC.
环Fp+uFp+vFp+uvFp上的线性码%Linear Codes Over Fp+uFp+vFp+uvFp
许小芳
2013-01-01
The linear codes over the ring R=Fp+uFp+vFp+uυFp are discussed,where the ring R is not a finite chain ring.The structure of the ring R is analyzed and linear codes over this ring are defined,and the linear code of type (p4)k1 (p3)k2 (u)k3 (v)k4 (u+υ)k5 (p)k6 is characterized.%讨论了有限非链环R=Fp+uFp+υFp+uυFp上的线性码,分析了环R的结构,给出了此环上线性码的定义,并讨论了环R上(p4)k1 (p3)k2 (u)b(u)k4(u+υ)k5(p)k6型的线性码.
Li Zi-qi
2014-10-01
Full Text Available Integration of radar and communication systems based on OFDM signals results in large Peak-to-Average Power Ratio (PAPR. Limited by the code rate, algorithm that use the Golay sequence code to restrain PAPR can only be applied under the condition of a few subcarriers. This study proposes an algorithm to restrain the PAPR of systems with a large number of subcarriers. The algorithm combines the group parallel code with the optimization of weight coefficients. First, bit streams are divided into several groups of parallel bits. Next, every group proceeds with Golay sequence coding, data symbol modulating and inverse Fourier transform. Finally, the parallel result is combined with an OFDM symbol. Before the parallel data are combined, several weight coefficients for every group are introduced; thus, the system has several candidate symbols for transmitting. Then the symbol with minimum PAPR is then selected as the transmitting signal, and the PAPR of the whole system is reduced. PAPR performance, Bit Error Radio (BER and wideband ambiguity function of three block methods with different coding rate are also simulated. The simulations show that the PAPR of the system decreases and the BER performance improves significantly. The signal exhibits a thumbtack ambiguity function, which suggests good resolution and accuracy for distance and velocity measurements.
A NEW ALGORITHM SOLVING THE LINEAR EQUATION SYSTEM WITH BLOCK CYCLE COEFFICIENT MATRIX%块循环矩阵方程组的新算法
张耀明
2001-01-01
A kind of new partitioning algorithm that solves the linear equation system with block cycle coefficient matrix is presented in this paper. The original problem is partitioned into a series of independent subproblems. Compared with the original problem, the dimension of all these subproblems are vary small.This point ensures that it have a better conditioning and give smaller round-off errors. More importantly, the technique leads to a higher efficiency of computation.
Multi-User Cooperative Diversity through Network Coding Based on Classical Coding Theory
Rebelatto, João Luiz; Li, Yonghui; Vucetic, Branka
2010-01-01
In this work, we propose and analyze a generalized construction of distributed network codes for a network consisting of M users sending different information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its code rate. The proposed scheme, called generalized dynamic-network codes (GDNC), is a generalization of the dynamic-network codes (DNC) recently proposed by Xiao and Skoglund. The design of the network codes that maximize the diversity order is recognized as equivalent to the design of linear block codes over a nonbinary finite field under the Hamming metric. We prove that adopting a systematic generator matrix of a maximum distance separable block code over a sufficiently large finite field as the network transfer matrix is a sufficient condition for full diversity order under link failure model. The proposed generalization offers a much better tradeoff between rate and diversity order compared to the DNC. An...
Suzuki, Taizo; Kudo, Hiroyuki
2015-12-01
We propose a 2D non-separable block-lifting structure (2D-NSBL) that is easily formulated from the 1D separable block-lifting structure (1D-SBL) and 2D non-separable lifting structure (2D-NSL). The 2D-NSBL can be regarded as an extension of the 2D-NSL, because a two-channel 2D-NSBL is completely equivalent to a 2D-NSL. We apply the 2D-NSBL to M-channel ( M=2(n), n ∈ N) perfect reconstruction filter banks (PRFBs). The 2D-NSBL-based PRFBs outperform 1D-SBL-based PRFBs at lossy-to-lossless coding, whose image quality is scalable from lossless data to high compressed lossy data, because their rounding errors are reduced by merging many rounding operations.
无
2008-01-01
In this paper, a new scheme that combines Space-Time Block-Coding (STBC) based on an Alamouti-like scheme and the Least Squares (LS) channel estimation using optimal training sequences in Cyclic-Prefix-based (CP)\\Single-Carrier (SC) systems is proposed. With two transmit antennas, based on Cramer-Rao lower bound for channel estimation, it is shown that the Periodic Complementary Set (PCS) is optimal over frequency-selective fading channels. Compared with the normal scheme without STBC, 3dB Mean Square Error (MSE) performance gains and fewer restrictions on the length of channel impulse response are demonstrated.
基于MATLAB的线性循环码编码器设计%Design of the Linear Cyclic Code Generator Based on MATLAB
樊晓宇
2012-01-01
The linear cyclic code generator was designed by the MATLAB software approach based on coding theory of the linear cyclic code.The generator accomplished outputs of the cyclic code encoding results and waveforms through the Simulink in MATLAB software which complets structure of the cyclic code generator and the GUI realizing the program design of graphical user interface of the generator,and realized the encoding visualization of cyclic code generator.%针对线性循环码的编码理论,以MATLAB软件作为平台,设计了线性循环码编码器。通过MAT-LAB软件的Simulink和GUI分别架构循环码编码器的结构和设计编码器的图形用户界面程序,实现了编码器的编码和码字波形输出,达到了编码器的编码可视化。
Høholdt, Tom; Janwa, Heeralal
2009-01-01
We characterize optimaal bipartitet expander graphs and give nessecary and sufficient conditions for optimality. We determine the expansion parameters of the BIBD graphs and show that they yield optimal expander graphs and also bipartitet Ramanujan graphs. in particular, we show that the bipartit...... graphs derived from finite projective and affine geometries yield optimal Ramanujan graphs. This in turn leads to a theoretical explanation of the good performance of a class of LDPC codes....
Tömösközi, Máté; Fitzek, Frank; Roetter, Daniel Enrique Lucani
2014-01-01
overall delays due to processing overheads. This paper describes the delay reduction achieved through online network coding approaches with a limit on the number of packets to be mixed before decoding and a systematic encoding structure. We use the inorder per packet delay as our key performance metric....... This metric captures the elapsed time between (network) encoding RTP packets and completely decoding the packets in-order on the receiver side. Our solutions are implemented and evaluated on a point-to-point link between a Raspberry Pi device and a network (de)coding enabled software running on a regular PC......Video surveillance and similar real-time applications on wireless networks require increased reliability and high performance of the underlying transmission layer. Classical solutions, such as Reed-Solomon codes, increase the reliability, but typically have the negative side-effect of additional...
Bury, Katarzyna; Du Prez, Filip; Neugebauer, Dorota
2013-11-01
A amphiphilic linear AB, BAB, and star shaped (AB)3 block copolymers of poly(ϵ-caprolactone) (PCL)/poly(meth)acrylic acid (P(M)AA) are used for the preparation of nanoparticles and drug entrapment, where indomethacin and quercetin are employed as model drugs. Drug loading experiments with the nanoparticles based on PAA block copolymers demonstrate a higher efficiency for the star structure, whereas the PMAA star copolymer presents the lowest entrapment ability. The release properties are studied at room temperature and 37 °C in phosphate buffer solutions with pH equal to 5 and 7.4. The kinetic profiles show a strong relation to the copolymer's topology, indicating the lowest release rates from the star based superstructures, while the PMAA particles are less stable than those containing PAA segment(s).
Decoding Generalized Concatenated Codes Using Interleaved Reed-Solomon Codes
Senger, Christian; Bossert, Martin; Zyablov, Victor
2008-01-01
Generalized Concatenated codes are a code construction consisting of a number of outer codes whose code symbols are protected by an inner code. As outer codes, we assume the most frequently used Reed-Solomon codes; as inner code, we assume some linear block code which can be decoded up to half its minimum distance. Decoding up to half the minimum distance of Generalized Concatenated codes is classically achieved by the Blokh-Zyablov-Dumer algorithm, which iteratively decodes by first using the inner decoder to get an estimate of the outer code words and then using an outer error/erasure decoder with a varying number of erasures determined by a set of pre-calculated thresholds. In this paper, a modified version of the Blokh-Zyablov-Dumer algorithm is proposed, which exploits the fact that a number of outer Reed-Solomon codes with average minimum distance d can be grouped into one single Interleaved Reed-Solomon code which can be decoded beyond d/2. This allows to skip a number of decoding iterations on the one...
The depth distribution of linear cyclic codes over ring Fpk + uF pk%环Fpk＋uFpk上循环码的深度分布
陈思; 朱士信
2014-01-01
研究了环 R＝ Fp k ＋ u Fp k上任意长度的循环码及其自对偶码的深度分布和深度谱。利用环 R上循环码的生成多项式及R上线性码的深度分布，给出了环 R上循环码及其自对偶码的深度分布和深度谱，并给出了长度为 pm的循环码的深度分布和深度谱。%The depth distribution and spectrum of cyclic codes and self‐dual codes of an arbitrary length over ring R= Fpk + uFpk were studied . Using the generator polynomials of cyclic codes and the depth distribution of linear codes over ring R ,the depth distribution and depth spectrum of cyclic codes and self‐dual codes over the ring R were given ,along with those of cyclic codes of length pm were also given .
Tömösközi, Máté; Fitzek, Frank; Roetter, Daniel Enrique Lucani
2014-01-01
Video surveillance and similar real-time applications on wireless networks require increased reliability and high performance of the underlying transmission layer. Classical solutions, such as Reed-Solomon codes, increase the reliability, but typically have the negative side-effect of additional ...
Low-valent iron: an Fe(I) ate compound as a building block for a linear trinuclear Fe cluster
Lichtenberg, C.; Viciu, L.; Vogt, M.; Rodríguez-Lugo, R.E.; Adelhardt, M.; Sutter, J.; Khusniyarov, M.M.; Meyer, K.; de Bruin, B.; Bill, E.; Grützmacher, H.
2015-01-01
A low-valent trinuclear iron complex with an unusual linear Fe(I)-Fe(II)-Fe(I) unit is presented. It is accessed in a rational approach using a salt metathesis reaction between a new anionic Fe(I) containing heterocycle and FeCl2. Its electronic structure was studied by single crystal XRD analysis,
Elements of algebraic coding systems
Cardoso da Rocha, Jr, Valdemar
2014-01-01
Elements of Algebraic Coding Systems is an introductory textto algebraic coding theory. In the first chapter, you'll gain insideknowledge of coding fundamentals, which is essential for a deeperunderstanding of state-of-the-art coding systems.This book is a quick reference for those who are unfamiliar withthis topic, as well as for use with specific applications such as cryptographyand communication. Linear error-correcting block codesthrough elementary principles span eleven chapters of the text.Cyclic codes, some finite field algebra, Goppa codes, algebraic decodingalgorithms, and applications in public-key cryptography andsecret-key cryptography are discussed, including problems and solutionsat the end of each chapter. Three appendices cover the Gilbertbound and some related derivations, a derivation of the Mac-Williams' identities based on the probability of undetected error,and two important tools for algebraic decoding-namely, the finitefield Fourier transform and the Euclidean algorithm for polynomials.
Gaspard, Jeffery; Casey, Liam M; Rozin, Matt; Munoz-Pinto, Dany J; Silas, James A; Hahn, Mariah S
2016-03-18
Poly(dimethylsiloxane-ethylene oxide) (PDMS-PEO) and poly(butadiene-b-ethylene oxide) (PBd-PEO) are two block copolymers which separately form vesicles with disparate membrane permeabilities and fluidities. Thus, hybrid vesicles formed from both PDMS-PEO and PBd-PEO may ultimately allow for systematic, application-specific tuning of vesicle membrane fluidity and permeability. However, given the relatively low strength previously noted for comb-type PDMS-PEO vesicles, the mechanical robustness of the resulting hybrid vesicles must first be confirmed. Toward this end, we have characterized the mechanical behavior of vesicles formed from mixtures of linear PDMS-PEO and linear PBd-PEO using micropipette aspiration. Tension versus strain plots of pure PDMS12-PEO46 vesicles revealed a non-linear response in the high tension regime, in contrast to the approximately linear response of pure PBd33-PEO20 vesicles. Remarkably, the area expansion modulus, critical tension, and cohesive energy density of PDMS12-PEO46 vesicles were each significantly greater than for PBd33-PEO20 vesicles, although critical strain was not significantly different between these vesicle types. PDMS12-PEO46/PBd33-PEO20 hybrid vesicles generally displayed graded responses in between that of the pure component vesicles. Thus, the PDMS12-PEO46/PBd33-PEO20 hybrid vesicles retained or exceeded the strength and toughness characteristic of pure PBd-PEO vesicles, indicating that future assessment of the membrane permeability and fluidity of these hybrid vesicles may be warranted.
Mapas, Jose Kenneth D.; Thomay, Tim; Cartwright, Alexander N.; Ilavsky, Jan; Rzayev, Javid
2016-05-05
Block copolymer (BCP) derived periodic nanostructures with domain sizes larger than 150 nm present a versatile platform for the fabrication of photonic materials. So far, the access to such materials has been limited to highly synthetically involved protocols. Herein, we report a simple, “user-friendly” method for the preparation of ultrahigh molecular weight linear poly(solketal methacrylate-b-styrene) block copolymers by a combination of Cu-wire-mediated ATRP and RAFT polymerizations. The synthesized copolymers with molecular weights up to 1.6 million g/mol and moderate dispersities readily assemble into highly ordered cylindrical or lamella microstructures with domain sizes as large as 292 nm, as determined by ultra-small-angle x-ray scattering and scanning electron microscopy analyses. Solvent cast films of the synthesized block copolymers exhibit stop bands in the visible spectrum correlated to their domain spacings. The described method opens new avenues for facilitated fabrication and the advancement of fundamental understanding of BCP-derived photonic nanomaterials for a variety of applications.
Weng, Yi; He, Xuan; Yao, Wang; Pacheco, Michelle C.; Wang, Junyi; Pan, Zhongqi
2017-07-01
In this paper, we explored the performance of space-time block-coding (STBC) assisted multiple-input multiple-output (MIMO) scheme for modal dispersion and mode-dependent loss (MDL) mitigation in spatial-division multiplexed optical communication systems, whereas the weight matrices of frequency-domain equalization (FDE) were updated heuristically using decision-directed recursive least squares (RLS) algorithm for convergence and channel estimation. The proposed STBC-RLS algorithm can achieve 43.6% enhancement on convergence rate over conventional least mean squares (LMS) for quadrature phase-shift keying (QPSK) signals with merely 16.2% increase in hardware complexity. The overall optical signal to noise ratio (OSNR) tolerance can be improved via STBC by approximately 3.1, 4.9, 7.8 dB for QPSK, 16-quadrature amplitude modulation (QAM) and 64-QAM with respective bit-error-rates (BER) and minimum-mean-square-error (MMSE).
Locally Orderless Registration Code
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Locally orderless registration code
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Moderate-Density Parity-Check Codes
Ouzan, Samuel
2009-01-01
We propose a new type of short to moderate block-length, linear error-correcting codes, called moderate-density parity-check (MDPC) codes. The number of ones of the parity-check matrix of the codes presented is typically higher than the number of ones of the parity-check matrix of low-density parity-check (LDPC) codes. But, still lower than those of the parity-check matrix of classical block codes. The proposed MDPC codes are cyclic and are designed by constructing idempotents using cyclotomic cosets. The construction is simple and allows finding short block-length, high-rate codes with good minimum distance. Inspired by some recent iterative soft-input soft-output (SISO) decoders used in a context of classical block codes, we propose a low complexity, efficient, iterative decoder called Auto-Diversity (AD) decoder. AD decoder is based on belief propagation (BP) decoder and takes advantage of the fundamental property of automorphism group of the constructed cyclic code.
On the generalized Hamming weights of convolutional codes
Rosenthal, J.; York, E.V.
1995-01-01
Motivated by applications in cryptology K. Wei introduced in 1991 the concept of a generalized Hamming weight for a linear block code. In this paper we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convoluti
基于广义ABBA空时分组码的OFDM系统%An OFDM System based on Generalized ABBA Space-Time Block Codes
钟伟; 李路
2011-01-01
采用准正交设计的空时分组码虽然可以达到速率为1,但是牺牲了部分分级增益.广义ABBA(GABBA,Generalized ABBA)空时分组码提出了一种改进型块状迭代准正交分组空时码(QOSTBC,Quasi-orthogonal Space-time Code)编码方式.此编码方式能提供全分集增益,并且满速率传输.克服原有正交分组空时码(0STBC,0rthogonal Space-time Block Codes)在多天线(天线数大于2)、复信号时不能实现全速率传送的缺点.OFDM调制技术是抗多径效应的有效手段之一,两者相结合的MIM0-0FDM系统很好利用了时间、空间和频率三种分集,使系统达到很高的传输效率和频谱利用率.
Suphattharachai Chomphan
2010-01-01
Full Text Available Problem statement: The flexible bit-rate speech coder plays an important role in the modern speech communication. The MP-CELP speech coder which is a candidate of the MPEG4 natural speech coder supports a flexible and wide bit-rate range. However, a fine scalability had not been included. To support finer scalability of the coding rate, it had been studied in this study. Approach: In this study, based on the MP-CELP speech coding with HPDR technique, Fine Granularity Scalability was introduced by adjusting the amount of transmitted fixed excitation information. The FGS feature aim at changing the bit rate of the conventional coding more finely and more smoothly. Results: Through performance analysis and computer simulation, the quality of scalability of the MP-CELP coding was presented with an improvement from conventional scalable MP-CELP. The HPDR technique is also applied to the MP-CELP to use for tonal language, meanwhile it can support the core coding rate of 4.2, 5.5, 7.5 kbps and additional scaled bit rates. Conclusion: The core coder with high pitch delay resolution technique and adaptive codebook for tonal speech quality improvement has been conducted and the FGS brings about further efficient scalability.
Munshi, M. Jahirul Haque; Alim, M. A.; Bhuiyan, A. H.; Ali, M.
2017-06-01
The physical model considered here is a lid-driven porous square cavity with internal elliptic shape adiabatic block and linearly heated side walls. The top moving wall is well cold and set with uniform velocity. The bottom moving wall heated, linearly heated side walls and inside the elliptic shape adiabatic. The relevant parameters in the present study are Darcy number Da = 10-5-10-3, Grashof number Gr = 103-105, Reynolds number Re = 1-102 and Prandtl number Pr = 0.7. The isotherms are also almost symmetric at small Re with higher Gr (Gr = 105) and Da (Da = 10-3) and natural convection is found to be dominant whereas the isotherms are compressed near the left and bottom walls at higher Re for linearly heated side walls. The solution of these governing equations is obtained numerically with the finite element approach using the Galerkin method of weighted residuals. Results are presented in the form of streamlines, isotherms, Local Nusselt number, average Nusselt number, velocity and temperature for the afore mentioned parameters. The numerical results indicate the strong influence of the mentioned parameters on the flow structure and heat transfer as well as average Nusselt number. An optimum combination of the governing parameters would result in higher heat transfer.
A Practical Approach to Lossy Joint Source-Channel Coding
Fresia, Maria
2007-01-01
This work is devoted to practical joint source channel coding. Although the proposed approach has more general scope, for the sake of clarity we focus on a specific application example, namely, the transmission of digital images over noisy binary-input output-symmetric channels. The basic building blocks of most state-of the art source coders are: 1) a linear transformation; 2) scalar quantization of the transform coefficients; 3) probability modeling of the sequence of quantization indices; 4) an entropy coding stage. We identify the weakness of the conventional separated source-channel coding approach in the catastrophic behavior of the entropy coding stage. Hence, we replace this stage with linear coding, that maps directly the sequence of redundant quantizer output symbols into a channel codeword. We show that this approach does not entail any loss of optimality in the asymptotic regime of large block length. However, in the practical regime of finite block length and low decoding complexity our approach ...
Vilches, M. [Servicio de Fisica y Proteccion Radiologica, Hospital Regional Universitario ' Virgen de las Nieves' , Avda. de las Fuerzas Armadas, 2, E-18014 Granada (Spain)], E-mail: mvilches@ugr.es; Garcia-Pareja, S. [Servicio de Radiofisica Hospitalaria, Hospital Regional Universitario ' Carlos Haya' , Avda. Carlos Haya, s/n, E-29010 Malaga (Spain); Guerrero, R. [Servicio de Radiofisica, Hospital Universitario ' San Cecilio' , Avda. Dr. Oloriz, 16, E-18012 Granada (Spain); Anguiano, M.; Lallena, A.M. [Departamento de Fisica Atomica, Molecular y Nuclear, Universidad de Granada, E-18071 Granada (Spain)
2007-09-21
When a therapeutic electron linear accelerator is simulated using a Monte Carlo (MC) code, the tuning of the initial spectra and the renormalization of dose (e.g., to maximum axial dose) constitute a common practice. As a result, very similar depth dose curves are obtained for different MC codes. However, if renormalization is turned off, the results obtained with the various codes disagree noticeably. The aim of this work is to investigate in detail the reasons of this disagreement. We have found that the observed differences are due to non-negligible differences in the angular scattering of the electron beam in very thin slabs of dense material (primary foil) and thick slabs of very low density material (air). To gain insight, the effects of the angular scattering models considered in various MC codes on the dose distribution in a water phantom are discussed using very simple geometrical configurations for the LINAC. The MC codes PENELOPE 2003, PENELOPE 2005, GEANT4, GEANT3, EGSnrc and MCNPX have been used.
Tömösközi, Máté; Fitzek, Frank; Roetter, Daniel Enrique Lucani
2015-01-01
decoding of the packets on the receiver side while playing out the video recording contained in the payload. Our solutions are implemented and evaluated on serially connected Raspberry Pi devices and a network (de)coding enabled software running on a regular PC. We find that the recoding relays work...
Jeffery Gaspard
2016-03-01
Full Text Available Poly(dimethylsiloxane-ethylene oxide (PDMS-PEO and poly(butadiene-b-ethylene oxide (PBd-PEO are two block copolymers which separately form vesicles with disparate membrane permeabilities and fluidities. Thus, hybrid vesicles formed from both PDMS-PEO and PBd-PEO may ultimately allow for systematic, application-specific tuning of vesicle membrane fluidity and permeability. However, given the relatively low strength previously noted for comb-type PDMS-PEO vesicles, the mechanical robustness of the resulting hybrid vesicles must first be confirmed. Toward this end, we have characterized the mechanical behavior of vesicles formed from mixtures of linear PDMS-PEO and linear PBd-PEO using micropipette aspiration. Tension versus strain plots of pure PDMS12-PEO46 vesicles revealed a non-linear response in the high tension regime, in contrast to the approximately linear response of pure PBd33-PEO20 vesicles. Remarkably, the area expansion modulus, critical tension, and cohesive energy density of PDMS12-PEO46 vesicles were each significantly greater than for PBd33-PEO20 vesicles, although critical strain was not significantly different between these vesicle types. PDMS12-PEO46/PBd33-PEO20 hybrid vesicles generally displayed graded responses in between that of the pure component vesicles. Thus, the PDMS12-PEO46/PBd33-PEO20 hybrid vesicles retained or exceeded the strength and toughness characteristic of pure PBd-PEO vesicles, indicating that future assessment of the membrane permeability and fluidity of these hybrid vesicles may be warranted.
Ramshaw, J D
2000-10-01
A simple model was recently described for predicting the time evolution of the width of the mixing layer at an unstable fluid interface [J. D. Ramshaw, Phys. Rev. E 58, 5834 (1998); ibid. 61, 5339 (2000)]. The ordinary differential equations of this model have been heuristically generalized into partial differential equations suitable for implementation in multicomponent hydrodynamics codes. The central ingredient in this generalization is a nun-diffusional expression for the species mass fluxes. These fluxes describe the relative motion of the species, and thereby determine the local mixing rate and spatial distribution of mixed fluid as a function of time. The generalized model has been implemented in a two-dimensional hydrodynamics code. The model equations and implementation procedure are summarized, and comparisons with experimental mixing data are presented.
The Depth Distribution of Linear Cyclic Codes over Finite Chain Ring%有限链环上循环码的深度分布
郑喜英; 常晓鹏
2012-01-01
研究有限链环R上长为n(n不整除R的剩余域(R)的特征)的循环码的深度分布.根据有限链环R上循环码的生成多项式,从差分运算的线性性质及有限链环上循环码的同构关系出发,给出了有限链环上R上长为n的循环码的深度谱.%The depth distribution of cyclic codes of length n (where n is not divisible by the characteristic of the residue field R ) over a finite chain ring R is studied. By the generator polynomial of cyclic codes over the finite chain R , in light of the linear property of difference operation and the isomorphism of cyclic codes over finite chain ring, the depth spectrum of cyclic codes of length n over a finite chain ring is given.
无
2006-01-01
This paper proposes a closed-form joint space-time channel and Direction Of Arrival (DOA) blind estimation algorithm for space-time coded Multi-Carrier Code Division Multiple Access (MC-CDMA) systems equipped with a Uniform Linear Array (ULA) at the base station in frequency-selective fading environments. The algorithm uses an ESPRIT-like method to separate multiple co-channel users with different impinging DOAs. As a result, the DOAs for multiple users are obtained. In particular, a set of signal subspaces,every one of which is spanned by the space-time vector channels of an individual user, are also obtained. From these signal subspaces, the space-time channels of multiple users are estimated using the subspace method.Computer simulations illustrate both the validity and the overall performance of the proposed scheme.
Wada, Haruna; Kitazawa, Yu; Kuroki, Shigeki; Tezuka, Yasuyuki; Yamamoto, Takuya
2015-08-18
Linear and cyclic amphiphilic block copolymers consisting of poly(ethylene oxide) (PEO) as the hydrophilic segment and poly(methyl acrylate) or poly(ethyl acrylate) as the hydrophobic segments were synthesized and self-assembled to form flower-like micelles. The micelles from linear (methyl acrylate)12(ethylene oxide)73(methyl acrylate)12 (Mn = 1000-3200-1000, l-MOM) showed a cloud point (Tc) at 46 °C by the transmittance of the micellar solution, whereas that of cyclic (methyl acrylate)30(ethylene oxide)79 (Mn = 2600-3500, c-MO) increased to 72 °C, as previously reported. DLS showed comparable diameters (l-MOM, 14 nm; c-MO, 12 nm) and Tc values (l-MOM, 48 °C; c-MO, 75 °C). For the investigation of the difference in Tc and the phase transition mechanism based on the polymer topology, NMR relaxometry was performed to determine the spin-lattice (T1) and spin-spin (T2) relaxation times. A decrease in T2 of the PEO segment in both l-MOM and c-MO was observed above Tc, suggesting that slow large-scale motions, such as the detachment of a chain end from the core, bridging, and interpenetration of the micelles, were inhibited. T1 of the PEO segment in l-MOM continuously increased in the experimental temperature range, indicating that the segment is hydrated even above its Tc. On the other hand, that of c-MO reached a ceiling above its Tc, likely due to the prevention of the rotation of the PEO main chain bonds caused by dehydration. Similar results were obtained for linear (ethyl acrylate)8(ethylene oxide)79(ethyl acrylate)8 (Mn = 800-3500-800, l-EOE) and its cyclic (ethyl acrylate)15(ethylene oxide)78 (Mn = 1500-3400, c-EO).
Kuwabara, T. [Institute of Materials and Systems for Sustainability, Nagoya University, Nagoya (Japan); Tanaka, H.; Kobayashi, M. [National Institute for Fusion Science, Toki (Japan); SOKENDAI (The Graduate University For Advanced Studies), Toki (Japan); Kawamura, G. [National Institute for Fusion Science, Toki (Japan); Ohno, N.; Nishikata, H. [Graduate School of Engineering, Nagoya University, Nagoya (Japan); Feng, Y. [Max-Planck-Institut fuer Plasmaphysik, Euratom Association, Garching/Greifswald (Germany)
2016-08-15
We have adapted the EMC3-EIRENE code for modeling of a linear divertor plasma simulator in order to demonstrate plasma-wall interactions with three-dimensional (3D) effects. 3D distributions of hydrogen plasma and neutrals can be successfully calculated for four different types of target plates: a V-shaped target, inclined targets with open and closed structures, and a planer target. Hydrogen atoms and molecules are accumulated more effectively in the V-shaped target plate, leading to a higher electron density with lower electron temperature than the planar target plate. (copyright 2016 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)
Decoding Performance Analysis and DSP Optimization for Block Turbo Code%分组Turbo码的译码性能分析及DSP优化
张守柱; 李青; 崔慧娟; 唐昆
2012-01-01
Based on the classic decoding algorithm of Block Turbo Code(BTC), the relationship between decoding parameters and decoding complexity, and the impact of different parameters on performance, are analyzed. Taking a kind of (15, 1 l)x(13, 9) BTC for example, the software implementation scheme on C55 series Digital Signal Processor(DSP) is presented considering the compromise between performance and complexity. The optimization is done through different levels such as fix-point processing, compiler options, high-level language and assembly language. Computational complexity has 89% reduction after optimization.%基于分组Turbo码的经典译码算法,分析译码参数与译码复杂度的关系及其对译码性能的影响,以一种(15,11)x(13,9)分组Turbo码为例,在权衡复杂度与性能的前提下,给出其在C55系列数字信号处理器(DSP)上的软件实现方案,并从定点化、编译选项、高级语言与汇编语言多个层面对译码算法进行优化,使译码运算量较未优化时降低89％.
Jönsson, Jeppe
2015-01-01
Block tearing is considered in several codes as a pure block tension or a pure block shear failure mechanism. However in many situations the load acts eccentrically and involves the transfer of a substantial moment in combination with the shear force and perhaps a normal force. A literature study...... yield lines around the block leads to simple interaction formulas similar to other interaction formulas in the codes.......Block tearing is considered in several codes as a pure block tension or a pure block shear failure mechanism. However in many situations the load acts eccentrically and involves the transfer of a substantial moment in combination with the shear force and perhaps a normal force. A literature study...
Deblurring of QR Code Images by Linear CNN%线性CNN用于QR码图像去模糊化处理
刘砚一; 胡洁; 刘红英
2012-01-01
摘要在物联网时代中,QR码的应用非常广泛,QR码图像的去模糊研究具有重要的实际意义.细胞神经网络(CNN)以其高速并行处理、二值输入输出、便于电路实现等特性,在图像处理中有着广泛的应用,文章在分析了图像去模糊化理论基础上,采用线性CNN构造图像的去模糊化模型,实现了模糊图像的恢复.通过实验比较,在相同参数条件下,线性CNN去模糊化模型对含噪模糊图像的恢复效果更好,鲁棒性更高.%In the periods of the Internet of things, the applications of QR code are extensive. The researches about deblurring of QR code images are important. The CNN used in images processing with its superior characteristic in high speed parallel processing; binary inputs and outputs and suitable for on-chip implementations. In this paper, we used linear CNN system to construct the delurring module to recover the degraded images. With comparing the results of experiment, the module of linear CNN get the better result for including noise degraded images.
Daniel J Tollin
2014-12-01
Full Text Available The interaural level difference (ILD cue to sound location is first encoded in the lateral superior olive (LSO. ILD sensitivity results because the LSO receives excitatory input from the ipsilateral cochlear nucleus and inhibitory input indirectly from the contralateral cochlear nucleus via glycinergic neurons of the ipsilateral medial nucleus of the trapezoid body (MNTB. It is hypothesized that in order for LSO neurons to encode ILDs, the sound spectra at both ears must be accurately encoded via spike rate by their afferents. This spectral-coding hypothesis has not been directly tested in MNTB, likely because MNTB neurons have been mostly described and studied recently in regards to their abilities to encode temporal aspects of sounds, not spectral. Here, we test the hypothesis that MNTB neurons and their inputs from the cochlear nucleus and auditory nerve code sound spectra via discharge rate. The Random Spectral Shape method was used to estimate how the levels of 100-ms duration spectrally stationary stimuli were weighted, both linearly and non- linearly, across a wide band of frequencies. In general, MNTB neurons and their globular bushy cell inputs, were found to be well-modeled by a linear weighting of spectra demonstrating that the pathways through the MNTB can accurately encode sound spectra including those resulting from the acoustical cues to sound location provided by head-related directional transfer functions. Together with the anatomical and biophysical specializations for timing in the MNTB-LSO complex, these mechanisms may allow ILDs to be computed for complex stimuli with rapid spectrotemporally-modulated envelopes such as speech and animal vocalizations and moving sound sources.
A Zinc(Ⅱ) Coordination Polymer Possessing a Linear Trinuclear Building Block[Zn3(CO2)6N2
JIANG Ya-Qi; LI Fang-Fang; XIE Zhao-Xiong
2008-01-01
A new coordination polymer[Zn3(bpda)3(bpy)]1(H2bpda=2,2'-biphenyldicarboxylic acid,bpy=4,4'-bipyridien)has been hydrothermally synthesized and characterized by single-crystal X-ray diffraction analysis,elemental analysis,TG analysis and IR spectrum.1 Crystallizes in cubic crystal system,space group Ia-3,with a=20.9687(9) A,V=9219.7(3)A3,Z=8,and R (Ⅰ＞2σ(Ⅰ))=0.0431.Complex 1 is a three-dimensional framework involving a new building block,linear trinuclear {Zn3(CO2)6N2} cluster.In the structure,each bpda coordinates to four zinc atoms via its two bridging bidentate carboxylate groups.To the best of our knowledge,1 implies a new coordination mode of 2,2'-biphenyldicarboxylic acid. The solid state fluorescent spectra show a strong emission peak at 451 nm(λex=341 nm).
MacWillia ms Identities of Linear Codes Over Ring R+vR+v2R%环R＋vR＋v2 R上线性码的Mac Wi lli ams恒等式
朱士信; 黄磊
2016-01-01
By constructing gray map,linear codes over ring R+vR+v2 R are studied.The Lee weight and several clas-ses of weight enumerators about linear codes over ring R+vR+v2 R are defined,the MacWilliams identities of weight distri-butions between the linear codes and their dual codes over ring R+vR+v2 R are given.According to these identities,we can get the weight distributions of dual codes directly without obtaining the dual codes of linear codes over ring R+vR+v2 R.%通过构造Gray映射，对环R＋vR＋v2 R上线性码进行了研究。定义了环R＋vR＋v2 R上线性码的Lee重量及其几类重量计数器，给出了环R＋vR＋v2 R上线性码及其对偶码之间的各种重量分布的MacWilliams恒等式。利用这些恒等式，不用求出环R＋vR＋v2 R上线性码的对偶码便可得到对偶码的各种重量分布。
旋转星座准正交空时分组码的改进性研究%Study of improved constellation rotated quasi-orthogonal space-time block code
周尧; 李建海; 李克志
2013-01-01
当发射天线数大于2时,复信号空时分组码不能实现满速率编码,可以通过星座旋转来设计发送矩阵,使系统同时获得满分集增益和最大的编码速率.通过对传统的旋转星座准正交空时分组码加以改进,使每根天线在不同时隙发射的信号属于不同星座,在保证满分集和最大的编码速率的同时,减小了码间干扰,更有利于译码器译码,提高了系统性能.%While space-time block code with complex signals can not provide full coding rate when the transmit antennas are more than two, the transmission matrix designed through constellation rotation can obtain maximum coding rate and full diversity gain in the meantime. The improved constellation rotated quasi-orthogonal space-time block code in this paper, whose signals transmitted by every antenna in different time belong to different constellations, improves the performance of the system with reducing inter-symbol interference and being advantageous to decode, when assuring maximum coding rate and full diversity gain.
Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes
Fong, Wai Han
2011-01-01
In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single burst correction (SBC), is shown to be the Abramson bound when the cyclic burst length is less than half the block length. The second MPBC bound is developed without the minimum error free gap constraint and is used as a comparison to the first bound.
Sundararajan, Jay Kumar; Médard, Muriel
2008-01-01
A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with link-by-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion of a node "seeing" a packet is introduced. In terms of this idea, our algorithm may be viewed as a natural extension of ARQ schemes to coded networks. Our approach, known as the drop-when-seen algorithm, is compared with a baseline queuing approach called drop-when-decoded. It is shown that the expected queue size for our approach is $O(\\frac1{1-\\rho})$ as opposed to $\\Omega(\\frac1{(1-\\rho)^2})$ for the baseline approach...
Delbecq, J.M
1999-07-01
The Aster code is a 2D or 3D finite-element calculation code for structures developed by the R and D direction of Electricite de France (EdF). This dossier presents a complete overview of the characteristics and uses of the Aster code: introduction of version 4; the context of Aster (organisation of the code development, versions, systems and interfaces, development tools, quality assurance, independent validation); static mechanics (linear thermo-elasticity, Euler buckling, cables, Zarka-Casier method); non-linear mechanics (materials behaviour, big deformations, specific loads, unloading and loss of load proportionality indicators, global algorithm, contact and friction); rupture mechanics (G energy restitution level, restitution level in thermo-elasto-plasticity, 3D local energy restitution level, KI and KII stress intensity factors, calculation of limit loads for structures), specific treatments (fatigue, rupture, wear, error estimation); meshes and models (mesh generation, modeling, loads and boundary conditions, links between different modeling processes, resolution of linear systems, display of results etc..); vibration mechanics (modal and harmonic analysis, dynamics with shocks, direct transient dynamics, seismic analysis and aleatory dynamics, non-linear dynamics, dynamical sub-structuring); fluid-structure interactions (internal acoustics, mass, rigidity and damping); linear and non-linear thermal analysis; steels and metal industry (structure transformations); coupled problems (internal chaining, internal thermo-hydro-mechanical coupling, chaining with other codes); products and services. (J.S.)
Space Time Codes from Permutation Codes
Henkel, Oliver
2006-01-01
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths, a result that has been conjectured already in previous work. Further, the connection to permutation codes allows for moderate complex en-/decoding algorithms.
Full-Diversity Space-Time Error Correcting Codes with Low-Complexity Receivers
Hassan MohamadSayed
2011-01-01
Full Text Available We propose an explicit construction of full-diversity space-time block codes, under the constraint of an error correction capability. Furthermore, these codes are constructed in order to be suitable for a serial concatenation with an outer linear forward error correcting (FEC code. We apply the binary rank criterion, and we use the threaded layering technique and an inner linear FEC code to define a space-time error-correcting code. When serially concatenated with an outer linear FEC code, a product code can be built at the receiver, and adapted iterative receiver structures can be applied. An optimized hybrid structure mixing MMSE turbo equalization and turbo product code decoding is proposed. It yields reduced complexity and enhanced performance compared to previous existing structures.
Product Codes for Optical Communication
Andersen, Jakob Dahl
2002-01-01
Many optical communicaton systems might benefit from forward-error-correction. We present a hard-decision decoding algorithm for the "Block Turbo Codes", suitable for optical communication, which makes this coding-scheme an alternative to Reed-Solomon codes.......Many optical communicaton systems might benefit from forward-error-correction. We present a hard-decision decoding algorithm for the "Block Turbo Codes", suitable for optical communication, which makes this coding-scheme an alternative to Reed-Solomon codes....
Laurent, Oscar; Zeh, Armin
2015-11-01
Combined U-Pb and Lu-Hf isotope data from zircon populations are widely used to constrain Hadean-Archean crustal evolution. Linear Hf isotope-age arrays are interpreted to reflect the protracted, internal reworking of crust derived from the (depleted) mantle during a short-lived magmatic event, and related 176Lu/177Hf ratios are used to constrain the composition of the reworked crustal reservoir. Results of this study, however, indicate that Hf isotope-age arrays can also result from complex geodynamic processes and crust-mantle interactions, as shown by U-Pb and Lu-Hf isotope analyses of zircons from well characterized granitoids of the Pietersburg Block (PB), northern Kaapvaal Craton (South Africa). Apart from scarce remnants of Paleoarchean crust, most granitoids of the PB with ages between 2.94 and 2.05 Ga (n = 32) define a straight Hf isotope-age array with low 176Lu/177Hf of 0.0022, although they show a wide compositional range, were derived from various sources and emplaced successively in different geodynamic settings. The crustal evolution occurred in five stages: (I) predominately mafic crust formation in an intra-oceanic environment (3.4-3.0 Ga); (II) voluminous TTG crust formation in an early accretionary orogen (3.0-2.92 Ga); (III) internal TTG crust reworking and subduction of TTG-derived sediments in an Andean-type setting (2.89-2.75 Ga); (IV) (post-)collisional high-K magmatism from both mantle and crustal sources (2.71-2.67 Ga); and (V) alkaline magmatism in an intra-cratonic environment (2.05-2.03 Ga). The inferred array results from voluminous TTG crust formation during stage II, and involvement of this crust during all subsequent stages by two different processes: (i) internal crust reworking through both partial melting and assimilation at 2.89-2.75 Ga, leading to the formation of biotite granites coeval with minor TTGs, and (ii) subduction of TTG-derived sediments underneath the PB, causing enrichment of the mantle that subsequently became
Lavrov, Dennis V; Pett, Walker; Voigt, Oliver; Wörheide, Gert; Forget, Lise; Lang, B Franz; Kayal, Ehsan
2013-04-01
Sponges (phylum Porifera) are a large and ancient group of morphologically simple but ecologically important aquatic animals. Although their body plan and lifestyle are relatively uniform, sponges show extensive molecular and genetic diversity. In particular, mitochondrial genomes from three of the four previously studied classes of Porifera (Demospongiae, Hexactinellida, and Homoscleromorpha) have distinct gene contents, genome organizations, and evolutionary rates. Here, we report the mitochondrial genome of Clathrina clathrus (Calcinea, Clathrinidae), a representative of the fourth poriferan class, the Calcarea, which proves to be the most unusual. Clathrina clathrus mitochondrial DNA (mtDNA) consists of six linear chromosomes 7.6-9.4 kb in size and encodes at least 37 genes: 13 protein codings, 2 ribosomal RNAs (rRNAs), and 24 transfer RNAs (tRNAs). Protein genes include atp9, which has now been found in all major sponge lineages, but no atp8. Our analyses further reveal the presence of a novel genetic code that involves unique reassignments of the UAG codons from termination to tyrosine and of the CGN codons from arginine to glycine. Clathrina clathrus mitochondrial rRNAs are encoded in three (srRNA) and ≥6 (lrRNA) fragments distributed out of order and on several chromosomes. The encoded tRNAs contain multiple mismatches in the aminoacyl acceptor stems that are repaired posttranscriptionally by 3'-end RNA editing. Although our analysis does not resolve the phylogenetic position of calcareous sponges, likely due to their high rates of mitochondrial sequence evolution, it confirms mtDNA as a promising marker for population studies in this group. The combination of unusual mitochondrial features in C. clathrus redefines the extremes of mtDNA evolution in animals and further argues against the idea of a "typical animal mtDNA."
Sørensen, Jesper Hemming; Koike-Akino, Toshiaki; Orlik, Philip
2012-01-01
This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both...... the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding....
Kirtman, Bernard; Springborg, Michael; Rérat, Michel; Ferrero, Mauro; Lacivita, Valentina; Orlando, Roberto; Dovesi, Roberto
2015-01-01
An implementation of the vector potential approach (VPA) for treating the response of infinite periodic systems to static and dynamic electric fields has been initiated within the CRYSTAL code. The VPA method is based on the solution of a time-dependent Hartree-Fock or Kohn-Sham equation for the crystal orbitals wherein the usual scalar potential, that describes interaction with the field, is replaced by the vector potential. This equation may be solved either by perturbation theory or by finite field methods. With some modification all the computational procedures of molecular ab initio quantum chemistry can be adapted for periodic systems. Accessible properties include the linear and nonlinear responses of both the nuclei and the electrons. The programming of static field pure electronic (hyper)polarizabilities has been successfully tested. Dynamic electronic (hyper)polarizabilities, as well as infrared and Raman intensities, are in progress while the addition of finite fields for calculation of vibrational (hyper)polarizabilities, through nuclear relaxation procedures, will begin shortly.
环F2+vF2上线性码的深度谱%ON THE DEPTH SPECTRA OF LINEAR CODES ON RING F2 + vF2
唐刚
2012-01-01
In this paper, the depth distribution and the depth spectra of linear codes over ring R = F2 + νF2 are studied. By using two homomorphisms of Abelian groups from R to F2 and the generator matrices of the codes over R, the upper bound and lower bound of the depth spectra of linear codes of type 4k12k22k3 are obtained.%本文研究了环R=F2+vF2上线性码的深度分布和深度谱.利用环R到F2加群的两个同态映射及R上线性码的生成矩阵,给出了环R上4k12k22k3型线性码的深度谱的上下界.
Depth distributionthe of linear codes over ring F2+uF2+U2F2.%环F2+uF2+u2F2上线性码的深度分布
梁华
2011-01-01
记R=F2+uF2+u2F2,定义了环R上码字的深度以及R上线性码的深度分布,研究了环R上码字深度的性质,给出了计算环R上码字深度的递归算法.利用环R上的线性码C及其生成矩阵,得到了域F2上的线性码C1,Cu,Cu2及相应的生成矩阵.通过域F2上的线性码C1,Cu,Cu2之间的关系,讨论了环R上的线性码的深度谱和深度分布,进而得到R上一类线性码的深度分布.%LetR=F2+uF2+u2+u2F2 ,the depth of a codeword and the depth distribution of linear codes over ring R are defined,a number of properties of the depth of codewords are studied, and the recursive algorithm for computing the depth of a codeword is given. Based on the linear codes over R and their generator matrices, the linear codes C1, Cu, Cu2 over F2 and their generator matrices are obtained. By using the relationship of C1, Cu, Cu2, the depth distribution and the depth spectrum of linear codes over R are discussed,moreover the depth distribution of a class of linear code over R is showed.
Improved Algorithm for Mixed Excitation Linear Prediction Coding%改进的混合激励线性预测编码算法
朱宗明; 姜占才
2015-01-01
针对混合激励线性预测编码中子带声音强度的硬判决导致激励源欠精细问题，将子带声音强度视为5维的模糊特征矢量，用改进的LBG算法设计码本并用5bit对其作矢量量化；以精细量化的子带声音强度调制带通滤波器，以此获取精细的混合激励信号，最终达到改善合成语音质量的目标。仿真实验表明：改进算法能有效地改善合成语音的自然度。%As modulating signal of ifve passband band-pass iflter, subband voiced intensity vector which determines the quality of synthetic speech directly, is the key to acquire accurate mixed excitation signal. In the scheme of mixed excitation linear prediction coding (MELP), for the defects of excitation source which lacks accurate caused by hard decision that subband sound intensity is either 0 or 1, subband voiced intensity is seen as 5-dimension obscure eigenvector;subband voiced intensity codebook is designed using modiifed LBG algorithm and subband voiced intensity is quantized using 5-bit vector;ifve passband band-pass iflter is modulated using accurate and quantized subband voiced intensity, thus acquiring accurate mixed excitation signal;ifnally the quality of synthetic speech is improved. Simulation experiments show that modiifed algorithm not only can improve the naturalness of synthetic speech, but also has stronger robustness for background noise.
2016-01-01
Poly(dimethylsiloxane-ethylene oxide) (PDMS-PEO) and poly(butadiene-b-ethylene oxide) (PBd-PEO) are two block copolymers which separately form vesicles with disparate membrane permeabilities and fluidities. Thus, hybrid vesicles formed from both PDMS-PEO and PBd-PEO may ultimately allow for systematic, application-specific tuning of vesicle membrane fluidity and permeability. However, given the relatively low strength previously noted for comb-type PDMS-PEO vesicles, the mechanical robustness...
Tong F; Tang XY; Li X.; Xia WQ; Liu DJ
2016-01-01
Fei Tong, Xiangyuan Tang, Xin Li, Wenquan Xia, Daojun Liu Department of Chemistry, Medical College, Shantou University, Shantou, People’s Republic of China Abstract: The aim of this study was to observe the therapeutic effect of insulin-loaded linear poly(ethylene glycol)-brush-like poly(L-lysine) block copolymer poly(ethylene glycol)-b-(poly(ethylenediamine L-glutamate)-g-poly(L-lysine)) (PEG-b-(PELG-g-PLL) on renal ischemia/reperfusion-induced lung injury through downregulating ...
Bakhtavar, E.
2015-09-01
In this study, transition from open pit to block caving has been considered as a challenging problem. For this purpose, the linear integer programing code of Matlab was initially developed on the basis of the binary integer model proposed by Bakhtavar et al (2012). Then a program based on graphical user interface (GUI) was set up and named "Op-Ug TD Optimizer". It is a beneficial tool for simple application of the model in all situations where open pit is considered together with block caving method for mining an ore deposit. Finally, Op-Ug TD Optimizer has been explained step by step through solving the transition from open pit to block caving problem of a case ore deposit. W pracy tej rozważano skomplikowane zagadnienie przejścia od wybierania odkrywkowego do komorowego. W tym celu opracowano kod programowania liniowego w środowisku MATLAB w oparciu o model liczb binarnych zaproponowany przez Bakhtavara (2012). Następnie opracowano program z wykorzystujący graficzny interfejs użytkownika o nazwie Optymalizator Op-Ug TD. Jest to niezwykle cenne narzędzie umożliwiające stosowanie modelu dla wszystkich warunków w sytuacjach gdy rozważamy prowadzenie wydobycia metodą odkrywkową oraz wydobycie komorowe przy eksploatacji złóż rud żelaza. W końcowej części pracy podano szczegółową instrukcję stosowanie programu Optymalizator na przedstawionym przykładzie przejścia od wydobycia rud żelaza metodami odkrywkowymi poprzez wydobycie komorami.
Reed-Solomon convolutional codes
Gluesing-Luerssen, H; Schmale, W
2005-01-01
In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.
New multilevel codes over GF(q)
Wu, Jiantian; Costello, Daniel J., Jr.
1992-01-01
Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.
Boudesocque-Dubois, C.; Clarisse, J.M
2007-07-01
In the context of linear perturbation computations of planar or spherically symmetric flows, we propose numerical methods, in Lagrangian coordinates, for integrating the one-dimensional gas dynamics equations with nonlinear heat conduction and their linear perturbations. Numerical results are presented for different configurations, with or without flow motion. (authors)
一种低复杂度的空时分组码检测算法%Low Complexity Detection Algorithm for Space-time Block Coding
张建忠; 李宏伟; 邓冬虎
2011-01-01
空时分组码能够提供分集和编码增益,但所用的ML译码算法计算量太大,不能满足高速实时通信系统的要求.为了有效地降低译码复杂度,提出了一种新的检测算法,该算法通过对系统模型进行变换,利用等效的信道响应矩阵的QR分解来进行译码,从而避免了对所有的调制信号进行穷举搜索的过程,使计算复杂度有了很大降低,而且新算法的误码率性能与ML算法近乎相同.最后,通过仿真验证了所提算法的有效性和实用性.%STBC can provide the diversity and coding gains. However, the conventional ML decoding algorithm has expensive computational complexity, which the need of high-velocity and real-time communication systems can not be satified. In order to reduce effectively decoding complexity, a new detection algorithm is proposed. The new algorithm uses the QR decomposition of the equivalent channel matrix to decode via transforming the system model. An exhaustive search over the signal modulation constellation for decoding can be avoided and greafiy decoding complexity are reduced, moreover, the error code ratio performance of the new algorithm is almost absolute sameness with ML decoding algorithm. Finally, the results with simulation validate the validity and practicability of the proposed algorithm.
宋贤梅; 熊蕾
2016-01-01
考虑环 R ＝Z2a ＋uZ2a上的线性码，其中 u2＝u。研究了环 R 上线性码的完全 Gray 权估计的 MacWilliams 恒等式。给出了环 R 上的自对偶码的生成矩阵及环 Z23＋uZ23上长为偶数 n 的自对偶码的数量公式。讨论了环 R上的挠码，得到挠码的生成矩阵及挠码与剩余码的关系。%The linear codes over R =Z2a +uZ2a with u2 =u are discussed.MacWilliams identity for the complete Gray weight enumerator is investigated firstly.Then,the generator matrices of self-dual codes over R and the number of dis-tinct self-dual codes of even length n over Z23 +uZ23 are given.The torsion codes over R are discussed and the genera-tor matrices of torsion codes and the relationship between the torsion codes and the residue codes are also obtained.
A three-dimensional magnetostatics computer code for insertion devices.
Chubar, O; Elleaume, P; Chavanne, J
1998-05-01
RADIA is a three-dimensional magnetostatics computer code optimized for the design of undulators and wigglers. It solves boundary magnetostatics problems with magnetized and current-carrying volumes using the boundary integral approach. The magnetized volumes can be arbitrary polyhedrons with non-linear (iron) or linear anisotropic (permanent magnet) characteristics. The current-carrying elements can be straight or curved blocks with rectangular cross sections. Boundary conditions are simulated by the technique of mirroring. Analytical formulae used for the computation of the field produced by a magnetized volume of a polyhedron shape are detailed. The RADIA code is written in object-oriented C++ and interfaced to Mathematica [Mathematica is a registered trademark of Wolfram Research, Inc.]. The code outperforms currently available finite-element packages with respect to the CPU time of the solver and accuracy of the field integral estimations. An application of the code to the case of a wedge-pole undulator is presented.
Study on Accelerating Random Linear Network Coding on Graphics Processors Units%GPU加速随机线性网络编码的研究
潘晓辉
2012-01-01
网络编码近年来被广泛用于各种分布式系统以提高吞吐量,并且能在网络发生动态变化时的数据传输提供弹性.但是,网络编码引起的大量的额外计算量和编码时间成为了实际应用的障碍.在这个研究中,我们使用GPU的强大计算能力来加速网络编码.通过将大量可并行的计算安排到GPU上执行,有效地缩短了网络编码所需要的时间,为网络编码的实际应用提供了帮助.%Network coding has recently been widely applied in various distributed systems for throughput improvement and/or resilience to network dynamics. However, the computational overhead introduced by network coding operations is not negligible and has become the obstacle for practical deployment of network coding. In this study, we exploit the computing power of commodity many-core Graphic Processing Units (GPUs) and multi-core CPUs to accelerate the network coding operations. With the implementation of the algorithms, it is able to achieve significant encoding and decoding throughput, providing a solution for the practical use of network coding.
On Asymmetric Quantum MDS Codes
Ezerman, Martianus Frederic; Ling, San
2010-01-01
Assuming the validity of the MDS Conjecture, the weight distribution of all MDS codes is known. Using a recently-established characterization of asymmetric quantum error-correcting codes, linear MDS codes can be used to construct asymmetric quantum MDS codes with $d_{z} \\geq d_{x}\\geq 2$ for all possible values of length $n$ for which linear MDS codes over $\\F_{q}$ are known to exist.
MMSE Optimal Algebraic Space-Time Codes
Rajan, G Susinder
2007-01-01
Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs becomes prohibitive large as the number of transmit and receive antennas increase. Hence it is natural to resort to a suboptimal reception technique like linear Minimum Mean Squared Error (MMSE) receiver. Barbarossa et al and Liu et al have independently derived necessary and sufficient conditions for a full rate linear STBC to be MMSE optimal, i.e achieve least Symbol Error Rate (SER). Motivated by this problem, certain existing high rate STBC constructions from crossed product algebras are identified to be MMSE optimal. Also, it is shown that a certain class of codes from cyclic division algebras which are special cases of crossed product algebras are MMSE optimal. Hence, these STBCs achieve least SER when MMSE reception is employed and are fully diverse when ML reception is employed.
Weng, Yi; He, Xuan; Wang, Junyi; Pan, Zhongqi
2017-01-01
Spatial-division multiplexing (SDM) techniques have been purposed to increase the capacity of optical fiber transmission links by utilizing multicore fibers or few-mode fibers (FMF). The most challenging impairments of SDMbased long-haul optical links mainly include modal dispersion and mode-dependent loss (MDL), whereas MDL arises from inline component imperfections, and breaks modal orthogonality thus degrading the capacity of multiple-inputmultiple- output (MIMO) receivers. To reduce MDL, optical approaches include mode scramblers and specialty fiber designs, yet these methods were burdened with high cost, yet cannot completely remove the accumulated MDL in the link. Besides, space-time trellis codes (STTC) were purposed to lessen MDL, but suffered from high complexity. In this work, we investigated the performance of space-time block-coding (STBC) scheme to mitigate MDL in SDM-based optical communication by exploiting space and delay diversity, whereas weight matrices of frequency-domain equalization (FDE) were updated heuristically using decision-directed recursive-least-squares (RLS) algorithm for convergence and channel estimation. The STBC was evaluated in a six-mode multiplexed system over 30-km FMF via 6×6 MIMO FDE, with modal gain offset 3 dB, core refractive index 1.49, numerical aperture 0.5. Results show that optical-signal-to-noise ratio (OSNR) tolerance can be improved via STBC by approximately 3.1, 4.9, 7.8 dB for QPSK, 16- and 64-QAM with respective bit-error-rates (BER) and minimum-mean-square-error (MMSE). Besides, we also evaluate the complexity optimization of STBC decoding scheme with zero-forcing decision feedback (ZFDF) equalizer by shortening the coding slot length, which is robust to frequency-selective fading channels, and can be scaled up for SDM systems with more dynamic channels.
Alderson, Tim L.; Svenja Huntemann
2013-01-01
Singleton-type upper bounds on the minimum Lee distance of general (not necessarily linear) Lee codes over ℤq are discussed. Two bounds known for linear codes are shown to also hold in the general case, and several new bounds are established. Codes meeting these bounds are investigated and in some cases characterised.
Penna, Rodrigo [UNI-BH, Belo Horizonte, MG (Brazil). Dept. de Ciencias Biologicas, Ambientais e da Saude (DCBAS/DCET); Silva, Clemente Jose Gusmao Carneiro da [Universidade Estadual de Santa Cruz, UESC, Ilheus, BA (Brazil); Gomes, Paulo Mauricio Costa [Universidade FUMEC, Belo Horizonte, MG (Brazil)
2008-07-01
Viability of building a nuclear wood densimeter based on low energy photons Compton scattering was done using Monte Carlo code (MCNP- 4C). It is simulated a collimated 60 keV beam of gamma rays emitted by {sup 241}Am source reaching wood blocks. Backscattered radiation by these blocks was calculated. Photons scattered were correlated with blocks of different wood densities. Results showed a linear relationship on wood density and scattered photons, therefore the viability of this wood densimeter. (author)
Smith, Martin H.
1992-01-01
Describes an educational game called "Population Blocks" that is designed to illustrate the concept of exponential growth of the human population and some potential effects of overpopulation. The game material consists of wooden blocks; 18 blocks are painted green (representing land), 7 are painted blue (representing water); and the remaining…
Smith, Martin H.
1992-01-01
Describes an educational game called "Population Blocks" that is designed to illustrate the concept of exponential growth of the human population and some potential effects of overpopulation. The game material consists of wooden blocks; 18 blocks are painted green (representing land), 7 are painted blue (representing water); and the remaining…
Mukhopadhyay, A. K.
1975-01-01
Linear frequency domain methods are inadequate in analyzing the 1975 Viking Orbiter (VO75) digital tape recorder servo due to dominant nonlinear effects such as servo signal limiting, unidirectional servo control, and static/dynamic Coulomb friction. The frequency loop (speed control) servo of the VO75 tape recorder is used to illustrate the analytical tools and methodology of system redundancy elimination and high order transfer function verification. The paper compares time-domain performance parameters derived from a series of nonlinear time responses with the available experimental data in order to select the best possible analytical transfer function representation of the tape transport (mechanical segment of the tape recorder) from several possible candidates. The study also shows how an analytical time-response simulation taking into account most system nonlinearities can pinpoint system redundancy and overdesign stemming from a strictly empirical design approach. System order reduction is achieved through truncation of individual transfer functions and elimination of redundant blocks.
Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.
1982-01-01
The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.
Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.
1982-01-01
The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.
Algebraic geometric codes with applications
CHEN Hao
2007-01-01
The theory of linear error-correcting codes from algebraic geomet-ric curves (algebraic geometric (AG) codes or geometric Goppa codes) has been well-developed since the work of Goppa and Tsfasman, Vladut, and Zink in 1981-1982. In this paper we introduce to readers some recent progress in algebraic geometric codes and their applications in quantum error-correcting codes, secure multi-party computation and the construction of good binary codes.
Lim, Sung Hoon; Gamal, Abbas El; Chung, Sae-Young
2010-01-01
A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to general discrete memoryless and Gaussian networks. The scheme also recovers as special cases the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi, and Effros. The scheme involves message repetition coding, relay signal compression, and simultaneous decoding. Unlike previous compress--forward schemes, where independent messages are sent over multiple blocks, the same message is sent multiple times using independent codebooks as in the network coding scheme for cyclic networks. Furthermore, the relays do not use Wyner--Ziv binning as in previous compress-forward sch...
Christopher M. Bentz
2014-03-01
Full Text Available We compare optical time domain reflectometry (OTDR techniques based on conventional single impulse, coding and linear frequency chirps concerning their signal to noise ratio (SNR enhancements by measurements in a passive optical network (PON with a maximum one-way attenuation of 36.6 dB. A total of six subscribers, each represented by a unique mirror pair with narrow reflection bandwidths, are installed within a distance of 14 m. The spatial resolution of the OTDR set-up is 3.0 m.
Christin E Burd
2010-12-01
Full Text Available Human genome-wide association studies have linked single nucleotide polymorphisms (SNPs on chromosome 9p21.3 near the INK4/ARF (CDKN2a/b locus with susceptibility to atherosclerotic vascular disease (ASVD. Although this locus encodes three well-characterized tumor suppressors, p16(INK4a, p15(INK4b, and ARF, the SNPs most strongly associated with ASVD are ∼120 kb from the nearest coding gene within a long non-coding RNA (ncRNA known as ANRIL (CDKN2BAS. While individuals homozygous for the atherosclerotic risk allele show decreased expression of ANRIL and the coding INK4/ARF transcripts, the mechanism by which such distant genetic variants influence INK4/ARF expression is unknown. Here, using rapid amplification of cDNA ends (RACE and analysis of next-generation RNA sequencing datasets, we determined the structure and abundance of multiple ANRIL species. Each of these species was present at very low copy numbers in primary and cultured cells; however, only the expression of ANRIL isoforms containing exons proximal to the INK4/ARF locus correlated with the ASVD risk alleles. Surprisingly, RACE also identified transcripts containing non-colinear ANRIL exonic sequences, whose expression also correlated with genotype and INK4/ARF expression. These non-polyadenylated RNAs resisted RNAse R digestion and could be PCR amplified using outward-facing primers, suggesting they represent circular RNA structures that could arise from by-products of mRNA splicing. Next-generation DNA sequencing and splice prediction algorithms identified polymorphisms within the ASVD risk interval that may regulate ANRIL splicing and circular ANRIL (cANRIL production. These results identify novel circular RNA products emanating from the ANRIL locus and suggest causal variants at 9p21.3 regulate INK4/ARF expression and ASVD risk by modulating ANRIL expression and/or structure.
多源线性网络编码的同态签名算法%Homomorphic Signature Algorithm for Multi-source Linear Network Coding
牛淑芬; 王彩芬
2012-01-01
网络编码易遭受污染攻击,但传统的签名技术不适用于多源网络编码.为此,基于同态函数,使用双线性对技术,提出一种可抵御污染攻击的多源线性网络编码签名算法,其中,每个源节点用自己的私钥对文件签名,中间或信宿节点仅用公钥即可验证收到的签名,利用随机预言模型证明该算法能够抵抗信源节点和中间节点的攻击.%Network coding is highly susceptible to pollution attacks, which can not be prevented by using standard signature. Based on homomorphic function and bilinear pairings, an efficient signature scheme for multi-source networks coding against pollution attacks is proposed. The intermediate nodes with the corresponding public keys can verify the integrity of the received messages signed by different source nodes with private keys. Under the random oracle model, the scheme is proved to be secure against the source nodes and intermediate nodes attacks.
Nielsen, Rasmus Refslund
2002-01-01
This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed.......This paper describes an efficient decoding method for a recent construction of good linear codes as well as an extension to the construction. Furthermore, asymptotic properties and list decoding of the codes are discussed....
无
1996-01-01
@@ The Zitongdong Block (Eastern Zitong Block) is located in the northwest of the Sichuan Basin. Tectonically, it is situated in the east part of Zitong Depression, southeast of mid-Longmenshan folded and faulted belt( as shown on Fig. 8 ), covering an area of 1 730 km2. The traffic is very convenient, the No. 108 national highway passes through the north of the block. Topographically, the area belongs to low hilly land at the elevation of 500-700 m.
Codes Can Reduce Queueing Delay in Data Centers
Huang, Longbo; Zhang, Hao; Ramchandran, Kannan
2012-01-01
In this paper, we quantify how much codes can reduce the data retrieval latency in storage systems. By combining a simple linear code with a novel request scheduling algorithm, which we call Blocking-one Scheduling (BoS), we show analytically that it is possible to reduce data retrieval delay by up to 17% over currently popular replication-based strategies. Although in this work we focus on a simplified setting where the storage system stores a single content, the methodology developed can be applied to more general settings with multiple contents. The results also offer insightful guidance to the design of storage systems in data centers and content distribution networks.
Algebraic and stochastic coding theory
Kythe, Dave K
2012-01-01
Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.
A.K. Bhunia
2013-04-01
Full Text Available This paper deals with a deterministic inventory model developed for deteriorating items having two separate storage facilities (owned and rented warehouses due to limited capacity of the existing storage (owned warehouse with linear time dependent demand (increasing over a fixed finite time horizon. The model is formulated with infinite replenishment and the successive replenishment cycle lengths are in arithmetic progression. Partially backlogged shortages are allowed. The stocks of rented warehouse (RW are transported to the owned warehouse (OW in continuous release pattern. For this purpose, the model is formulated as a constrained non-linear mixed integer programming problem. For solving the problem, an advanced genetic algorithm (GA has been developed. This advanced GA is based on ranking selection, elitism, whole arithmetic crossover and non-uniform mutation dependent on the age of the population. Our objective is to determine the optimal replenishment number, lot-size of two-warehouses (OW and RW by maximizing the profit function. The model is illustrated with four numerical examples and sensitivity analyses of the optimal solution are performed with respect to different parameters.
Tong F
2016-04-01
Full Text Available Fei Tong, Xiangyuan Tang, Xin Li, Wenquan Xia, Daojun Liu Department of Chemistry, Medical College, Shantou University, Shantou, People’s Republic of China Abstract: The aim of this study was to observe the therapeutic effect of insulin-loaded linear poly(ethylene glycol-brush-like poly(L-lysine block copolymer poly(ethylene glycol-b-(poly(ethylenediamine L-glutamate-g-poly(L-lysine (PEG-b-(PELG-g-PLL on renal ischemia/reperfusion-induced lung injury through downregulating hypoxia-inducible factor (HIF as compared to free insulin. Sprague Dawley rats were pretreated with 30 U/kg insulin or insulin/PEG-b-(PELG-g-PLL complex, and then subjected to 45 minutes of ischemia and 24 hours of reperfusion. The blood and lungs were collected, the level of serum creatinine and blood urea nitrogen were measured, and the dry/wet lung ratios, the activity of superoxide dismutase and myeloperoxidase, the content of methane dicarboxylic aldehyde and tumor necrosis factor-α, and the expression of HIF-1α and vascular endothelial growth factor (VEGF were measured in pulmonary tissues. Both insulin and insulin/PEG-b-(PELG-g-PLL preconditioning improved the recovery of renal function, reduced pulmonary oxidative stress injury, restrained inflammatory damage, and downregulated the expression of HIF-1α and VEGF as compared to ischemia/reperfusion group, while insulin/PEG-b-(PELG-g-PLL significantly improved this effect. Keywords: insulin, block copolymer, RI/RILI, HIF-1α, VEGF
New code match strategy for wideband code division multiple access code tree management
无
2006-01-01
Orthogonal variable spreading factor channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. A new code match scheme for WCDMA code tree management was proposed. The code match scheme is similar to the existing crowed-first scheme. When choosing a code for a user, the code match scheme only compares the one up layer of the allocated codes, unlike the crowed-first scheme which perhaps compares all up layers. So the operation of code match scheme is simple, and the average time delay is decreased by 5.1%. The simulation results also show that the code match strategy can decrease the average code blocking probability by 8.4%.
An Asymptotic Analysis of the MIMO BC under Linear Filtering
Hunger, Raphael
2008-01-01
We investigate the MIMO broadcast channel in the high SNR regime when linear filtering is applied instead of dirty paper coding. Using a user-wise rate duality where the streams of every single user are not treated as self-interference as in the hitherto existing stream-wise rate dualities for linear filtering, we solve the weighted sum rate maximization problem of the broadcast channel in the dual multiple access channel. Thus, we can exactly quantify the asymptotic rate loss of linear filtering compared to dirty paper coding for any channel realization. Having converted the optimum covariance matrices to the broadcast channel by means of the duality, we observe that the optimal covariance matrices in the broadcast channel feature quite complicated but still closed form expressions although the respective transmit covariance matrices in the dual multiple access channel share a very simple structure. We immediately come to the conclusion that block-diagonalization is the asymptotically optimum transmit strate...
Testing algebraic geometric codes
CHEN Hao
2009-01-01
Property testing was initially studied from various motivations in 1990's.A code C (∩)GF(r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector's coordinates.The problem of testing codes was firstly studied by Blum,Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs).How to characterize locally testable codes is a complex and challenge problem.The local tests have been studied for Reed-Solomon (RS),Reed-Muller (RM),cyclic,dual of BCH and the trace subcode of algebraicgeometric codes.In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions).We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Testing algebraic geometric codes
无
2009-01-01
Property testing was initially studied from various motivations in 1990’s. A code C GF (r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector’s coordinates. The problem of testing codes was firstly studied by Blum, Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs). How to characterize locally testable codes is a complex and challenge problem. The local tests have been studied for Reed-Solomon (RS), Reed-Muller (RM), cyclic, dual of BCH and the trace subcode of algebraicgeometric codes. In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions). We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
无
1996-01-01
@@ Zitongxi Block (Western Zitong Block), is located in Zitong County, northwest of Sichuan Province (as shown on Fig. 8 ). Geologically. it is situated in the Zitong Depression, southwest of the middle Longmenshan faulted and folded belt, covering an area of 1 830 km2. Transportation is very convenient. A crisscross network of highways run through the block and the Baocheng railway is nearby. The climate is moderate. Most area belongs to hilly land with the elevation of 500-600 m.The Tongjiang River runs across the area.
Toselli, G. [ENEA, Centro Ricerche Ezio Clementel, Bologna, (Italy). Dipt. Innovazione; Mirco, A. M. [Bologna Univ., Bologna (Italy). Dipt. di Matematica
1999-07-01
In this technical report the thesis of doctor's degree in Mathematics of A.M. Mirco is reported; it has been developed at ENEA research centre 'E. Clementel' in Bologna (Italy) in the frame of a collaboration between the section MACO (Applied Physics Division - Innovation Department) of ENEA at Bologna and the Department of Mathematics of the mathematical, physical and natural sciences faculty of Bologna University. Substantially, studies and research work, developed in these last years at MACO section, are here presented; they have led to the development of a constitutive model, based on Hill potential theory, for the treatment, in plastic field, of metal material anisotropy induced by previous workings and to the construction of the corresponding FEM algorithm for the non-linear structural analysis NOSA, oriented in particular to the numerical simulation of metal forming. Subsequently, an algorithm extension (proper object of the thesis), which has given, beyond a more rigorous formalization, also significant improvements. [Italian] In questo rapporto tecnico viene riportata la tesi di laurea in matematica di A. M. Mirco, tesi svolta presso il centro ricerche E. Clementel dell'ENEA di Bologna nell'ambito di un accordo di collaborazione fra la sezione MACO (Divisione Fisica Applicata - Dipartimento di Innovazione) dell'ENEA di Bologna ed il Dipartimento di matematica della facolta' di scienze matematiche, fisiche e naturali dell'universita' degli studi di Bologna. Sostanzialmente, vengono presentati gli studi ed il lavoro di ricerca, svolti in questi ultimi anni presso la sezione MACO, che hanno portato allo sviluppo di un modello costitutivo, basato sulla teoria del potenziale di Hill, per il trattamento in campo plastico, dell'anisotropia indotta da lavorazioni precedenti per un materiale metallico ed alla costruzione del corrispondente algoritmo basato sul metodo degli elementi finiti per il codice di analisi
Tong, Fei; Tang, Xiangyuan; Li, Xin; Xia, Wenquan; Liu, Daojun
2016-01-01
The aim of this study was to observe the therapeutic effect of insulin-loaded linear poly(ethylene glycol)-brush-like poly(l-lysine) block copolymer poly(ethylene glycol)-b-(poly(ethylenediamine l-glutamate)-g-poly(l-lysine)) (PEG-b-(PELG-g-PLL) on renal ischemia/reperfusion-induced lung injury through downregulating hypoxia-inducible factor (HIF) as compared to free insulin. Sprague Dawley rats were pretreated with 30 U/kg insulin or insulin/PEG-b-(PELG-g-PLL) complex, and then subjected to 45 minutes of ischemia and 24 hours of reperfusion. The blood and lungs were collected, the level of serum creatinine and blood urea nitrogen were measured, and the dry/wet lung ratios, the activity of superoxide dismutase and myeloperoxidase, the content of methane dicarboxylic aldehyde and tumor necrosis factor-α, and the expression of HIF-1α and vascular endothelial growth factor (VEGF) were measured in pulmonary tissues. Both insulin and insulin/PEG-b-(PELG-g-PLL) preconditioning improved the recovery of renal function, reduced pulmonary oxidative stress injury, restrained inflammatory damage, and downregulated the expression of HIF-1α and VEGF as compared to ischemia/reperfusion group, while insulin/PEG-b-(PELG-g-PLL) significantly improved this effect.
Tong, Fei; Tang, Xiangyuan; Li, Xin; Xia, Wenquan; Liu, Daojun
2016-01-01
The aim of this study was to observe the therapeutic effect of insulin-loaded linear poly(ethylene glycol)-brush-like poly(l-lysine) block copolymer poly(ethylene glycol)-b-(poly(ethylenediamine l-glutamate)-g-poly(l-lysine)) (PEG-b-(PELG-g-PLL) on renal ischemia/reperfusion-induced lung injury through downregulating hypoxia-inducible factor (HIF) as compared to free insulin. Sprague Dawley rats were pretreated with 30 U/kg insulin or insulin/PEG-b-(PELG-g-PLL) complex, and then subjected to 45 minutes of ischemia and 24 hours of reperfusion. The blood and lungs were collected, the level of serum creatinine and blood urea nitrogen were measured, and the dry/wet lung ratios, the activity of superoxide dismutase and myeloperoxidase, the content of methane dicarboxylic aldehyde and tumor necrosis factor-α, and the expression of HIF-1α and vascular endothelial growth factor (VEGF) were measured in pulmonary tissues. Both insulin and insulin/PEG-b-(PELG-g-PLL) preconditioning improved the recovery of renal function, reduced pulmonary oxidative stress injury, restrained inflammatory damage, and downregulated the expression of HIF-1α and VEGF as compared to ischemia/reperfusion group, while insulin/PEG-b-(PELG-g-PLL) significantly improved this effect. PMID:27175073
钱国兵; 李立萍; 郭亨艺
2015-01-01
在现代无线通信系统中，采用正交空时分组码(STBC)的多天线发射技术是提高通信速率和可靠性，并且能够实现简单译码的关键技术。该文针对瑞利信道系统模型，提出一种适用于多入单出正交空时分组码(OSTBC)的调制识别算法。该算法通过对接收到的数据进行重排，将多入单出的系统模型转化为类似多入多出的系统模型，并且根据信源的特殊性用最大似然的思想实现调制类型的识别。仿真结果验证了所提算法的有效性。%In modern wireless communication systems, multiple-antenna-transmitting in association with Orthogonal Space-Time Block Code (OSTBC) is a key technology to improve communication rate, reliability, and decoding complexity. In this paper, a modulation identification algorithm is proposed which is well suitable for the Multiple Input Single Output (MISO)-OSTBC system. First, the MISO system is transformed into a Multiple Input Multiple Output (MIMO) system by reshaping the received data. Then, maximum likelihood based approach is used to identify the modulation. Simulations validate the effectiveness of the proposed algorithm.
无
1996-01-01
@@ Chengzikou Block is located in the north of Hekou district, Dongying City, Shandong Province, adjacent to Bohai Bay. It can be geographically divided into three units: onshore, transitional zone and offshore ultrashallow zone, totally covering an area of 470 km2. The southern onshore area is low and gentle in topography;the northern shallow sea is at water depths of 2-8 m below sea level, and the transitional zone occupies more than 60% of the whole block. The climate belongs to temperate zone with seasonal wind. Highways are welldeveloped here, and the traffic is very convenient. The Chengzikou Block is about 80 km away from Dongying City and 290 km from Jinan City in the south. The northern offshore area of the block is 160 km away from Longkou port in the east and only 38 km away in the west from Zhuangxi port.
Lossless coding using predictors and VLCs optimized for each image
Matsuda, Ichiro; Shirai, Noriyuki; Itoh, Susumu
2003-06-01
This paper proposes an efficient lossless coding scheme for still images. The scheme utilizes an adaptive prediction technique where a set of linear predictors are designed for a given image and an appropriate predictor is selected from the set block-by-block. The resulting prediction errors are encoded using context-adaptive variable-length codes (VLCs). Context modeling, or adaptive selection of VLCs, is carried out pel-by-pel and the VLC assigned to each context is designed on a probability distribution model of the prediction errors. In order to improve coding efficiency, a generalized Gaussian function is used as the model for each context. Moreover, not only the predictors but also parameters of the probability distribution models are iteratively optimized for each image so that a coding rate of the prediction errors can have a minimum. Experimental results show that the proposed coding scheme attains comparable coding performance to the state-of-the-art TMW scheme with much lower complexity in the decoding process.
无
1996-01-01
@@ Longmenshan Block is located in Jiange County of Jiangyou City in the northwest of Sichuan Basin. covering an area of 2 628 km2. Geologically, it is situated in the Mid-Longmenshan fault and fold belt, neighbouring Zitong Depression in its southeast. There are mountains surrounding its northwest , the rest area being hilly land,with the elevation of 500-700 m. The BaoCheng railway and the No. 108 highway run through the block, the traffic is very convenient.
Li, Songze; Maddah-Ali, Mohammad Ali; Avestimehr, A. Salman
2015-01-01
MapReduce is a commonly used framework for executing data-intensive jobs on distributed server clusters. We introduce a variant implementation of MapReduce, namely "Coded MapReduce", to substantially reduce the inter-server communication load for the shuffling phase of MapReduce, and thus accelerating its execution. The proposed Coded MapReduce exploits the repetitive mapping of data blocks at different servers to create coding opportunities in the shuffling phase to exchange (key,value) pair...
Rate-adaptive BCH codes for distributed source coding
Salmistraro, Matteo; Larsen, Knud J.; Forchhammer, Søren
2013-01-01
This paper considers Bose-Chaudhuri-Hocquenghem (BCH) codes for distributed source coding. A feedback channel is employed to adapt the rate of the code during the decoding process. The focus is on codes with short block lengths for independently coding a binary source X and decoding it given its...... strategies for improving the reliability of the decoded result are analyzed, and methods for estimating the performance are proposed. In the analysis, noiseless feedback and noiseless communication are assumed. Simulation results show that rate-adaptive BCH codes achieve better performance than low...... correlated side information Y. The proposed codes have been analyzed in a high-correlation scenario, where the marginal probability of each symbol, Xi in X, given Y is highly skewed (unbalanced). Rate-adaptive BCH codes are presented and applied to distributed source coding. Adaptive and fixed checking...
New multi-level codes over GF(q)
Wu, Jiantian; Costello, Daniel J., Jr.
1990-01-01
Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.
Multicarrier Block-Spread CDMA for Broadband Cellular Downlink
Leus Geert
2004-01-01
Full Text Available Effective suppression of multiuser interference (MUI and mitigation of frequency-selective fading effects within the complexity constraints of the mobile constitute major challenges for broadband cellular downlink transceiver design. Existing wideband direct-sequence (DS code division multiple access (CDMA transceivers suppress MUI statistically by restoring the orthogonality among users at the receiver. However, they call for receive diversity and multichannel equalization to improve the fading effects caused by deep channel fades. Relying on redundant block spreading and linear precoding, we design a so-called multicarrier block-spread- (MCBS-CDMA transceiver that preserves the orthogonality among users and guarantees symbol detection, regardless of the underlying frequency-selective fading channels. These properties allow for deterministic MUI elimination through low-complexity block despreading and enable full diversity gains, irrespective of the system load. Different options to perform equalization and decoding, either jointly or separately, strike the trade-off between performance and complexity. To improve the performance over multi-input multi-output (MIMO multipath fading channels, our MCBS-CDMA transceiver combines well with space-time block-coding (STBC techniques, to exploit both multiantenna and multipath diversity gains, irrespective of the system load. Simulation results demonstrate the superior performance of MCBS-CDMA compared to competing alternatives.
Multicarrier Block-Spread CDMA for Broadband Cellular Downlink
Petré, Frederik; Leus, Geert; Moonen, Marc; De Man, Hugo
2004-12-01
Effective suppression of multiuser interference (MUI) and mitigation of frequency-selective fading effects within the complexity constraints of the mobile constitute major challenges for broadband cellular downlink transceiver design. Existing wideband direct-sequence (DS) code division multiple access (CDMA) transceivers suppress MUI statistically by restoring the orthogonality among users at the receiver. However, they call for receive diversity and multichannel equalization to improve the fading effects caused by deep channel fades. Relying on redundant block spreading and linear precoding, we design a so-called multicarrier block-spread- (MCBS-)CDMA transceiver that preserves the orthogonality among users and guarantees symbol detection, regardless of the underlying frequency-selective fading channels. These properties allow for deterministic MUI elimination through low-complexity block despreading and enable full diversity gains, irrespective of the system load. Different options to perform equalization and decoding, either jointly or separately, strike the trade-off between performance and complexity. To improve the performance over multi-input multi-output (MIMO) multipath fading channels, our MCBS-CDMA transceiver combines well with space-time block-coding (STBC) techniques, to exploit both multiantenna and multipath diversity gains, irrespective of the system load. Simulation results demonstrate the superior performance of MCBS-CDMA compared to competing alternatives.
正则化双阶线性稀疏编码在人脸识别中的应用%APPLYING DUAL-STAGE LINEAR REGULARISED SPARSE CODING IN FACE RECOGNITION
李利正; 黄煜栋; 陈平生
2014-01-01
Anomaly will occur in traditional sparse coding method when large-scale data is encountered due to high computational complexity, and this leads to the feature extraction not working well.In light of this problem, we propose the dual-stage linear regularised sparse coding ( DLRSC) method, it learns the structure features of noise and abnormal pixel by means of generalised multi-feature subspace framework, and calculates the only approximate solution by using the theory of L1 ball.Moreover, the filtering skill is adopted to avoid the complex computation of the large-scale data, thereby reduces the time and space complexity.Finally, the experiments on two universal database, the ORL and the Yale, verify the effectiveness of the mentioned DLRSC method, experimental results show that compared with other state-of-the-art sparse coding methods, the proposed method achieves better recognition results.%传统的稀疏编码方法在遇到大规模数据时，因计算复杂度高而出现异常。针对这种异常导致不能很好地进行特征提取的问题，提出正则化双阶线性稀疏编码DLRSC（ Double Linear Regularization Sparse Coding）方法。借助于广义多特征子空间框架来学习噪声和异常像素的结构特征，通过使用L1球理论，计算出唯一的近似解，并且利用滤波技巧避免了大规模数据的复杂计算，从而降低了时间及空间复杂度。最后，在ORL及Yale两大通用人脸数据库上的实验验证了所提的DLRSC方法的有效性，实验结果表明，相比其他几种最先进的稀疏编码方法，所提方法取得了更好的识别效果。
Multiple LDPC decoding for distributed source coding and video coding
Forchhammer, Søren; Luong, Huynh Van; Huang, Xin
2011-01-01
Distributed source coding (DSC) is a coding paradigm for systems which fully or partly exploit the source statistics at the decoder to reduce the computational burden at the encoder. Distributed video coding (DVC) is one example. This paper considers the use of Low Density Parity Check Accumulate...... (LDPCA) codes in a DSC scheme with feed-back. To improve the LDPC coding performance in the context of DSC and DVC, while retaining short encoder blocks, this paper proposes multiple parallel LDPC decoding. The proposed scheme passes soft information between decoders to enhance performance. Experimental...
A look at scalable dense linear algebra libraries
Dongarra, J.J. [Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science]|[Oak Ridge National Lab., TN (United States); Van de Geijn, R.A. [Texas Univ., Austin, TX (United States). Dept. of Computer Sciences; Walker, D.W. [Oak Ridge National Lab., TN (United States)
1992-08-01
We discuss the essential design features of a library of scalable software for performing dense linear algebra computations on distributed memory concurrent computers. The square block scattered decomposition is proposed as a flexible and general-purpose way of decomposing most, if not all, dense matrix problems. An object- oriented interface to the library permits more portable applications to be written, and is easy to learn and use, since details of the parallel implementation are hidden from the user. Experiments on the Intel Touchstone Delta system with a prototype code that uses the square block scattered decomposition to perform LU factorization are presented and analyzed. It was found that the code was both scalable and efficient, performing at about 14 GFLOPS (double precision) for the largest problem considered.
A look at scalable dense linear algebra libraries
Dongarra, J.J. (Tennessee Univ., Knoxville, TN (United States) Dept. of Computer Science Oak Ridge National Lab., TN (United States)); van de Geijn, R. (Texas Univ., Austin, TX (United States). Dept. of Computer Sciences); Walker, D.W. (Oak Ridge National Lab., TN (United States))
1992-07-01
We discuss the essential design features of a library of scalable software for performing dense linear algebra computations on distributed memory concurrent computers. The square block scattered decomposition is proposed as a flexible and general-purpose way of decomposing most, if not all, dense matrix problems. An object- oriented interface to the library permits more portable applications to be written, and is easy to learn and use, since details of the parallel implementation are hidden from the user. Experiments on the Intel Touchstone Delta system with a prototype code that uses the square block scattered decomposition to perform LU factorization are presented and analyzed. It was found that the code was both scalable and efficient, performing at about 14 Gflop/s (double precision) for the largest problem considered.
A look at scalable dense linear algebra libraries
Dongarra, J.J. (Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science Oak Ridge National Lab., TN (United States)); Van de Geijn, R.A. (Texas Univ., Austin, TX (United States). Dept. of Computer Sciences); Walker, D.W. (Oak Ridge National Lab., TN (United States))
1992-01-01
We discuss the essential design features of a library of scalable software for performing dense linear algebra computations on distributed memory concurrent computers. The square block scattered decomposition is proposed as a flexible and general-purpose way of decomposing most, if not all, dense matrix problems. An object- oriented interface to the library permits more portable applications to be written, and is easy to learn and use, since details of the parallel implementation are hidden from the user. Experiments on the Intel Touchstone Delta system with a prototype code that uses the square block scattered decomposition to perform LU factorization are presented and analyzed. It was found that the code was both scalable and efficient, performing at about 14 GFLOPS (double precision) for the largest problem considered.
无
1996-01-01
@@ The Chadong Block, located in the east of Qaidam Basin, Qinghai Province, covers an area of 12 452 km2. It is bounded by Kunlum Mountains in the south and the northwest is closely adjacent to Aimunike Mountain.Rivers are widely distributed, which always run in NWSE direction, including the Sulunguole, Qaidam and Haluwusu Rivers. The traffic condition is good, the Qinghai-Tibet highway stretching through the whole area and the Lan-Qing railway, 20-50 km away from the block, passing from north to west. A lot of Mongolia minority people have settled there, of which herdsmen always live nearby the Qaidam River drainage area.
New constructions of WOM codes using the Wozencraft ensemble
Shpilka, Amir
2011-01-01
In this paper we give several new constructions of WOM codes. The novelty in our constructions is the use of the so called Wozencraft ensemble of linear codes. Specifically, we obtain the following results. We give an explicit construction of a two-write Write-Once-Memory (WOM for short) code that approaches capacity, over the binary alphabet. More formally, for every \\epsilon>0, 0
code of length n and capacity H(p)+1-p-\\epsilon. Since the capacity of a two-write WOM code is max_p (H(p)+1-p), we get a code that is \\epsilon-close to capacity. Furthermore, encoding and decoding can be done in time O(n^2.poly(log n)) and time O(n.poly(log n)), respectively, and in logarithmic space. We obtain a new encoding scheme for 3-write WOM codes over the binary alphabet. Our scheme achieves rate 1.809-\\epsilon, when the block length is exp(1/\\epsilon). This gives a better rate than what could be achieved using previous techniques. We ...
Joint opportunistic scheduling and network coding for bidirectional relay channel
Shaqfeh, Mohammad
2013-07-01
In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users\\' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited. © 2013 IEEE.
Rate-adaptive BCH coding for Slepian-Wolf coding of highly correlated sources
Forchhammer, Søren; Salmistraro, Matteo; Larsen, Knud J.
2012-01-01
This paper considers using BCH codes for distributed source coding using feedback. The focus is on coding using short block lengths for a binary source, X, having a high correlation between each symbol to be coded and a side information, Y, such that the marginal probability of each symbol, Xi in...
New quantum codes constructed from quaternary BCH codes
Xu, Gen; Li, Ruihu; Guo, Luobin; Ma, Yuena
2016-10-01
In this paper, we firstly study construction of new quantum error-correcting codes (QECCs) from three classes of quaternary imprimitive BCH codes. As a result, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing quaternary BCH codes are determined to be much larger than the result given according to Aly et al. (IEEE Trans Inf Theory 53:1183-1188, 2007) for each different code length. Thus, families of new QECCs are newly obtained, and the constructed QECCs have larger distance than those in the previous literature. Secondly, we apply a combinatorial construction to the imprimitive BCH codes with their corresponding primitive counterpart and construct many new linear quantum codes with good parameters, some of which have parameters exceeding the finite Gilbert-Varshamov bound for linear quantum codes.
Toric Codes, Multiplicative Structure and Decoding
Hansen, Johan Peder
2017-01-01
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for \\emph{decoding}, resembling the decoding of Reed-Solomon codes...... and aligns with decoding by error correcting pairs. We have used the multiplicative structure on toric codes to construct linear secret sharing schemes with \\emph{strong multiplication} via Massey's construction generalizing the Shamir Linear secret sharing shemes constructed from Reed-Solomon codes. We have...... constructed quantum error correcting codes from toric surfaces by the Calderbank-Shor-Steane method....
Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate
Wachter-Zeh, Antonia; Bossert, Martin
2012-01-01
Partial Unit Memory (PUM) codes are a special class of convolutional codes, which are often constructed by means of block codes. Decoding of PUM codes may take advantage of existing decoders for the block code. The Dettmar--Sorger algorithm is an efficient decoding algorithm for PUM codes, but allows only low code rates. The same restriction holds for several known PUM code constructions. In this paper, an arbitrary-rate construction, the analysis of its distance parameters and a generalized decoding algorithm for PUM codes of arbitrary rate are provided. The correctness of the algorithm is proven and it is shown that its complexity is cubic in the length.
Linear Logical Voting Protocols
DeYoung, Henry; Schürmann, Carsten
2012-01-01
. In response, we promote linear logic as a high-level language for both specifying and implementing voting protocols. Our linear logical specifications of the single-winner first-past-the-post (SW- FPTP) and single transferable vote (STV) protocols demonstrate that this approach leads to concise......Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification...... implementations that closely correspond to their legal specification, thereby increasing trust....
Fabio Burderi
2007-05-01
Full Text Available Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD, we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ``unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguouscomponent and other (if any totally ambiguouscomponents. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.
Introduction to coding and information theory
Roman, Steven
1997-01-01
This book is intended to introduce coding theory and information theory to undergraduate students of mathematics and computer science. It begins with a review of probablity theory as applied to finite sample spaces and a general introduction to the nature and types of codes. The two subsequent chapters discuss information theory: efficiency of codes, the entropy of information sources, and Shannon's Noiseless Coding Theorem. The remaining three chapters deal with coding theory: communication channels, decoding in the presence of errors, the general theory of linear codes, and such specific codes as Hamming codes, the simplex codes, and many others.
Blind recognition of punctured convolutional codes
LU Peizhong; LI Shen; ZOU Yan; LUO Xiangyang
2005-01-01
This paper presents an algorithm for blind recognition of punctured convolutional codes which is an important problem in adaptive modulation and coding. For a given finite sequence of convolutional code, the parity check matrix of the convolutional code is first computed by solving a linear system with adequate error tolerance. Then a minimal basic encoding matrix of the original convolutional code and its puncturing pattern are determined according to the known parity check matrix of the punctured convolutional code.
On (Partial) Unit Memory Codes Based on Gabidulin Codes
Wachter, Antonia; Bossert, Martin; Zyablov, Victor
2011-01-01
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, the extended row rank distance and its slope are defined analogous to the extended row distance in Hamming metric. Upper bounds for the free rank distance and the slope of (P)UM codes in the sum rank metric are derived and an explicit construction of (P)UM codes based on Gabidulin codes is given, achieving the upper bound for the free rank distance.
Fast QC-LDPC code for free space optical communication
Wang, Jin; Zhang, Qi; Udeh, Chinonso Paschal; Wu, Rangzhong
2017-02-01
Free Space Optical (FSO) Communication systems use the atmosphere as a propagation medium. Hence the atmospheric turbulence effects lead to multiplicative noise related with signal intensity. In order to suppress the signal fading induced by multiplicative noise, we propose a fast Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) code for FSO Communication systems. As a linear block code based on sparse matrix, the performances of QC-LDPC is extremely near to the Shannon limit. Currently, the studies on LDPC code in FSO Communications is mainly focused on Gauss-channel and Rayleigh-channel, respectively. In this study, the LDPC code design over atmospheric turbulence channel which is nether Gauss-channel nor Rayleigh-channel is closer to the practical situation. Based on the characteristics of atmospheric channel, which is modeled as logarithmic-normal distribution and K-distribution, we designed a special QC-LDPC code, and deduced the log-likelihood ratio (LLR). An irregular QC-LDPC code for fast coding, of which the rates are variable, is proposed in this paper. The proposed code achieves excellent performance of LDPC codes and can present the characteristics of high efficiency in low rate, stable in high rate and less number of iteration. The result of belief propagation (BP) decoding shows that the bit error rate (BER) obviously reduced as the Signal-to-Noise Ratio (SNR) increased. Therefore, the LDPC channel coding technology can effectively improve the performance of FSO. At the same time, the BER, after decoding reduces with the increase of SNR arbitrarily, and not having error limitation platform phenomenon with error rate slowing down.
Performance Analysis of 3-Dimensional Turbo Codes
Rosnes, Eirik
2011-01-01
In this work, we consider the minimum distance properties and convergence thresholds of 3-dimensional turbo codes (3D-TCs), recently introduced by Berrou et al.. Here, we consider binary 3D-TCs while the original work of Berrou et al. considered double-binary codes. In the first part of the paper, the minimum distance properties are analyzed from an ensemble perspective, both in the finite-length regime and in the asymptotic case of large block lengths. In particular, we analyze the asymptotic weight distribution of 3D-TCs and show numerically that their typical minimum distance dmin may, depending on the specific parameters, asymptotically grow linearly with the block length, i.e., the 3D-TC ensemble is asymptotically good for some parameters. In the second part of the paper, we derive some useful upper bounds on the dmin when using quadratic permutation polynomial (QPP) interleavers with a quadratic inverse. Furthermore, we give examples of interleaver lengths where an upper bound appears to be tight. The b...
Content Analysis of Block Play Literature.
Conrad, Annabel
This study examined research on children's block play, using content analysis to review 75 documents that focused on such play. Each document was coded by type (empirical study or nonempirical article) and by 15 topics and 76 subtopics grouped into 4 broad categories: (1) environment/ecology; (2) block play and the school curriculum; (3) block…
Gildeberto S. Cardoso
2011-01-01
Full Text Available This paper presents a study of linear control systems based on exact feedback linearization and approximate feedback linearization. As exact feedback linearization is applied, a linear controller can perform the control objectives. The approximate feedback linearization is required when a nonlinear system presents a noninvolutive property. It uses a Taylor series expansion in order to compute a nonlinear transformation of coordinates to satisfy the involutivity conditions.
MULTI-BLOCK CHAINING-BASED AUTHENTICATION MODE
Huang Yuhua; Hu Aiqun; Zhong Ziguo
2006-01-01
A fast authentication mode based on Multi-Block Chaining (MBC) is put forward; and its security is proved. The MBC mode is for new generation block cipher algorithms. Its speed is about 13% faster than that of the authentication modes in common use (for example, cipher block chaining-message authentication code mode). The dependence test results meet the requirement. The MBC mode is complete; its degree of avalanche effect is about 0.9993; its degree of strict avalanche criterion is 0.992 or so. The frequency test results indicate that the output generated by the MBC mode has uniformity. The binary matrix rank test results imply that it is linear independent among disjoint sub-matrices of the output. Maurer's universal statistical test results show that the output could be significantly compressed without loss of information. Run test, spectral test,non-overlapping template matching test, overlapping template matching test, Lempel-Ziv compression test,linear complexity test, serial test, approximate entropy test, cumulative sums test, random excursions test and random excursions variant test results fulfill the requirements of all. Therefore the MBC mode has good pseudo-randomness. Thus the security of MBC mode is verified by the way of statistical evaluation.
Solution of 3-dimensional time-dependent viscous flows. Part 2: Development of the computer code
Weinberg, B. C.; Mcdonald, H.
1980-01-01
There is considerable interest in developing a numerical scheme for solving the time dependent viscous compressible three dimensional flow equations to aid in the design of helicopter rotors. The development of a computer code to solve a three dimensional unsteady approximate form of the Navier-Stokes equations employing a linearized block emplicit technique in conjunction with a QR operator scheme is described. Results of calculations of several Cartesian test cases are presented. The computer code can be applied to more complex flow fields such as these encountered on rotating airfoils.
LDGM Codes for Channel Coding and Joint Source-Channel Coding of Correlated Sources
Javier Garcia-Frias
2005-05-01
Full Text Available We propose a coding scheme based on the use of systematic linear codes with low-density generator matrix (LDGM codes for channel coding and joint source-channel coding of multiterminal correlated binary sources. In both cases, the structures of the LDGM encoder and decoder are shown, and a concatenated scheme aimed at reducing the error floor is proposed. Several decoding possibilities are investigated, compared, and evaluated. For different types of noisy channels and correlation models, the resulting performance is very close to the theoretical limits.
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof....
傅娟; 韦岗; 黄庆华
2013-01-01
In order to improve the axial resolution and satisfy the contrast resolution of medical ultrasound imaging,a predistorted Linear Frequency Modulation (LFM) coded excitation new method based on amplitude weighting is proposed.Combining the amplitude weighting technology of LFM transmitted signal with the sidelobe reduction technology of echo signal,the method on the one hand can compensate the influence of transducer impulse response on transmission signal,so bandwidth of the echo signal is not limited by the transducer and axial resolution is improved.On the other hand,the method can remove the Fresnel ripples of transmitted signal's frequency response,increase its bandwidth and use mismatched filter for pulse compression,so range sidelobe is suppressed to ensure contrast resolution.The results of simulation reveal that in contrast with constant envelope LFM coded excitation,the predistorted one can improve axial resolution and reduce maximum sidelobe at-48 dB to satisfy contrast resolution of medical imaging.FieldII Simulation results of B-mode image show that the axial resolution of constant envelope LFM coded excitation and the predistorted one is 0.35 mm and 0.25 mm,respectively.%为了提高医学超声成像的轴向分辨力和确保对比度,该文提出一种基于幅度加权的预失真线性调频编码新方法.该方法将线性调频发射信号幅度加权技术和回波信号旁瓣抑制技术相结合,一方面补偿超声探头对发射信号的影响,使得回波信号的带宽不局限于探头,提高轴向分辨力；另一方面消除发射信号幅频特性的菲涅耳波纹,提高发射信号的带宽并采用失配滤波器进行脉冲压缩,实现旁瓣抑制,确保成像对比度.仿真结果表明:相对恒包络线性调频编码,预失真线性调频编码方法不仅提高了轴向分辨力,而且最大旁瓣幅度减小至-48 dB以下,满足医学成像对比度要求.FieldII仿真B超图像结果表明:恒包络线性调频和预
Shilov, Georgi E
1977-01-01
Covers determinants, linear spaces, systems of linear equations, linear functions of a vector argument, coordinate transformations, the canonical form of the matrix of a linear operator, bilinear and quadratic forms, Euclidean spaces, unitary spaces, quadratic forms in Euclidean and unitary spaces, finite-dimensional space. Problems with hints and answers.
Agarwalla Arun
2001-01-01
Full Text Available Linear psoriasis, inflammatory linear varrucous epidermal naevus (ILVEN. Lichen straitus, linear lichen planus and invasion of epidermal naevi by psoriasis have clinical and histopathological overlap. We report two young male patients of true linear psoriasis without classical lesions elsewhere which were proved histopathologically. Seasonal variation and good response to topical antipsoriatic treatment supported the diagnosis.
Latorre, Jose I
2015-01-01
There exists a remarkable four-qutrit state that carries absolute maximal entanglement in all its partitions. Employing this state, we construct a tensor network that delivers a holographic many body state, the H-code, where the physical properties of the boundary determine those of the bulk. This H-code is made of an even superposition of states whose relative Hamming distances are exponentially large with the size of the boundary. This property makes H-codes natural states for a quantum memory. H-codes exist on tori of definite sizes and get classified in three different sectors characterized by the sum of their qutrits on cycles wrapped through the boundaries of the system. We construct a parent Hamiltonian for the H-code which is highly non local and finally we compute the topological entanglement entropy of the H-code.
Architectures for block Toeplitz systems
Bouras, Ilias; Glentis, George-Othon; Kalouptsidis, Nicholas
1996-01-01
In this paper efficient VLSI architectures of highly concurrent algorithms for the solution of block linear systems with Toeplitz or near-to-Toeplitz entries are presented. The main features of the proposed scheme are the use of scalar only operations, multiplications/divisions and additions, and th
Kubilius, Jonas
2014-01-01
Sharing code is becoming increasingly important in the wake of Open Science. In this review I describe and compare two popular code-sharing utilities, GitHub and Open Science Framework (OSF). GitHub is a mature, industry-standard tool but lacks focus towards researchers. In comparison, OSF offers a one-stop solution for researchers but a lot of functionality is still under development. I conclude by listing alternative lesser-known tools for code and materials sharing.
Differential Space-Time Coded Modulation
CHENZhonglin; ZHUGuangxi
2004-01-01
Relying on amicable orthogonal design, we develop for multiple-antenna systems a General differential space-time block code (GDSTBC), which imposes no restrictions on underlying signal constellation compared with the existing differential space-time designs. This generalization potentially allows the spectral efficiency to be increased by carrying information not only on phases but also on amplitudes. We then derive a Noncoherent decoder (NCD) for fiat Rayleigh fading channels. We show that NCD may recover data symbols with full antenna diversity and linear complexity at high signal-to-noise ratio. Particularly, while three kinds of conventional signal constellations are used in GDSTBC, we derive the simplified versions of NCDs which can effectively reduce the cost of implementation.
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity in the net...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof.......Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...
Decoding of Convolutional Codes over the Erasure Channel
Tomás, Virtudes; Smarandache, Roxana
2010-01-01
In this paper we study the decoding capabilities of convolutional codes over the erasure channel. Of special interest will be maximum distance profile (MDP) convolutional codes. These are codes which have a maximum possible column distance increase. We show how this strong minimum distance condition of MDP convolutional codes help us to solve error situations that maximum distance separable (MDS) block codes fail to solve. Towards this goal, we define two subclasses of MDP codes: reverse-MDP convolutional codes and complete-MDP convolutional codes. Reverse-MDP codes have the capability to recover a maximum number of erasures using an algorithm which runs backward in time. Complete-MDP convolutional codes are both MDP and reverse-MDP codes. They are capable to recover the state of the decoder under the mildest condition. We show that complete-MDP convolutional codes perform in certain sense better than MDS block codes of the same rate over the erasure channel.
A Fast Fractal Image Compression Coding Method
无
2001-01-01
Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic. Search of the best matched domain block is the most computation intensive part of the fractal encoding process. In this paper, a fast fractal approximation coding scheme implemented on a personal computer based on matching in range block's neighbours is presented. Experimental results show that the proposed algorithm is very simple in implementation, fast in encoding time and high in compression ratio while PSNR is almost the same as compared with Barnsley's fractal block coding .
Joint Source, Channel Coding, and Secrecy
Magli Enrico
2007-01-01
Full Text Available We introduce the concept of joint source coding, channel coding, and secrecy. In particular, we propose two practical joint schemes: the first one is based on error-correcting randomized arithmetic codes, while the second one employs turbo codes with compression, error protection, and securization capabilities. We provide simulation results on ideal binary data showing that the proposed schemes achieve satisfactory performance; they also eliminate the need for external compression and ciphering blocks with a significant potential computational advantage.
Joint Source, Channel Coding, and Secrecy
Enrico Magli
2007-09-01
Full Text Available We introduce the concept of joint source coding, channel coding, and secrecy. In particular, we propose two practical joint schemes: the first one is based on error-correcting randomized arithmetic codes, while the second one employs turbo codes with compression, error protection, and securization capabilities. We provide simulation results on ideal binary data showing that the proposed schemes achieve satisfactory performance; they also eliminate the need for external compression and ciphering blocks with a significant potential computational advantage.
Practical Binary Adaptive Block Coder
Reznik, Yuriy A
2007-01-01
This paper describes design of a low-complexity algorithm for adaptive encoding/ decoding of binary sequences produced by memoryless sources. The algorithm implements universal block codes constructed for a set of contexts identified by the numbers of non-zero bits in previous bits in a sequence. We derive a precise formula for asymptotic redundancy of such codes, which refines previous well-known estimate by Krichevsky and Trofimov, and provide experimental verification of this result. In our experimental study we also compare our implementation with existing binary adaptive encoders, such as JBIG's Q-coder, and MPEG AVC (ITU-T H.264)'s CABAC algorithms.
Cox, Geoff
Speaking Code begins by invoking the “Hello World” convention used by programmers when learning a new language, helping to establish the interplay of text and code that runs through the book. Interweaving the voice of critical writing from the humanities with the tradition of computing and software...
2014-12-01
QPSK Gaussian channels . .......................................................................... 39 vi 1. INTRODUCTION Forward error correction (FEC...Capacity of BSC. 7 Figure 5. Capacity of AWGN channel . 8 4. INTRODUCTION TO POLAR CODES Polar codes were introduced by E. Arikan in [1]. This paper...Under authority of C. A. Wilgenbusch, Head ISR Division EXECUTIVE SUMMARY This report describes the results of the project “More reliable wireless
Interleaver Design for Turbo Coding
Andersen, Jakob Dahl; Zyablov, Viktor
1997-01-01
By a combination of construction and random search based on a careful analysis of the low weight words and the distance properties of the component codes, it is possible to find interleavers for turbo coding with a high minimum distance. We have designed a block interleaver with permutations...... of each row, and found a combination of permutations where a tight upper bound to the minimum distance of the complete turbo scheme is 108....
An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations
Zeh, Alexander; Augot, Daniel
2011-01-01
The key step of syndrome-based decoding of Reed-Solomon codes up to half the minimum distance is to solve the so-called Key Equation. List decoding algorithms, capable of decoding beyond half the minimum distance, are based on interpolation and factorization of multivariate polynomials. This article provides a link between syndrome-based decoding approaches based on Key Equations and the interpolation-based list decoding algorithms of Guruswami and Sudan for Reed-Solomon codes. The original interpolation conditions of Guruswami and Sudan for Reed-Solomon codes are reformulated in terms of a set of Key Equations. These equations provide a structured homogeneous linear system of equations of Block-Hankel form, that can be solved by an adaption of the Fundamental Iterative Algorithm. For an $(n,k)$ Reed-Solomon code, a multiplicity $s$ and a list size $\\listl$, our algorithm has time complexity \\ON{\\listl s^4n^2}.
A MODIFIED EDGE-ORIENTED SPATIAL INTERPOLATION ALGORITHM FOR CONSECUTIVE BLOCKS ERROR CONCEALMENT
Fu Wei; Xing Guangzhong
2007-01-01
This paper proposes a low-complexity spatial-domain Error Concealment (EC) algorithm for recovering consecutive blocks error in still images or Intra-coded (Ⅰ) frames of video sequences. The proposed algorithm works with the following steps. Firstly the Sobel operator is performed on the top and bottom adjacent pixels to detect the most likely edge direction of current block area. After that one-Dimensional (1D) matching is used on the available block boundaries. Displacement between edge direction candidate and most likely edge direction is taken into consideration as an important factor to improve stability of 1D boundary matching. Then the corrupted pixels are recovered by linear weighting interpolation along the estimated edge direction. Finally the interpolated values are merged to get last recovered picture. Simulation results demonstrate that the proposed algorithms obtain good subjective quality and higher Peak Signal-to-Noise Ratio (PSNR) than the methods in literatures for most images.
Enhanced motion coding in MC-EZBC
Chen, Junhua; Zhang, Wenjun; Wang, Yingkun
2005-07-01
Since hierarchical variable size block matching and bidirectional motion compensation are used in the motioncompensated embedded zero block coding (MC-EZBC), the motion information consists of motion vector quadtree map and motion vectors. In the conventional motion coding scheme, the quadtree structure is coded directly, the motion vector modes are coded with Huffman codes, and the motion vector differences are coded by an m-ary arithmetic coder with 0-order models. In this paper we propose a new motion coding scheme which uses an extension of the CABAC algorithm and new context modeling for quadtree structure coding and mode coding. In addition, we use a new scalable motion coding method which scales the motion vector quadtrees according to the rate-distortion slope of the tree nodes. Experimental results show that the new coding scheme increases the efficiency of the motion coding by more than 25%. The performance of the system is improved accordingly, especially in low bit rates. Moreover, with the scalable motion coding, the subjective and objective coding performance is further enhanced in low bit rate scenarios.
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes
Hernando, Fernando; Høholdt, Tom; Ruano, Diego
2012-01-01
A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list...... decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units....
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes
Hernando, Fernando; Høholdt, Tom; Ruano, Diego
2012-01-01
A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units.
Yang, Qianli; Pitkow, Xaq
2015-03-01
Most interesting natural sensory stimuli are encoded in the brain in a form that can only be decoded nonlinearly. But despite being a core function of the brain, nonlinear population codes are rarely studied and poorly understood. Interestingly, the few existing models of nonlinear codes are inconsistent with known architectural features of the brain. In particular, these codes have information content that scales with the size of the cortical population, even if that violates the data processing inequality by exceeding the amount of information entering the sensory system. Here we provide a valid theory of nonlinear population codes by generalizing recent work on information-limiting correlations in linear population codes. Although these generalized, nonlinear information-limiting correlations bound the performance of any decoder, they also make decoding more robust to suboptimal computation, allowing many suboptimal decoders to achieve nearly the same efficiency as an optimal decoder. Although these correlations are extremely difficult to measure directly, particularly for nonlinear codes, we provide a simple, practical test by which one can use choice-related activity in small populations of neurons to determine whether decoding is suboptimal or optimal and limited by correlated noise. We conclude by describing an example computation in the vestibular system where this theory applies. QY and XP was supported by a grant from the McNair foundation.
An Efficient Security Approach Using PGE and Parity Coding
Ch. Rupa
2012-12-01
Full Text Available Information Attacks are showing the weaknesses of Information security due to the rapid growth of theglobalisation. The main aim of these attacks is to retrieve the information by illegal that shows the faultsin the security services. In this paper, we introduce a novel secure steganographic approach for defendingagainst these information attacks. In this approach, instead of original message an encrypted message byPrime Number and Gray Code Encryption (PGE Algorithm is hidden into an Image (Stego Image usinga new approach named Linear Block parity coding (LBP which provides more security than conventionalapproaches. The major strength of this paper is steganalysis has discussed. The computational complexityis comparatively low with other methods since our feature vector space is limited interference is notobjectionable.
Spectral Shape of Check-Hybrid GLDPC Codes
Paolini, Enrico; Chiani, Marco; Fossorier, Marc P C
2010-01-01
This paper analyzes the asymptotic exponent of both the weight spectrum and the stopping set size spectrum for a class of generalized low-density parity-check (GLDPC) codes. Specifically, all variable nodes (VNs) are assumed to have the same degree (regular VN set), while the check node (CN) set is assumed to be composed of a mixture of different linear block codes (hybrid CN set). A simple expression for the exponent (which is also referred to as the growth rate or the spectral shape) is developed. This expression is consistent with previous results, including the case where the normalized weight or stopping set size tends to zero. Furthermore, it is shown how certain symmetry properties of the local weight distribution at the CNs induce a symmetry in the overall weight spectral shape function.
LDPC Codes for Compressed Sensing
Dimakis, Alexandros G; Vontobel, Pascal O
2010-01-01
We present a mathematical connection between channel coding and compressed sensing. In particular, we link, on the one hand, \\emph{channel coding linear programming decoding (CC-LPD)}, which is a well-known relaxation of maximum-likelihood channel decoding for binary linear codes, and, on the other hand, \\emph{compressed sensing linear programming decoding (CS-LPD)}, also known as basis pursuit, which is a widely used linear programming relaxation for the problem of finding the sparsest solution of an under-determined system of linear equations. More specifically, we establish a tight connection between CS-LPD based on a zero-one measurement matrix over the reals and CC-LPD of the binary linear channel code that is obtained by viewing this measurement matrix as a binary parity-check matrix. This connection allows the translation of performance guarantees from one setup to the other. The main message of this paper is that parity-check matrices of "good" channel codes can be used as provably "good" measurement ...
Efficient convolutional sparse coding
Wohlberg, Brendt
2017-06-20
Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.
LAPACK: Linear algebra software for supercomputers
Bischof, C.H.
1991-01-01
This paper presents an overview of the LAPACK library, a portable, public-domain library to solve the most common linear algebra problems. This library provides a uniformly designed set of subroutines for solving systems of simultaneous linear equations, least-squares problems, and eigenvalue problems for dense and banded matrices. We elaborate on the design methodologies incorporated to make the LAPACK codes efficient on today's high-performance architectures. In particular, we discuss the use of block algorithms and the reliance on the Basic Linear Algebra Subprograms. We present performance results that show the suitability of the LAPACK approach for vector uniprocessors and shared-memory multiprocessors. We also address some issues that have to be dealt with in tuning LAPACK for specific architectures. Lastly, we present results that show that the LAPACK software can be adapted with little effort to distributed-memory environments, and we discuss future efforts resulting from this project. 31 refs., 10 figs., 2 tabs.
An efficient adaptive arithmetic coding image compression technology
Wang Xing-Yuan; Yun Jiao-Jiao; Zhang Yong-Lei
2011-01-01
This paper proposes an efficient lossless image compression scheme for still images based on an adaptive arithmetic coding compression algorithm.The algorithm increases the image coding compression rate and ensures the quality of the decoded image combined with the adaptive probability model and predictive coding.The use of adaptive models for each encoded image block dynamically estimates the probability of the relevant image block.The decoded image block can accurately recover the encoded image according to the code book information.We adopt an adaptive arithmetic coding algorithm for image compression that greatly improves the image compression rate.The results show that it is an effective compression technology.
Suzuki, Taizo; Ikehara, Masaaki
2014-06-01
We present an effective image boundary processing for M-channel (M ∈ IN, M ≥ 2) lifting-based linear-phase filter banks that are applied to unified lossy and lossless image compression (coding), i.e., lossy-to-lossless image coding. The reversible symmetric extension we propose is achieved by manipulating building blocks on the image boundary and reawakening the symmetry of each building block that has been lost due to rounding error on each lifting step. In addition, complexity is reduced by extending nonexpansive convolution, called reversible symmetric nonexpansive convolution, because the number of input signals does not even temporarily increase. Our method not only achieves reversible boundary processing, but also is comparable with irreversible symmetric extension in lossy image coding and outperformed periodic extension in lossy-to-lossless image coding.
Wang, Jim Jing-Yan
2014-07-06
Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.
Bit-Interleaved Coded Multiple Beamforming with Perfect Coding
Li, Boyu
2010-01-01
When the channel state information is known by the transmitter as well as the receiver, beamforming techniques that employ Singular Value Decomposition (SVD) are commonly used in Multiple-Input Multiple-Output (MIMO) systems. Without channel coding, when a single symbol is transmitted, these systems achieve the full diversity order. Whereas, this property is lost when multiple symbols are simultaneously transmitted. Full diversity can be restored when channel coding is added, as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS =< 1. Moreover, by adding a proper constellation precoder, full diversity can be achieved for both uncoded and coded SVD systems, e.g., Fully Precoded Multiple Beamforming (FPMB) and Bit-Interleaved Coded Multiple Beamforming with Full Precoding (BICMB-FP). Perfect Space-Time Block Code (PSTBC) is a full-rate full-diversity space-time code, which achieves maximum coding gain for MIMO systems. Previously, Perfect Coded Multiple Beamforming (P...
deepBlockAlign: a tool for aligning RNA-seq profiles of read block patterns
Ekstrøm, Claus T.; Stadler, Peter F.; Hoffmann, Steve; Gorodkin, Jan
2012-01-01
Motivation: High-throughput sequencing methods allow whole transcriptomes to be sequenced fast and cost-effectively. Short RNA sequencing provides not only quantitative expression data but also an opportunity to identify novel coding and non-coding RNAs. Many long transcripts undergo post-transcriptional processing that generates short RNA sequence fragments. Mapped back to a reference genome, they form distinctive patterns that convey information on both the structure of the parent transcript and the modalities of its processing. The miR-miR* pattern from microRNA precursors is the best-known, but by no means singular, example. Results: deepBlockAlign introduces a two-step approach to align RNA-seq read patterns with the aim of quickly identifying RNAs that share similar processing footprints. Overlapping mapped reads are first merged to blocks and then closely spaced blocks are combined to block groups, each representing a locus of expression. In order to compare block groups, the constituent blocks are first compared using a modified sequence alignment algorithm to determine similarity scores for pairs of blocks. In the second stage, block patterns are compared by means of a modified Sankoff algorithm that takes both block similarities and similarities of pattern of distances within the block groups into account. Hierarchical clustering of block groups clearly separates most miRNA and tRNA, and also identifies about a dozen tRNAs clustering together with miRNA. Most of these putative Dicer-processed tRNAs, including eight cases reported to generate products with miRNA-like features in literature, exhibit read blocks distinguished by precise start position of reads. Availability: The program deepBlockAlign is available as source code from http://rth.dk/resources/dba/. Contact: gorodkin@rth.dk; studla@bioinf.uni-leipzig.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:22053076
NANOSTRUCTURES OF FUNCTIONAL BLOCK COPOLYMERS
Guojun Liu
2000-01-01
Nanostructure fabrication from block copolymers in my group normally involves polymer design, synthesis, selfassembly, selective domain crosslinking, and sometimes selective domain removal. Preparation of thin films with nanochannels was used to illustrate the strategy we took. In this particular case, a linear triblock copolymer polyisopreneblock-poly(2-cinnamoylethyl methacrylate)-block-poly(t-butyl acrylate), PI-b-PCEMA-b-PtBA, was used. Films, 25 to50μm thick, were prepared from casting on glass slides a toluene solution of PI-b-PCEMA-b-PtBA and PtBA homopolymer,hPtBA, where hPtBA is shorter than the PtBA block. At the hPtBA mass fraction of 20% relative to the triblock or the total PtBA (hPtBA and PtBA block) volume fraction of 0.44, hPtBA and PtBA formed a seemingly continuous phase in the matrix of PCEMA and PI. Such a block segregation pattern was locked in by photocrosslinking the PCEMA domain. Nanochannels were formed by extracting out hPtBA with solvent. Alternatively, larger channels were obtained from extracting out hPtBA and hydrolyzing the t-butyl groups of the PtBA block. Such membranes were not liquid permeable but had gas permeability constants ～6 orders of magnitude higher than that of low-density polyethylene films.
张艳语; 朱义君; 张水莲
2013-01-01
基于投影空间,提出了频率选择性MIMO (FS-MIMO)信道下一种实现块传输的收发联合设计方案.通过收发联合分离多径,把选择性信道转化为了若干正交的平坦MIMO等效信道,增加了系统设计的自由度.给出了一种容量最优的功率分配方案,推导了其误码率和信道容量的解析式.仿真结果验证了理论分析的正确性,该方案在高信噪比时与非块传输相比容量增益为L(多径数目).%Based on orthogonal projection,a transceiver scheme is proposed for MIMO block transmission over frequency-selective channel.By separating multi-path components,the selective MIMO channel is decomposed into L (the number of multi-path components) flat orthogonal MIMO effective channels,increasing degrees of freedom of system design.The analytical expressions of BER and capacity are given,based on proposed capacity-optimal power allocation.Simulation results show that compared with the existing non-block transmission,the capacity gain is L in high SNR regime.
Song, Xia; Zhu, Jing-Ling; Wen, Yuting; Zhao, Feng; Zhang, Zhong-Xing; Li, Jun
2017-03-15
Chemotherapy is facing several limitations such as low water solubility of anticancer drugs and multidrug resistance (MDR) in cancer cells. To overcome these limitations, a thermoresponsive micellar drug delivery system formed by a non-covalently connected supramolecular block polymer was developed. The system is based on the host-guest interaction between a well-defined β-cyclodextrin (β-CD) based poly(N-isopropylacrylamide) star host polymer and an adamantyl-containing poly(ethylene glycol) (Ad-PEG) guest polymer. The structures of the host and guest polymers were characterized by (1)H and (13)C NMR, GPC and FTIR. Subsequently, they formed a pseudo-block copolymer via inclusion complexation between β-CD core and adamantyl-moiety, which was confirmed by 2D NMR. The thermoresponsive micellization of the copolymer was investigated by UV-vis spectroscopy, DLS and TEM. At 37°C, the copolymer at a concentration of 0.2mg/mL in PBS formed micelles with a hydrodynamic diameter of ca. 282nm. The anticancer drug, doxorubicin (DOX), was successfully loaded into the core of the micelles with a loading level of 6% and loading efficiency of 17%. The blank polymer micelles showed good biocompatibility in cell cytotoxicity studies. Moreover, the DOX-loaded micelles demonstrated superior therapeutic effects in AT3B-1-N (MDR-) and AT3B-1 (MDR+) cell lines as compared to free DOX control, overcoming MDR in cancer cells.
Prefix Codes: Equiprobable Words, Unequal Letter Costs
Golin, Mordecai; Young, Neal E.
2002-01-01
Describes a near-linear-time algorithm for a variant of Huffman coding, in which the letters may have non-uniform lengths (as in Morse code), but with the restriction that each word to be encoded has equal probability. [See also ``Huffman Coding with Unequal Letter Costs'' (2002).
Monomial codes seen as invariant subspaces
García-Planas María Isabel
2017-08-01
Full Text Available It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known. In this paper a generalization of this relationship is presented between monomial codes over a finite field and hyperinvariant subspaces of n under an appropriate linear transformation. Using techniques of Linear Algebra it is possible to deduce certain properties for this particular type of codes, generalizing known results on cyclic codes.
Ravishankar, C., Hughes Network Systems, Germantown, MD
1998-05-08
Speech is the predominant means of communication between human beings and since the invention of the telephone by Alexander Graham Bell in 1876, speech services have remained to be the core service in almost all telecommunication systems. Original analog methods of telephony had the disadvantage of speech signal getting corrupted by noise, cross-talk and distortion Long haul transmissions which use repeaters to compensate for the loss in signal strength on transmission links also increase the associated noise and distortion. On the other hand digital transmission is relatively immune to noise, cross-talk and distortion primarily because of the capability to faithfully regenerate digital signal at each repeater purely based on a binary decision. Hence end-to-end performance of the digital link essentially becomes independent of the length and operating frequency bands of the link Hence from a transmission point of view digital transmission has been the preferred approach due to its higher immunity to noise. The need to carry digital speech became extremely important from a service provision point of view as well. Modem requirements have introduced the need for robust, flexible and secure services that can carry a multitude of signal types (such as voice, data and video) without a fundamental change in infrastructure. Such a requirement could not have been easily met without the advent of digital transmission systems, thereby requiring speech to be coded digitally. The term Speech Coding is often referred to techniques that represent or code speech signals either directly as a waveform or as a set of parameters by analyzing the speech signal. In either case, the codes are transmitted to the distant end where speech is reconstructed or synthesized using the received set of codes. A more generic term that is applicable to these techniques that is often interchangeably used with speech coding is the term voice coding. This term is more generic in the sense that the
Multiple Beamforming with Perfect Coding
Li, Boyu
2011-01-01
In Singular Value Decomposition (SVD) beamforming, without channel coding, there is a trade-off between full diversity and full multiplexing. Adding channel coding, full diversity and full multiplexing can be both achieved, as long as the code rate Rc and the number of subchannels S satisfy RcS1. Recently discovered Perfect Space-Time Block Codes (PSTBCs) are full-rate full-diversity space-time codes, achieving maximum coding gain. In this paper, two novel techniques, Perfect Coded Multiple Beamforming (PCMB) and Bit-Interleaved Coded Multiple Beamforming with Perfect Coding (BICMB-PC), are proposed, employing PSTBCs. PCMB achieves full diversity, full multiplexing, and full rate simultaneously, and its performance is close to PSTBC and FPMB, while the decoding complexity is significantly less than PSTBC and much lower than FPMB of dimensions 2 and 4. On the other hand, BICMB-PC achieves both full diversity and full multiplexing, and its performance is similar to BICMB-FP, but provides much lower decoding com...
Ultrasound guided supraclavicular block.
Hanumanthaiah, Deepak
2013-09-01
Ultrasound guided regional anaesthesia is becoming increasingly popular. The supraclavicular block has been transformed by ultrasound guidance into a potentially safe superficial block. We reviewed the techniques of performing supraclavicular block with special focus on ultrasound guidance.
Høskuldsson, Agnar; Svinning, K.
2006-01-01
Here is presented a unified approach to modelling multi-block regression data. The starting point is a partition of the data X into L data blocks, X = (X-1, X-2,...X-L), and the data Y into M data-blocks, Y = (Y-1, Y-2,...,Y-M). The methods of linear regression, X -> Y, are extended to the case...... these methods can be extended to a network of data blocks. Examples of the optimisation procedures in a network are shown. The examples chosen are the ones that are useful to work within industrial production environments. The methods are illustrated by simulated data and data from cement production....
Cox, Geoff
; alternatives to mainstream development, from performances of the live-coding scene to the organizational forms of commons-based peer production; the democratic promise of social media and their paradoxical role in suppressing political expression; and the market’s emptying out of possibilities for free...... development, Speaking Code unfolds an argument to undermine the distinctions between criticism and practice, and to emphasize the aesthetic and political aspects of software studies. Not reducible to its functional aspects, program code mirrors the instability inherent in the relationship of speech...... expression in the public realm. The book’s line of argument defends language against its invasion by economics, arguing that speech continues to underscore the human condition, however paradoxical this may seem in an era of pervasive computing....
Fractal Image Coding with Digital Watermarks
Z. Klenovicova
2000-12-01
Full Text Available In this paper are presented some results of implementation of digitalwatermarking methods into image coding based on fractal principles. Thepaper focuses on two possible approaches of embedding digitalwatermarks into fractal code of images - embedding digital watermarksinto parameters for position of similar blocks and coefficients ofblock similarity. Both algorithms were analyzed and verified on grayscale static images.
An Upper Limit of AC Huffman Code Length in JPEG Compression
Horie, Kenichi
2009-01-01
A strategy for computing upper code-length limits of AC Huffman codes for an 8x8 block in JPEG Baseline coding is developed. The method is based on a geometric interpretation of the DCT, and the calculated limits are as close as 14% to the maximum code-lengths. The proposed strategy can be adapted to other transform coding methods, e.g., MPEG 2 and 4 video compressions, to calculate close upper code length limits for the respective processing blocks.
The report documents a series of seminars at Rome Air Development Center with the content equivalent to an intense course in Linear Systems . Material...is slanted toward the practicing engineer and introduces some of the fundamental concepts and techniques for analyzing linear systems . Techniques for
List Decoding Tensor Products and Interleaved Codes
Gopalan, Parikshit; Raghavendra, Prasad
2008-01-01
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. We show that for {\\em every} code, the ratio of its list decoding radius to its minimum distance stays unchanged under the tensor product operation (rather than squaring, as one might expect). This gives the first efficient list decoders and new combinatorial bounds for some natural codes including multivariate polynomials where the degree in each variable is bounded. We show that for {\\em every} code, its list decoding radius remains unchanged under $m$-wise interleaving for an integer $m$. This generalizes a recent result of Dinur et al \\cite{DGKS}, who proved such a result for interleaved Hadamard codes (equivalently, linear transformations). Using the notion of generalized Hamming weights, we give better list size bounds for {\\em both} tensoring and interleaving of binary linear codes. By analyzing the weight distribution of these codes, we reduce the task of boundi...
Comparative Analysis of Sandcrete Hollow Blocks and Laterite Interlocking Blocks as Walling Elements
Akeem Ayinde Raheem
2012-04-01
Full Text Available This study considered the production and testing of sandcrete hollow blocks and laterite interlocking blocks with a view to comparing their physical characteristics and production cost. Some units of sandcrete hollow blocks and laterite interlocking blocks were made using machine vibrated sandcrete block mould and hydraulic interlocking block making machine respectively. The blocks were tested to determine their density and compressive strength. The results obtained from the tests were compared with the specifications of Nigerian Building and Road Research Institute (2006, Nigerian Building Code (2006, and Nigerian Industrial Standards (2000. The results indicated that the compressive strength of 225mm and 150mm sandcrete hollow blocks varies from 1.59 N/mm2 to 4.25 N/mm2 and 1.48N/mm2 to 3.35N/mm2 respectively, as the curing age increases from 7 to 28 days. For laterite interlocking blocks, the strength varies from 1.70N/mm2 at 7 days to 5.03N/mm2 at 28 days. All the blocks produced satisfied the minimum requirements in terms of compressive strength, by all available codes. The cost per square metre of 225mm and 150mm sandcrete hollow blocks are ₦2,808:00 and ₦2,340:00 respectively, while that of laterite interlocking blocks is ₦2,121:20.It was concluded that laterite interlocking blocks have better strength and are cheaper than sandcrete hollow blocks.
A POCS-Based Algorithm for Blocking Artifacts Reduction
ZHAO Yi-hong; CHENG Guo-hua; YU Song-yu
2006-01-01
An algorithm for blocking artifacts reduction in DCT domain for block-based image coding was developed. The algorithm is based on the projection onto convex set (POCS) theory. Due to the fact that the DCT characteristics of shifted blocks are different caused by the blocking artifacts, a novel smoothness constraint set and the corresponding projection operator were proposed to reduce the blocking artifacts by discarding the undesired high frequency coefficients in the shifted DCT blocks. The experimental results show that the proposed algorithm outperforms the conventional algorithms in terms of objective quality, subjective quality, and convergence property.
Properties of Codes in the Johnson Scheme
Silberstein, Natalia
2010-01-01
Codes which attain the sphere packing bound are called perfect codes. The most important metrics in coding theory on which perfect codes are defined are the Hamming metric and the Johnson metric. While for the Hamming metric all perfect codes over finite fields are known, in the Johnson metric it was conjectured by Delsarte in 1970's that there are no nontrivial perfect codes. The general nonexistence proof still remains the open problem. In this work we examine constant weight codes as well as doubly constant weight codes, and reduce the range of parameters in which perfect codes may exist in both cases. We start with the constant weight codes. We introduce an improvement of Roos' bound for one-perfect codes, and present some new divisibility conditions, which are based on the connection between perfect codes in Johnson graph J(n,w) and block designs. Next, we consider binomial moments for perfect codes. We show which parameters can be excluded for one-perfect codes. We examine two-perfect codes in J(2w,w) a...
Optimal codes as Tanner codes with cyclic component codes
Høholdt, Tom; Pinero, Fernando; Zeng, Peng
2014-01-01
In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A(2,q) as the Tanner graph, and we are able to describe...... the codes succinctly using Gröbner bases....
Coding and decoding for code division multiple user communication systems
Healy, T. J.
1985-01-01
A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.
Stoll, R R
1968-01-01
Linear Algebra is intended to be used as a text for a one-semester course in linear algebra at the undergraduate level. The treatment of the subject will be both useful to students of mathematics and those interested primarily in applications of the theory. The major prerequisite for mastering the material is the readiness of the student to reason abstractly. Specifically, this calls for an understanding of the fact that axioms are assumptions and that theorems are logical consequences of one or more axioms. Familiarity with calculus and linear differential equations is required for understand
Turbo coding, turbo equalisation and space-time coding for transmission over fading channels
Hanzo, L; Yeap, B
2002-01-01
Against the backdrop of the emerging 3G wireless personal communications standards and broadband access network standard proposals, this volume covers a range of coding and transmission aspects for transmission over fading wireless channels. It presents the most important classic channel coding issues and also the exciting advances of the last decade, such as turbo coding, turbo equalisation and space-time coding. It endeavours to be the first book with explicit emphasis on channel coding for transmission over wireless channels. Divided into 4 parts: Part 1 - explains the necessary background for novices. It aims to be both an easy reading text book and a deep research monograph. Part 2 - provides detailed coverage of turbo conventional and turbo block coding considering the known decoding algorithms and their performance over Gaussian as well as narrowband and wideband fading channels. Part 3 - comprehensively discusses both space-time block and space-time trellis coding for the first time in literature. Par...
Searle, Shayle R
2012-01-01
This 1971 classic on linear models is once again available--as a Wiley Classics Library Edition. It features material that can be understood by any statistician who understands matrix algebra and basic statistical methods.
Solow, Daniel
2014-01-01
This text covers the basic theory and computation for a first course in linear programming, including substantial material on mathematical proof techniques and sophisticated computation methods. Includes Appendix on using Excel. 1984 edition.
Berberian, Sterling K
2014-01-01
Introductory treatment covers basic theory of vector spaces and linear maps - dimension, determinants, eigenvalues, and eigenvectors - plus more advanced topics such as the study of canonical forms for matrices. 1992 edition.
Liesen, Jörg
2015-01-01
This self-contained textbook takes a matrix-oriented approach to linear algebra and presents a complete theory, including all details and proofs, culminating in the Jordan canonical form and its proof. Throughout the development, the applicability of the results is highlighted. Additionally, the book presents special topics from applied linear algebra including matrix functions, the singular value decomposition, the Kronecker product and linear matrix equations. The matrix-oriented approach to linear algebra leads to a better intuition and a deeper understanding of the abstract concepts, and therefore simplifies their use in real world applications. Some of these applications are presented in detailed examples. In several ‘MATLAB-Minutes’ students can comprehend the concepts and results using computational experiments. Necessary basics for the use of MATLAB are presented in a short introduction. Students can also actively work with the material and practice their mathematical skills in more than 300 exerc...
Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel
Shaqfeh, Mohammad
2013-05-27
In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users’ transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.
Polynomial theory of error correcting codes
Cancellieri, Giovanni
2015-01-01
The book offers an original view on channel coding, based on a unitary approach to block and convolutional codes for error correction. It presents both new concepts and new families of codes. For example, lengthened and modified lengthened cyclic codes are introduced as a bridge towards time-invariant convolutional codes and their extension to time-varying versions. The novel families of codes include turbo codes and low-density parity check (LDPC) codes, the features of which are justified from the structural properties of the component codes. Design procedures for regular LDPC codes are proposed, supported by the presented theory. Quasi-cyclic LDPC codes, in block or convolutional form, represent one of the most original contributions of the book. The use of more than 100 examples allows the reader gradually to gain an understanding of the theory, and the provision of a list of more than 150 definitions, indexed at the end of the book, permits rapid location of sought information.
Block ground interaction of rockfalls
Volkwein, Axel; Gerber, Werner; Kummer, Peter
2016-04-01
During a rockfall the interaction of the falling block with the ground is one of the most important factors that define the evolution of a rockfall trajectory. It steers the rebound, the rotational movement, possibly brake effects, friction losses and damping effects. Therefore, if most reliable rockfall /trajectory simulation software is sought a good understanding of the block ground interaction is necessary. Today's rockfall codes enable the simulation of a fully 3D modelled block within a full 3D surface . However, the details during the contact, i.e. the contact duration, the penetration depth or the dimension of the marks in the ground are usually not part of the simulation. Recent field tests with rocks between 20 and 80 kg have been conducted on a grassy slope in 2014 [1]. A special rockfall sensor [2] within the blocks measured the rotational velocity and the acting accelerations during the tests. External video records and a so-called LocalPositioningSystem deliver information on the travel velocity. With these data not only the flight phases of the trajectories but also the contacts with the ground can be analysed. During the single jumps of a block the flight time, jump length, the velocity, and the rotation are known. During the single impacts their duration and the acting accelerations are visible. Further, the changes of rotational and translational velocity influence the next jump of the block. The change of the rotational velocity over the whole trajectory nicely visualizes the different phases of a rockfall regarding general acceleration and deceleration in respect to the inclination and the topography of the field. References: [1] Volkwein A, Krummenacher B, Gerber W, Lardon J, Gees F, Brügger L, Ott T (2015) Repeated controlled rockfall trajectory testing. [Abstract] Geophys. Res. Abstr. 17: EGU2015-9779. [2] Volkwein A, Klette J (2014) Semi-Automatic Determination of Rockfall Trajectories. Sensors 14: 18187-18210.
Binary Error Correcting Network Codes
Wang, Qiwen; Li, Shuo-Yen Robert
2011-01-01
We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting schemes can be arbitrarily far from achieving the optimal network throughput. We propose a new metric for errors under this model. Using this metric, we prove a new Hamming-type upper bound on the network capacity. We also show a commensurate lower bound based on GV-type codes that can be used for error-correction. The codes used to attain the lower bound are non-coherent (do not require prior knowledge of network topology). The end-to-end nature of our design enables our codes to be overlaid on classical distributed random linear network codes. Further, we free internal nodes from having to implement potentially computationally intensive link-by-link error-correction.
Khina, Anatoly
2016-08-15
We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.
Epetra developers coding guidelines.
Heroux, Michael Allen; Sexton, Paul Michael
2003-12-01
Epetra is a package of classes for the construction and use of serial and distributed parallel linear algebra objects. It is one of the base packages in Trilinos. This document describes guidelines for Epetra coding style. The issues discussed here go beyond correct C++ syntax to address issues that make code more readable and self-consistent. The guidelines presented here are intended to aid current and future development of Epetra specifically. They reflect design decisions that were made in the early development stages of Epetra. Some of the guidelines are contrary to more commonly used conventions, but we choose to continue these practices for the purposes of self-consistency. These guidelines are intended to be complimentary to policies established in the Trilinos Developers Guide.
An implicit Smooth Particle Hydrodynamic code
Knapp, Charles E. [Univ. of New Mexico, Albuquerque, NM (United States)
2000-05-01
An implicit version of the Smooth Particle Hydrodynamic (SPH) code SPHINX has been written and is working. In conjunction with the SPHINX code the new implicit code models fluids and solids under a wide range of conditions. SPH codes are Lagrangian, meshless and use particles to model the fluids and solids. The implicit code makes use of the Krylov iterative techniques for solving large linear-systems and a Newton-Raphson method for non-linear corrections. It uses numerical derivatives to construct the Jacobian matrix. It uses sparse techniques to save on memory storage and to reduce the amount of computation. It is believed that this is the first implicit SPH code to use Newton-Krylov techniques, and is also the first implicit SPH code to model solids. A description of SPH and the techniques used in the implicit code are presented. Then, the results of a number of tests cases are discussed, which include a shock tube problem, a Rayleigh-Taylor problem, a breaking dam problem, and a single jet of gas problem. The results are shown to be in very good agreement with analytic solutions, experimental results, and the explicit SPHINX code. In the case of the single jet of gas case it has been demonstrated that the implicit code can do a problem in much shorter time than the explicit code. The problem was, however, very unphysical, but it does demonstrate the potential of the implicit code. It is a first step toward a useful implicit SPH code.
Construction of Additive Reed-Muller Codes
Pujol, J; Ronquillo, L; 10.1007/978-3-642-02181-7
2009-01-01
The well known Plotkin construction is, in the current paper, generalized and used to yield new families of Z2Z4-additive codes, whose length, dimension as well as minimum distance are studied. These new constructions enable us to obtain families of Z2Z4-additive codes such that, under the Gray map, the corresponding binary codes have the same parameters and properties as the usual binary linear Reed-Muller codes. Moreover, the first family is the usual binary linear Reed-Muller family.
Building Blocks for Control System Software
Broenink, Johannes F.; Hilderink, G.H.; Amerongen van, J.; Jonker, B.; Regtien, P.P.L
2001-01-01
Software implementation of control laws for industrial systems seem straightforward, but is not. The computer code stemming from the control laws is mostly not more than 10 to 30% of the total. A building-block approach for embedded control system development is advocated to enable a fast and effici
Olive, David J
2017-01-01
This text covers both multiple linear regression and some experimental design models. The text uses the response plot to visualize the model and to detect outliers, does not assume that the error distribution has a known parametric distribution, develops prediction intervals that work when the error distribution is unknown, suggests bootstrap hypothesis tests that may be useful for inference after variable selection, and develops prediction regions and large sample theory for the multivariate linear regression model that has m response variables. A relationship between multivariate prediction regions and confidence regions provides a simple way to bootstrap confidence regions. These confidence regions often provide a practical method for testing hypotheses. There is also a chapter on generalized linear models and generalized additive models. There are many R functions to produce response and residual plots, to simulate prediction intervals and hypothesis tests, to detect outliers, and to choose response trans...
Sahai, Vivek
2013-01-01
Beginning with the basic concepts of vector spaces such as linear independence, basis and dimension, quotient space, linear transformation and duality with an exposition of the theory of linear operators on a finite dimensional vector space, this book includes the concept of eigenvalues and eigenvectors, diagonalization, triangulation and Jordan and rational canonical forms. Inner product spaces which cover finite dimensional spectral theory and an elementary theory of bilinear forms are also discussed. This new edition of the book incorporates the rich feedback of its readers. We have added new subject matter in the text to make the book more comprehensive. Many new examples have been discussed to illustrate the text. More exercises have been included. We have taken care to arrange the exercises in increasing order of difficulty. There is now a new section of hints for almost all exercises, except those which are straightforward, to enhance their importance for individual study and for classroom use.
Edwards, Harold M
1995-01-01
In his new undergraduate textbook, Harold M Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject
Trajectory Codes for Flash Memory
Anxiao,; Langberg, Michael; Schwartz, Moshe; Bruck, Jehoshua
2010-01-01
Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the stored data changes its value with certain patterns. The patterns of data updates are determined by the data structure and the application, and are independent of the constraints imposed by the storage medium. Thus, an appropriate coding scheme is needed so that the data changes can be updated and stored efficiently under the storage-medium's constraints. In this paper, we define the general rewriting problem using a graph model. It extends many known rewriting models such as floating codes, WOM codes, buffer codes, etc. We present a new rewriting scheme for flash memories, called the trajectory code, for rewriting the stored data as many times as possible without block erasures. We prove that the trajectory code is asymptotically optimal in a wide range of scenarios. We also present randomized rewriting codes optimized for expected performance (g...
Allenby, Reg
1995-01-01
As the basis of equations (and therefore problem-solving), linear algebra is the most widely taught sub-division of pure mathematics. Dr Allenby has used his experience of teaching linear algebra to write a lively book on the subject that includes historical information about the founders of the subject as well as giving a basic introduction to the mathematics undergraduate. The whole text has been written in a connected way with ideas introduced as they occur naturally. As with the other books in the series, there are many worked examples.Solutions to the exercises are available onlin
NOVEL BIPHASE CODE -INTEGRATED SIDELOBE SUPPRESSION CODE
Wang Feixue; Ou Gang; Zhuang Zhaowen
2004-01-01
A kind of novel binary phase code named sidelobe suppression code is proposed in this paper. It is defined to be the code whose corresponding optimal sidelobe suppression filter outputs the minimum sidelobes. It is shown that there do exist sidelobe suppression codes better than the conventional optimal codes-Barker codes. For example, the sidelobe suppression code of length 11 with filter of length 39 has better sidelobe level up to 17dB than that of Barker code with the same code length and filter length.
From concatenated codes to graph codes
Justesen, Jørn; Høholdt, Tom
2004-01-01
We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...
NOLB: Nonlinear Rigid Block Normal Mode Analysis Method
Hoffmann, Alexandre; Grudinin, Sergei
2017-01-01
International audience; We present a new conceptually simple and computationally efficient method for non-linear normal mode analysis called NOLB. It relies on the rotations-translations of blocks (RTB) theoretical basis developed by Y.-H. Sanejouand and colleagues. We demonstrate how to physically interpret the eigenvalues computed in the RTB basis in terms of angular and linear velocities applied to the rigid blocks and how to construct a non-linear extrapolation of motion out of these velo...
Modified BTC Algorithm for Audio Signal Coding
TOMIC, S.
2016-11-01
Full Text Available This paper describes modification of a well-known image coding algorithm, named Block Truncation Coding (BTC and its application in audio signal coding. BTC algorithm was originally designed for black and white image coding. Since black and white images and audio signals have different statistical characteristics, the application of this image coding algorithm to audio signal presents a novelty and a challenge. Several implementation modifications are described in this paper, while the original idea of the algorithm is preserved. The main modifications are performed in the area of signal quantization, by designing more adequate quantizers for audio signal processing. The result is a novel audio coding algorithm, whose performance is presented and analyzed in this research. The performance analysis indicates that this novel algorithm can be successfully applied in audio signal coding.
Bounds on Generalized Huffman Codes
Baer, Michael B
2007-01-01
New lower and upper bounds are obtained for the compression of optimal binary prefix codes according to various nonlinear codeword length objectives. Like the coding bounds for Huffman coding - which concern the traditional linear code objective of minimizing average codeword length -- these are in terms of a form of entropy and the probability of the most probable input symbol. As in Huffman coding, some upper bounds can be found using sufficient conditions for the codeword corresponding to the most probable symbol being one bit long. Whereas having probability no less than 0.4 is a tight sufficient condition for this to be the case in Huffman coding, other penalties differ, some having a tighter condition, some a looser condition, and others having no such sufficient condition. The objectives explored here are ones for which optimal codes can be found using a generalized form of Huffman coding. These objectives include one related to queueing (an increasing exponential average), one related to single-shot c...
LFSC - Linac Feedback Simulation Code
Ivanov, Valentin; /Fermilab
2008-05-01
The computer program LFSC (
Construction of Capacity Achieving Lattice Gaussian Codes
Alghamdi, Wael
2016-04-01
We propose a new approach to proving results regarding channel coding schemes based on construction-A lattices for the Additive White Gaussian Noise (AWGN) channel that yields new characterizations of the code construction parameters, i.e., the primes and dimensions of the codes, as functions of the block-length. The approach we take introduces an averaging argument that explicitly involves the considered parameters. This averaging argument is applied to a generalized Loeliger ensemble [1] to provide a more practical proof of the existence of AWGN-good lattices, and to characterize suitable parameters for the lattice Gaussian coding scheme proposed by Ling and Belfiore [3].
Apar-T: code, validation, and physical interpretation of particle-in-cell results
Melzani, Mickaël; Walder, Rolf; Folini, Doris; Favre, Jean M; Krastanov, Stefan; Messmer, Peter
2013-01-01
We present the parallel particle-in-cell (PIC) code Apar-T and, more importantly, address the fundamental question of the relations between the PIC model, the Vlasov-Maxwell theory, and real plasmas. First, we present four validation tests: spectra from simulations of thermal plasmas, linear growth rates of the relativistic tearing instability and of the filamentation instability, and non-linear filamentation merging phase. For the filamentation instability we show that the effective growth rates measured on the total energy can differ by more than 50% from the linear cold predictions and from the fastest modes of the simulation. Second, we detail a new method for initial loading of Maxwell-J\\"uttner particle distributions with relativistic bulk velocity and relativistic temperature, and explain why the traditional method with individual particle boosting fails. Third, we scrutinize the question of what description of physical plasmas is obtained by PIC models. These models rely on two building blocks: coarse...
Blind Recognition Algorithm of Turbo Codes for Communication Intelligence Systems
Ali Naseri
2011-11-01
Full Text Available Turbo codes are widely used in land and space radio communication systems, and because of complexity of structure, are custom in military communication systems. In electronic warfare, COMINT systems make attempt to recognize codes by blind ways. In this Paper, the algorithm is proposed for blind recognition of turbo code parameters like code kind, code-word length, code rate, length of interleaver and delay blocks number of convolution code. The algorithm calculations volume is0.5L3+1.25L, therefore it is suitable for real time systems.
Good Codes From Generalised Algebraic Geometry Codes
Jibril, Mubarak; Ahmed, Mohammed Zaki; Tjhai, Cen
2010-01-01
Algebraic geometry codes or Goppa codes are defined with places of degree one. In constructing generalised algebraic geometry codes places of higher degree are used. In this paper we present 41 new codes over GF(16) which improve on the best known codes of the same length and rate. The construction method uses places of small degree with a technique originally published over 10 years ago for the construction of generalised algebraic geometry codes.