• Journal of Broadcast Engineering
• /
• v.14 no.1
• /
• pp.59-69
• /
• 2009

A bi-directional symmetric prediction technique has been developed to improve coding efficiency of B-slice and to reduce the computational complexity required to estimate two motion vectors. On the contrary to the conventional bi-directional mode which encodes both forward and backward motion vectors, it only encodes a single forward motion vector, and the missing backward motion vector is derived in a symmetric way from the forward motion vector using temporal distance between forward/backward reference frames to and from the current B picture. Since the backward motion vector is derived from the forward motion vector, it can halve the computational complexity for motion estimation, and also reduces motion vector data to encode. This technique always derives the backward motion vector from the forward motion vector, however, there are cases when the forward motion vector is better to be derived from the backward motion vector especially in scene changes. In this paper, we generalize the idea of the symmetric coding with forward motion vector coding, and propose a new symmetric coding with backward motion vector coding and adaptive selection between the conventional symmetric mode and the proposed symmetric mode based on rate-distortion optimization.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.35-42
• /
• 2010

Side information generation techniques play a great role in determining the overall performance of the DVC (Distributed Video Coding) coding system. Most conventional techniques for side information generation are mainly based on the block matching algorithm with symmetric motion estimation between the previously reconstructed key frames. But, these techniques tend to show mismatches between the motion vectors and the real placements of moving objects. So these techniques need to be modified so as to search well the real placements of moving objects. To overcome this problem, this paper proposes a block-centered symmetric motion estimation technique which uses the same coordinates with the given block. Through computer simulations, it is shown that the proposed algorithm outperforms the conventional schemes in the objective quality.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.173-176
• /
• 2013

Existing symmetric cryptography-based solutions against pollution attacks for network coding systems suffer various drawbacks, such as highly complicated key distribution and vulnerable security against collusion. This letter presents a novel homomorphic subspace message authentication code (MAC) scheme that can thwart pollution attacks in an efficient way. The basic idea is to exploit the combination of the symmetric cryptography and linear subspace properties of network coding. The proposed scheme can tolerate the compromise of up to r-1 intermediate nodes when r source keys are used. Compared to previous MAC solutions, less secret keys are needed for the source and only one secret key is distributed to each intermediate node.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.147-150
• /
• 1998

In the case of speech synthesis, the waveform coding method with high quality is mainly used to the synthesis by analysis. Because the parameters of this coding method are not classified as both excitation and vocal tract parameters, it is difficult to apply the waveform coding method to the synthesis by rule. Thus, in order to apply the waveform coding method to the synthesis by rule, a pitch alteration is required for the prosody control. In the speech synthesis method by the conventional PSOLA technique, applying symmetric window function to asymmetric speech waveform, it occurs the unbalance phenomenon of energy according to the overlapped degree of pitch interval adjustment. In this paper to overcome the unbalance phenomenon of energy, we proposed a new method that can convert asymmetric waveform to symmetric one by time-frequency conversion. As a result, we can obtain an average spectrum distortion ratio with 6.38% according to the pitch alteration ratio.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.3-14
• /
• 2013

We demonstrate a fashion of quantum channel combining and splitting, called polar quantum channel coding, to generate a quantum bit (qubit) sequence that achieves the symmetric capacity for any given binary input discrete quantum channels. The present capacity is achievable subject to input of arbitrary qubits with equal probability. The polarizing quantum channels can be well-conditioned for quantum error-correction coding, which transmits partially quantum data through some channels at rate one with the symmetric capacity near one but at rate zero through others.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.2
• /
• pp.119-124
• /
• 2015

In this paper, we analyze the effect of line-width of optical sources on the performance of spectral amplitude coding (SAC) optical code division multiple-access (OCDMA) systems. For a performance analysis we use a symmetric balanced incomplete block design (BIBD) code as the code sequence because we can construct a series of code families by choosing different values of q and m. The ideal BIBD code (m=2) requires narrower line-width than the nonideal BIBD codes when the effective power is large ($P_{sr}=-10dBm$). But the nonideal BIBD codes (m>2) need narrower line-width than the ideal BIBD code when $P_{sr}=-25dBm$.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.314-317
• /
• 2019

Recently, the symmetric superposition coding (SSC) [3] is proposed for a solution for the error propagation (EP) due to the non-perfect successive interference cancelation (SIC) in non-orthogonal multiple access (NOMA). We analyze the performance of NOMA with the SSC. It is shown that the performance of the SSC NOMA is the same as that of NOMA with the normal superposition coding (NSC) for the power allocation factor less than 20%, the SSC NOMA performance is better than the NSC NOMA performance up to the power allocation factor 80%, and the SSC NOMA performs worse than the NSC NOMA for the power allocation factor greater than 80%. As a result, the SSC should be used with consideration of the power allocation.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.39-47
• /
• 2021

Lempel-Ziv coding is one of the most famous source coding schemes. The output of this source coding is usually a non-uniform code, which requires additional source coding, such as arithmetic coding, to reduce a redundancy. However, this additional source code increases complexity and decoding latency. Thus, this paper proposes the optimal maximum a-posteriori (MAP) receiver for non-uniform source non-orthogonal multiple access (NOMA) with symmetric superposition coding (SSC). First, we derive an analytical expression of the bit-error rate (BER) for non-uniform source NOMA with SSC. Then, Monte Carlo simulations demonstrate that the BER of the optimal MAP receiver for the non-uniform source improves slightly, compared to that of the conventional receiver for the uniform source. Moreover, we also show that the BER of an approximate analytical expression is in a good agreement with the BER of Monte Carlo simulation. As a result, the proposed optimal MAP receiver for non-uniform source could be a promising scheme for NOMA with SSC, to reduce complexity and decoding latency due to additional source coding.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.110-113
• /
• 2014

In this paper, we address a problem of finding the optimum inner and outer code rates for a concatenated code in Gaussian binary symmetric channels. Clearly, as the inner code rate decreases, the error detection capability of the inner code increases. However, decreasing the inner code rate implies a decrease in error-correction capability of the outer code when overall code rate is fixed. With this notion in mind, we examine the optimum distribution of redundancy on the outer and inner codes to achieve a maximum performance gain in the concatenated coding scheme. Our analysis shows that the maximum coding gain can be obtained when the inner code rate is maximized and the outer code rate is minimized under the constraint of total code rate is fixed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.23-30
• /
• 2009

Recently, rotation symmetric Boolean functions have attracted attention since they are suitable for fast evaluation and show good cryptographic properties. For example, important problems in coding theory were settled by searching the desired functions in the rotation symmetric function space. Moreover, they are applied to designing fast hashing algorithms. On the other hand, for some homogeneous rotation symmetric quadratic functions of simple structure, the exact formulas for their Hamming weights and nonlinearity were found[2,8]. Very recently, more formulations were carried out for much broader class of the functions[6]. In this paper, we make a further improvement by deriving the formula for the Hamming weight of quadratic rotation symmetric functions containing linear terms.