• Title/Summary/Keyword: Q-code

Search Result 170, Processing Time 0.036 seconds

Multi-code Biorthogonal Code Keying with Constant Amplitude Coding using Interleaving and $Q^2PSK$ for maintaining a Constant Amplitude feature and increasing Bandwidth Efficiency (정 진폭 부호화된 Multi-code Biorthogonal Code Keying 시스템에서 인터리빙과 $Q^2PSK$를 이용하여 정 진폭 특성을 유지하면서 대역폭 효율을 개선시키는 방안)

  • Kim, Sung-Pil;Kim, Myoung-Jin
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2005.08a
    • /
    • pp.427-430
    • /
    • 2005
  • A multi-code biorthogonal code keying (MBCK) system consists of multiple waveform coding blocks, and the sum of output codewords is transmitted. Drawback of MBCK is that it requires amplifier with high linearity because its output symbol is multi-level. MBCK with constant amplitude precoding block (CA-MBCK) has been proposed, which guarantees sum of orthogonal codes to have constant amplitude. The precoding block in CA-MBCK is a redundant waveform coder whose input bits are generated by processing the information bits. Redundant bits of constant amplitude coded CA-MBCK are not only used to make constant amplitude signal but also used to improve the BER performance at the receiver. In this paper, we proposed a transmission scheme which combines CA-MBCK with $Q^2PSK$ modulation to improve bandwidth efficiency of CA-MBCK and also uses chip interleaving to maintain a constant amplitude feature of CA-MBCK. bandwidth efficiency of a proposed transmission scheme is increased fourfold. And the BER performance of the scheme is same as that of CA-MBCK.

  • PDF

ON SOME MDS-CODES OVER ARBITRARY ALPHABET

  • Chang, Gyu Whan;Park, Young Ho
    • Korean Journal of Mathematics
    • /
    • v.9 no.2
    • /
    • pp.129-131
    • /
    • 2001
  • Let $q=p^{e1}_1{\cdots}p^{em}_m$ be the product of distinct prime elements. In this short paper, we show that the largest value of M such that there exists an ($n$, M, $n-1$) $q$-ary code is $q^2$ if $n-1{\leq}p^{ei}_i$ for all $i$.

  • PDF

Tradeoffs in frequency-hopped multiple-access communications with reed-solomon code and MFSK in rayleigh fading channel (레일리 페이딩 채널에서 리드-솔로몬 부호와 MFSK를 사용하는 주파수 도약 다중 접속 통신의 Tradeoff)

  • 김상우;김승호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.9A
    • /
    • pp.2173-2183
    • /
    • 1998
  • We consider a frequency-hopped multiple-access communication system that employs reed-solomon code over GF(Q) and M-ary FSK signaling ($M{\leq}Q$) in rayleigh fading channel. We investigate the tradeoff among the modulation symbol size (M), the number of frequency slots, and the code rate in maximizing the average number of successfully transmitted information bits per unit time and unit bandwidth (called normalized throughput). We find that it is desirabel to use a large M in noise-limited environment. In interference-limited environment, it is more improtant to prevent errors (hits) by increasing the number of frequency slots than to correct them with formward error correction techniques or to reduce the error rate by increasing M.

  • PDF

PRIMITIVE IDEMPOTENTS IN THE RING F4[x]/〈xpn-1〉 AND CYCLOTOMIC Q CODES

  • Batra, Sudhir;Mathur, Rekha
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.971-997
    • /
    • 2018
  • The parity of cyclotomic numbers of order 2, 4 and 6 associated with 4-cyclotomic cosets modulo an odd prime p are obtained. Hence the explicit expressions of primitive idempotents of minimal cyclic codes of length $p^n$, $n{\geq}1$ over the quaternary field $F_4$ are obtained. These codes are observed to be subcodes of Q codes of length $p^n$. Some orthogonal properties of these subcodes are discussed. The minimal cyclic codes of length 17 and 43 are also discussed and it is observed that the minimal cyclic codes of length 17 are two weight codes. Further, it is shown that a Q code of prime length is always cyclotomic like a binary duadic code and it seems that there are infinitely many prime lengths for which cyclotomic Q codes of order 6 exist.

