A wireless access system transmitter comprising: an arithmetic unit for converting an arithmetic process of a quadratic formula that is contained in an exponent of a CAZAC sequence-defining expression to an arithmetic process of a recursion formula to find said exponent; a sequence generation unit for using said exponent that was found by said arithmetic unit to generate a CAZAC sequence; and a transmission unit for transmitting said CAZAC sequence that was generated in said sequence generation unit as a reference signal of a data signal or as a random access preamble signal; wherein: said sequence-defining expression is Formula 1; said arithmetic unit subjects variables R(n), P^(n), and P(n) [n = 1, 2,..., N zc -1] to initialization shown in Formula 2 and to updating shown in Formula 3; and supplies variable P(n) as said exponent; where: Formula 1 is: X u n = e − j π uf n + 1 N zc, n = 0,1,..., N zc − 1 N zc: the sequence length; u: the sequence number; f(n): a quadratic formula relating to n; Formula 2 is: P(n) initialization: P^ ←0, P ← 0 R(n) initialization: R 0 ← K 0 = m • u N ZC mod m K0: the initialization value (constant value) m: the maximum value of P(n); Formula 3 is: and wherein said arithmetic unit uses a modulo m operation by means of a carry-invalidation process for P^(n) ≥ m and R(n) ≥ m to carry out an updating process shown in Formula 4 in place of the updating process of said Formula 3; where: Formula 4 is: Loop n = 1,2...(N ZC - 1) P^(n)←P^(n-1) + R(n-1) P(n)←└P^(n)┘ R(n)←R(n-1) + K 1 n←n+1 end Loop an arithmetic unit for converting an arithmetic process of a quadratic formula that is contained in an exponent of a CAZAC sequence-defining expression to an arithmetic process of a recursion formula to find said exponent; a sequence generation unit for using said exponent that was found by said arithmetic unit to generate a CAZAC sequence; and a transmission unit for transmitting said CAZAC sequence that was generated in said sequence generation unit as a reference signal of a data signal or as a random access preamble signal; wherein: said sequence-defining expression is Formula 1; said arithmetic unit subjects variables R(n), P^(n), and P(n) [n = 1, 2,..., N zc -1] to initialization shown in Formula 2 and to updating shown in Formula 3; and supplies variable P(n) as said exponent; where: Formula 1 is: X u n = e − j π uf n + 1 N zc, n = 0,1,..., N zc − 1 N zc: the sequence length; u: the sequence number; f(n): a quadratic formula relating to n; Formula 2 is: P(n) initialization: P^ ←0, P ← 0 R(n) initialization: R 0 ← K 0 = m • u N ZC mod m K0: the initialization value (constant value) m: the maximum value of P(n); Formula 3 is: and wherein said arithmetic unit uses a modulo m operation by means of a carry-invalidation process for P^(n) ≥ m and R(n) ≥ m to carry out an updating process shown in Formula 4 in place of the updating process of said Formula 3; where: Formula 4 is: Loop n = 1,2...(N ZC - 1) P^(n)←P^(n-1) + R(n-1) P(n)←└P^(n)┘ R(n)←R(n-1) + K 1 n←n+1 end Loop Formula 1 is: X u n = e − j π uf n + 1 N zc, n = 0,1,..., N zc − 1 N zc: the sequence length; u: the sequence number; f(n): a quadratic formula relating to n; Formula 2 is: P(n) initialization: P^ ←0, P ← 0 R(n) initialization: R 0 ← K 0 = m • u N ZC mod m K0: the initialization value (constant value) m: the maximum value of P(n); P(n) initialization: P^ ←0, P ← 0 R(n) initialization: R 0 ← K 0 = m • u N ZC mod m K0: the initialization value (constant value) m: the maximum value of P(n); Formula 3 is: and wherein said arithmetic unit uses a modulo m operation by means of a carry-invalidation process for P^(n) ≥ m and R(n) ≥ m to carry out an updating process shown in Formula 4 in place of the updating process of said Formula 3; where: Formula 4 is: Loop n = 1,2...(N ZC - 1) P^(n)←P^(n-1) + R(n-1) P(n)←└P^(n)┘ R(n)←R(n-1) + K 1 n←n+1 end Loop Loop n = 1,2...(N ZC - 1) P^(n)←P^(n-1) + R(n-1) P(n)←└P^(n)┘ R(n)←R(n-1) + K 1 n←n+1 end Loop