会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • ARBITRATION AMONG MULTIPLE USERS OF A SHARED RESOURCE
    • 共享资源的多个用户的仲裁
    • WO1991010957A1
    • 1991-07-25
    • PCT/US1991000323
    • 1991-01-16
    • CODEX CORPORATION
    • CODEX CORPORATIONHOLT, Craig, S.KEREN-ZVI, JosephHASLEY, Lloyd, A.
    • G06F13/00
    • G06F13/374
    • Arbitration is performed among a plurality of users (12a-12n) for access to a shared resource in a system (10) of the kind in which the users (12a-12n) arbitrate by placing arbitration signals on a line (19) and subsequently comparing their arbitration signals with a signal appearing on the line (19), by providing the users (12a-12n) with independently operating clocks (18) and controlling the progression of the arbitration based on timing provided by the clock (18) of at least one of the users (12a-12n). The progression of the arbitration thus does not depend upon a single master clock, or upon synchronizing the individual user clocks (18). Users that request access are assigned a first priority in the arbitration based at least on an access priority preassigned to the request for access and on whether the user is a member of a current group of users that is formed at a time during the arbitration when another group of users is empty, the current group including users that have been denied access as of that time; at least a portion of each user's arbitration signal is arranged as a multibit word having a value that represents the first priority, and each user that arbitrates for access places its multibit word in parallel on the path and determines whether it has won the arbitration by subsequently comparing its multibit word value with the value of a multibit word that appears on the path.
    • 在用户(12a-12n)通过在线(19)上放置仲裁信号并随后进行仲裁的类型的系统(10)中的共享资源之间执行仲裁来执行仲裁 通过向用户(12a-12n)提供独立操作的时钟(18)来比较他们的仲裁信号与出现在线路(19)上的信号,并根据由时钟(18)提供的定时控制仲裁的进展 至少一个用户(12a-12n)。 因此仲裁的进展不依赖于单个主时钟,或者在同步各个用户时钟(18)时。 请求访问的用户至少基于预分配给访问请求的访问优先级以及用户是否是在仲裁期间形成的当前用户组的成员的另一个 用户组为空,当前组包括当时已被拒绝访问的用户; 每个用户的仲裁信号的至少一部分被布置为具有表示第一优先级的值的多位字,并且仲裁访问的每个用户将其多位字并行在路径上并且确定其是否已经通过随后获得仲裁 将其多位字值与出现在路径上的多位字的值进行比较。
    • 4. 发明申请
    • ADAPTIVE RATE CONTROL FOR ECHO CANCELLING MODEM
    • ECHO取消调制解调器的自适应速率控制
    • WO1990006637A1
    • 1990-06-14
    • PCT/US1989005450
    • 1989-12-04
    • CODEX CORPORATION
    • CODEX CORPORATIONSRIDHAR, Manickam, R.PAYTON, John, L.BARGOOT, Carol, Ann
    • H04B03/23
    • H04L1/002H04B3/235H04B3/238H04L1/0003H04L1/0015H04L1/0025H04L1/0054H04L5/143H04L5/1446H04L5/16
    • Channel distortion and echo signals detrimentally affect data communication over a channel. The invention provides an echo cancellation modem for full-duplex communication which selects a modulation scheme prior to data communication, and requests changes to the level of modulation during data communication when channel quality has changed significantly. The modem includes an echo canceller (12, 14), a monitor (24) for determining the quality of the channel based on analysis of a residual echo component, and a controller (46) for selecting an acceptable modulation scheme based on the analysis by the monitor. The modem requests the remote device to operate at a selected rate, and operates at the selected rate only if the the remote device concurs. The modem uses a fall forward flag (68) to prevent contention between the modem and the remote device when the remote device cannot support a requested higher level modulation scheme. The modem includes re-initialization logic which selects appropriate monitor thresholds for coded and uncoded modulation options.
    • 信道失真和回波信号有害地影响信道上的数据通信。 本发明提供一种用于全双工通信的回波抵消调制解调器,其在数据通信之前选择调制方案,并且当信道质量显着改变时,请求在数据通信期间对调制电平的改变。 调制解调器包括回波消除器(12,14),用于基于残余回波分量的分析来确定信道质量的监视器(24),以及用于基于分析的可接受调制方案来选择可接受调制方案的控制器(46) 监视器。 调制解调器请求远程设备以所选择的速率运行,并且只有在远程设备同意时才以所选择的速率运行。 当远程设备不能支持所请求的更高级别的调制方案时,调制解调器使用倒退标志(68)来防止调制解调器和远程设备之间的争用。 调制解调器包括重新初始化逻辑,其为编码和未编码的调制选项选择合适的监视器阈值。
    • 5. 发明申请
    • MULTIMODE MODEM
    • 多模式调制解调器
    • WO1989011183A1
    • 1989-11-16
    • PCT/US1989002017
    • 1989-05-10
    • CODEX CORPORATION
    • CODEX CORPORATIONGRESZCZUK, John, A.
    • H04B01/38
    • H04M11/06
    • A multimode modem for communicating with a variety of modem types employing differing initial handshake signals includes plural modulators (12, 14) which send a sequence of signals corresponding to the variety of modem type handshake signals, the sequence terminating when a handshake signal detector (24) receives an appropriate response identifying a particular one of the modem types. In a preferred embodiment, the multimode modem (10, 12, 14, 16, 18, 20, 22, 24) is adapted to interwork with V.32 and V.22bis and V.22 modems on the public switched telephone network.
    • 用于与使用不同的初始握手信号的各种调制解调器类型进行通信的多模式调制解调器包括发送与各种调制解调器类型的握手信号相对应的信号序列的多个调制器(12,14),该序列在握手信号检测器(24 )接收到识别调制解调器类型中的特定一个的适当响应。 在优选实施例中,多模式调制解调器(10,12,14,16,18,20,22,24)适于与公共交换电话网络上的V.32和V.22bis和V.22调制解调器互通。
    • 7. 发明申请
    • EFFICIENT CRC REMAINDER COEFFICIENT GENERATION AND CHECKING DEVICE AND METHOD
    • 有效的CRC残留系数生成和检查装置和方法
    • WO1994015407A1
    • 1994-07-07
    • PCT/US1993011790
    • 1993-12-06
    • CODEX CORPORATION
    • CODEX CORPORATIONLI, ShipingPASCO-ANDERSON, James, A.
    • H03M13/00
    • H03M13/091
    • Various parallel CRC remainder coefficient generation devices (100, 200, 300, 400, 500, 600, 700) and methods (1100, 1200) are described for providing efficient error detection in various digital data communication systems (800, 900, 1000). A K-bit CRC remainder is calculated from m bits at a time, where m can be less than, equal to, or greater than K, and where the processing of each of the m bits requires a total of j K-bit table look-ups into a total of j tables (410, 412, 414, 516, 518, 520, 522, 616, 614, 712, 714) of 2 entries each, where m = jb. Also required are one m-bit exclusive-or operation (208, 306, 506, 608, 706), a total of (j-1)K-bit exclusive-or operations (422, 532, 626, 628, 720), and one (K-m)-bit exclusive-or operation (216, 632) if m
    • 描述了用于在各种数字数据通信系统(800,900,1000)中提供有效的错误检测的各种并行CRC余数系数产生装置(100,200,300,400,500,600,700)和方法(1100,1200)。 一个K位CRC余数由m位计算,其中m可以小于,等于或大于K,并且每个m位的处理需要总共j个K位表 - 分别组合成每个2个条目的总共j个表(410,412,414,516,518,520,522,616,614,712,714),其中m = jb。 还需要一个m位异或操作(208,306,506,608,706),总共(j-1)个K位异或运算(422,532,626,628,720), 如果m