DETERMINATION OF MINIMUM LENGTH OF SOME LINEAR CODES

  • Cheon, Eun Ju
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.26 no.1
    • /
    • pp.147-159
    • /
    • 2013
  • Hamada ([8]) and Maruta ([17]) proved the minimum length $n_3(6,\;d)=g_3(6,\;d)+1$ for some ternary codes. In this paper we consider such minimum length problem for $q{\geq}4$, and we prove that $n_q(6,\;d)=g_q(6,\;d)+1$ for $d=q^5-q^3-q^2-2q+e$, $1{\leq}e{\leq}q$. Combining this result with Theorem A in [4], we have $n_q(6,\;d)=g-q(6,\;d)+1$ for $q^5-q^3-q^2-2q+1{\leq}d{\leq}q^5-q^3-q^2$ with $q{\geq}4$. Note that $n_q(6,\;d)=g_q(6,\;d)$ for $q^5-q^3-q^2+1{\leq}d{\leq}q^5$ by Theorem 1.2.

NOTES ON MDS SELF-DUAL CODES

  • Han, Sunghyu
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.5_6
    • /
    • pp.821-827
    • /
    • 2012
  • In this paper, we prove that for all odd prime powers $q$ there exist MDS(maximum distance separable) self-dual codes over $\mathbb{F}_{q^2}$ for all even lengths up to $q+1$. Additionally, we prove that there exist MDS self-dual codes of length four over $\mathbb{F}_q$ for all $q$ > 2, $q{\neq}5$.

A study on the Patent Information Analysis on Electronic Commerce(G06Q) based on the International Patent Classification (IPC) Code (국제특허분류(IPC) 코드 기반 전자상거래(G06Q) 분야 특허 정보 분석에 관한 연구)

  • Shim, Jaeruen
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.6
    • /
    • pp.1499-1505
    • /
    • 2015
  • This study is about the patent information analysis of relevant companies and technologies based on International Patent Classification (IPC) code. 902 patent applications in the field of electronic commerce(G06Q) by NAVER, the biggest internet company in Korea, are the subjects of this study. First, we investigated the number of applications and registrations per IPC code so that we could analyze the core technology areas and the status of patent application. In addition, we examined the convergence of technologies by investigating interconnections between main and sub categories of IPC codes. Lastly, we looked into the changes in patent technologies by investigating the status of application per IPC code in accordance with year. By analyzing the IPC code based patent information used in this study, we could further expect the trends of companies and technologies.

Effect of Line-Width of Optical Sources on Performance of Spectral Amplitude Coding Optical CDMA Systems (광원 라인폭이 Spectral Amplitude Coding Optical CDMA시스템의 성능에 미치는 영향)

  • Jhee, Yoon Kyoo
    • 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$.

The design of quantization and inverse quantization unit (Q_IQ unit) module with video encoder (비디오 인코더용 양자화 및 역양자화기(Q_IQ unit) 모듈의 설계)

  • 김은원;조원경
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.11
    • /
    • pp.20-28
    • /
    • 1997
  • In this paper, quantization and inverse quantizatio unit, a sa component of MPEG-2 moving picture compression system, ar edesigned. In the processing of quantization, this design adopted newly designed arithmetic units in which quantization matrices and scale code was expressed with SD(signed-digit) code. In the arithmetic unit of inverse quantization, quantization scale code, which has 5-bits length, is splited into two pieces; 2-bits for control code, 3-bits for quantization data, and the method to devise quantization step size is proposed. The design was coded with VHDL and synthesis results in that it consumed about 6,110 gates, and operating speed is 52MHz.

  • PDF

A Study on the Algorithm for the Q-CDMA Base Station Receiver (Q-CDMA 기지국 수신기 알고리즘 연구)

  • 이태영;김환우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.9
    • /
    • pp.1812-1823
    • /
    • 1994
  • In this paper, we focus on the simulation of receiver algorithms for the Q-CDMA reverse link modem to analyze its structure and performance. Receiver algorithm is to be characterized by processing a large amount of data for reliable data transmission through poor mobile channel environment. According to Q-CDMA receiver scheme, we connect the code acqusition and code tracking models for despreading of input signals and the RAKE structure demodulator used to resolve the time diversity signal due to multipath propagation. And this connected system is under test. The bit error rates are found for an arbitrary user under the AWGN and multipath fading environments.

  • PDF