Optimum conditions of the laser power P and the scan speed V were investigated experimentally so as to burn and remove the jacket of a 4-fiber ribbon completely by a system with a CO2 laser. It has been clarified that the optimum region can be given by 3 lines, which represent 2 lower limits of the laser power, depending on the scan speed, and an upper limit of the laser power to avoid soot from remaining on the fibers at high laser power region. The optimum conditions enable us to remove the jacket effectively by the system to provide excess-fiber-free compact packaging of optical components.

We propose a fast decoding algorithm for the p-ary first-order Reed-Muller code guaranteeing correction of up to errors and having complexity proportional to nlog n, where n = pm is the code length and p is an odd prime. This algorithm is an extension in the complex domain of the fast Hadamard transform decoding algorithm applicable to the binary case.

In this letter, we present quasi-Jacket block matrices over GF(2), i.e., binary matrices which all are belong to a class of cocyclic matrices. These matrices are may be useful in digital signal processing, CDMA, and coded modulation. Based on Circular Permutation Matrix (CPM) cocyclic quasi-Jacket block low-density matrix is introduced in this letter which is useful in coding theory. Additionally, we show that the fast algorithm of quasi-Jacket block matrix.

In this paper, we briefly describe a fast Jacket transform based on simple matrices factorization. The proposed algorithm needs fewer and simpler computations than that of the existing methods, which are RJ's [2], Lee's [7] and Yang's algorithm [8]. Therefore, it can be easily applied to develop the efficient fast algorithm for signal processing and data communications.

In this paper, the previous definition of the Reverse Jacket matrix (RJM) is revised and generalized. In particular, it is shown that the inverse of the RJM can be obtained easily by a constructive approach similar to that used for the RJM itself. As new results, some useful properties of RJMs, such as commutativity and the Hamiltonian symmetry appearing in half the blocks of a RJM, are shown, and also 1-D fast Reverse Jacket transform (FRJT) is presented. The algorithm of the FRJT is remarkably efficient than that of the center-weighted Hadamard transform (CWHT). The FRJT is extended in terms of the Kronecker products of the Hadamard matrix. The 1-D FRJT is applied to the discrete Fourier transform (DFT) with order 4, and the N-point DFT can be expressed in terms of matrix decomposition by using 4 4 FRJT.

In this paper, we present a polynomial construction based on Jacket and Hadamard matrices over the Galois Field. The construction has two modes, one only includes matrices extension, and the other includes a center-weighted scheme for polynomial representations. Here, an "addition" scheme is used to represent matrices, which can lead to simple operations and convenient implementation of hardware.

A new type jacket cutter for optical fibers is designed, and it is confirmed experimentally that its performance is superior to those of the conventional cutters. Using this new cutter which is mainly consisted of a rotatable fiber holder and a pair of blades separated by a distance of 0.3-0.4mm, only the tight jacket is cut and removed while the primary coating and the fiber are kept intact. As the result, the probability of damage to the fiber surface during jacket removal is reduced to about 0% compared to 10% found in the case of a conventional cutter. This result is useful to increase the reliability of optical fibers during assembling efforts.